1021번: 회전하는 큐

#include<cstdio>
#include<queue>
using namespace std;
int checkQueue(queue<int> *q, queue<int> *gacha);
void reverseQueue(queue<int> *q);
int main()
{
    queue<int> q1, q2, gachaNumbers;
    int qSize, gachaCount, result = 0;
    scanf("%d %d", &qSize, &gachaCount);
    for (int i = 0; i < gachaCount; ++i)
    {
        int t;
        scanf("%d", &t);
        gachaNumbers.push(t);
    }
    q2.push(1);
    for (int i = 0; ++i <= qSize; q1.push(i));
    for (int i = qSize; i > 1; q2.push(i--));
 
    while (gachaCount--)
    {
        int qNum1 = checkQueue(&q1, &gachaNumbers);
        int qNum2 = checkQueue(&q2, &gachaNumbers);
        result += ((qNum1 < qNum2) ? qNum1 : qNum2);
        gachaNumbers.pop();
        reverseQueue(&q2);
    }
    printf("%d", result);
    return 0;
}
 
int checkQueue(queue<int> *q, queue<int> *gacha)
{
    int tempNum = 0;
    while (true)
    {
        if ((*q).front() == (*gacha).front())
        {
            (*q).pop();
            break;
        }
        ++tempNum;
        (*q).push((*q).front());
        (*q).pop();
    }
    return tempNum;
}
 
void reverseQueue(queue<int> *q)
{
    for (int i = 0; i < (*q).size() - 1; ++i)
    {
        (*q).push((*q).front());
        (*q).pop();
    }
}

무식하지만 큐 두개로 회전시킨 코드.

실제로 돌리면 안되겠구나.

그래서 데크로 다시 짬

#include<deque>
#include<cstdio>
using namespace std;
int main()
{
    deque<int> left, right;
    int n, m, result = 0;
    scanf("%d %d", &n, &m);
    for (int i = 0; i++ < n; left.push_back(i), right.push_back(i));
    for (int tmp; m--;)
    {
        scanf("%d", &tmp);
        int lRes = 0, rRes = 0;
        while (left.front() != tmp)
        {
            ++lRes;
            left.push_back(left.front());
            left.pop_front();
        }
        while (right.front() != tmp)
        {
            ++rRes;
            right.push_front(right.back());
            right.pop_back();
        }
        left.pop_front();
        right.pop_front();
        result += (lRes < rRes) ? lRes : rRes;
    }
    printf("%d", result);
}