D. Little Artem and Dance---cf669D（模拟）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
#define N 1000100
#define met(a, b) memset(a, b, sizeof(a))

int n, Q, a[N];

int main()
{
    while(scanf("%d %d", &n, &Q)!=EOF)
    {
        met(a, 0);

        int first = 0, second = 1, op, x;

        while(Q--)
        {
            scanf("%d", &op);
            if(op == 1)
            {
                scanf("%d", &x);
                first = (x + first + n) % n;
                second = (x + second + n) % n;
            }
            else
            {///如果1所在位置下标是偶数(相对于下标为0来说的)，那么1的位置就要往后挪一位，2则相反；
                if(first%2)
                {
                    first = (first - 1 + n) % n;
                    second = (second + 1 + n) % n;
                }
                else
                {
                    first = (first + 1 + n) % n;
                    second = (second - 1 + n) % n;
                }
            }
        }
        int num = 1;
        while(num <= n)///填入n个数
        {
            a[first] = num++;///奇数所在位置
            a[second] = num++;
            first = (first+2) % n;///要加两个的，
            second = (second+2) % n;
        }
        for(int i=0; i<n; i++)
            printf("%d%c", a[i], i==n-1?‘\n‘:‘ ‘);
    }
    return 0;
}
/*
6 9
2
1 -2
2
1 -6
1 -6
1 4
2
1 -1
2

2 5 4 1 6 3
*/