Submission #74524470

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int n, m, a[100010];
long long k;
int x[100010];
using P = array<int, 100010>;
void mul(P &a, const P &b){
    static P r;
    for (int i = 1; i <= n; ++i)r[i] = a[b[i]];
    copy_n(r.begin() + 1, n, a.begin() + 1);
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i)cin >> x[i];
    for (int i = n; i > 1; --i)x[i] -= x[i - 1];
    cin >> m >> k;
    static P g;
    iota(g.begin() + 1, g.begin() + n + 1, 1);
    while (m--){
        int a;
        cin >> a;
        swap(g[a], g[a + 1]);
    }
    static P e;
    iota(e.begin() + 1, e.begin() + n + 1, 1);
    for (; k; k >>= 1, mul(g, g))
        if (k & 1)mul(e, g);
    long long s = 0;
    for (int i = 1; i <= n; ++i)cout << (s += x[e[i]]) << "\n";
    return 0;
}

Submission Info

Judge Result