Submission #1345414

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;

void jump(vector<int>& pos, vector<int> m){
    vector<int> prev = pos;
    for(int i=0;i<pos.size();i++){
        pos[i] = prev[m[i]];
    }
}

int main(){
    int N;
    cin >> N;

    vector<int> x(N);
    for(int i=0;i<N;i++){
        cin >> x[i];
    }

    vector<int> d(N-1), pos(N-1), m(N-1);
    for(int i=0;i<N-1;i++){
        d[i] = x[i+1] - x[i];
        pos[i] = i;
        m[i] = i;
    }

    int M;
    ll K;
    cin >> M >> K;

    for(int i=0;i<M;i++){
        int a;
        cin >> a;
        swap(m[a-2], m[a-1]);
    }

    while(K > 0){
        if(K % 2 == 1){
            jump(pos, m);
        }
        jump(m, m);
        K /= 2;
    }

    ll s = x[0];
    cout << s << endl;
    for(int i=0;i<N-1;i++){
        s += d[pos[i]];
        cout << s << endl;
    }
    assert(s == x[N-1]);

    return 0;
}

Submission Info

Judge Result