669D - Little Artem and Dance - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, q; cin >> n >> q;
    int pos1 = 0, pos2 = 1;
    while (q--) {
        int type; cin >> type;
        if (type == 1) {
            int x; cin >> x;
            pos1 = (pos1 + (x + n) % n) % n;
            pos2 = (pos2 + (x + n) % n) % n;
        }
        else {
            pos1 ^= 1;
            pos2 ^= 1;
        }
    }
    vector<int> ans(n);
    ans[pos1] = 1;
    ans[pos2] = 2;
    int noww = 3;
    for (int i = (pos1 + 2) % n; i != pos1; i = (i + 2) % n) {
        ans[i] = noww;
        noww += 2;
    }
    noww = 4;
    for (int i = (pos2 + 2) % n; i != pos2; i = (i + 2) % n) {
        ans[i] = noww;
        noww += 2;
    }
    for (auto& u : ans) cout << u << ' ';
    cout << '\n';

    return 0;
}/*1691156894.4127584*/