D. Little Artem and Dance

题目连接：

http://www.codeforces.com/contest/669/problem/D

Description

Little Artem is fond of dancing. Most of all dances Artem likes rueda — Cuban dance that is danced by pairs of boys and girls forming a circle and dancing together.

More detailed, there are n pairs of boys and girls standing in a circle. Initially, boy number 1 dances with a girl number 1, boy number 2 dances with a girl number 2 and so on. Girls are numbered in the clockwise order. During the dance different moves are announced and all pairs perform this moves. While performing moves boys move along the circle, while girls always stay at their initial position. For the purpose of this problem we consider two different types of moves:

Value x and some direction are announced, and all boys move x positions in the corresponding direction.
Boys dancing with even-indexed girls swap positions with boys who are dancing with odd-indexed girls. That is the one who was dancing with the girl 1 swaps with the one who was dancing with the girl number 2, while the one who was dancing with girl number 3 swaps with the one who was dancing with the girl number 4 and so one. It’s guaranteed that n is even.
Your task is to determine the final position of each boy.

Input

The first line of the input contains two integers n and q (2 ≤ n ≤ 1 000 000, 1 ≤ q ≤ 2 000 000) — the number of couples in the rueda and the number of commands to perform, respectively. It’s guaranteed that n is even.

Next q lines contain the descriptions of the commands. Each command has type as the integer 1 or 2 first. Command of the first type is given as x ( - n ≤ x ≤ n), where 0 ≤ x ≤ n means all boys moves x girls in clockwise direction, while  - x means all boys move x positions in counter-clockwise direction. There is no other input for commands of the second type.

Output

Output n integers, the i-th of them should be equal to the index of boy the i-th girl is dancing with after performing all q moves.

Sample Input

6 3
1 2
2
1 2

Sample Output

4 3 6 5 2 1

Hint

题意

给你n个数，一开始是1 2 3 4 5 6 这样的

现在有两个操作，第一个操作是所有数向右边移动x个位置

第二个操作奇数和偶数的位置互换

题解：

比较显然就是，奇数和偶数位置的数的相对位置是不会变的

那么我们只要知道1和2这两个位置的数是啥就好了

然后交换的时候，我们就模拟一下这两个位置的交换就好了

代码

#include<bits/stdc++.h>
using namespace std;

int n,q;
int a,b;
int main()
{
    scanf("%d%d",&n,&q);
    b = 0,a = 0;
    for(int i=1;i<=q;i++)
    {
        int op;
        scanf("%d",&op);
        if(op==1)
        {
            int x;scanf("%d",&x);
            a = (n+a-x)%n;
            b = (n+b-x)%n;
            if(x%2)swap(a,b);
        }
        else
        {
            a = (a+n-1)%n;
            b = (b+n+1)%n;
            swap(a,b);
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(i%2)cout<<(a+i-1+n)%n+1<<" ";
        else cout<<(b+i-1+n)%n+1<<" ";
    }
    cout<<endl;
}