Problem p03953 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) {
    is >> t;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (T t : v) {
    os << t << " ";
  }
  os << "\n";
  return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

struct repl {
  vector<int> v;
  int n;
  repl(vector<int> v) : v(v), n(v.size()) {}
  repl &operator*=(repl a) {
    repl nr(*this);
    rep(i, n) nr.v[i] = a.v[v[i]];
    return *this = nr;
  }
  repl pow(ll t) {
    repl res(vector<int>(n, 0)), a(*this);
    rep(i, n) res.v[i] = i;
    while (t > 0) {
      if (t & 1)
        res *= a;
      t >>= 1;
      a *= a;
    }
    return res;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  vi x(n);
  cin >> x;
  int m, k;
  cin >> m >> k;
  vi a(m);
  cin >> a;
  rep(i, m) a[i]--;
  vi v(n - 1), dis(n - 1);
  rep(i, n - 1) dis[i] = x[i + 1] - x[i];
  rep(i, n - 1) v[i] = i;
  rep(i, m) swap(v[a[i] - 1], v[a[i]]);
  vi cv = v;
  rep(i, n - 1) v[cv[i]] = i;
  repl r(v);
  vi res = r.pow(k).v;
  vi ndis(n - 1);
  rep(i, n - 1) ndis[res[i]] = dis[i];
  ll ans = x[0];
  cout << ans << endl;
  rep(i, n - 1) {
    ans += ndis[i];
    cout << ans << endl;
  }
}


Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) {
    is >> t;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (T t : v) {
    os << t << " ";
  }
  os << "\n";
  return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

struct repl {
  vector<int> v;
  int n;
  repl(vector<int> v) : v(v), n(v.size()) {}
  repl &operator*=(repl a) {
    repl nr(*this);
    rep(i, n) nr.v[i] = a.v[v[i]];
    return *this = nr;
  }
  repl pow(ll t) {
    repl res(vector<int>(n, 0)), a(*this);
    rep(i, n) res.v[i] = i;
    while (t > 0) {
      if (t & 1)
        res *= a;
      t >>= 1;
      a *= a;
    }
    return res;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  vi x(n);
  cin >> x;
  int m;
  ll k;
  cin >> m >> k;
  vi a(m);
  cin >> a;
  rep(i, m) a[i]--;
  vi v(n - 1), dis(n - 1);
  rep(i, n - 1) dis[i] = x[i + 1] - x[i];
  rep(i, n - 1) v[i] = i;
  rep(i, m) swap(v[a[i] - 1], v[a[i]]);
  vi cv = v;
  rep(i, n - 1) v[cv[i]] = i;
  repl r(v);
  vi res = r.pow(k).v;
  vi ndis(n - 1);
  rep(i, n - 1) ndis[res[i]] = dis[i];
  ll ans = x[0];
  cout << ans << endl;
  rep(i, n - 1) {
    ans += ndis[i];
    cout << ans << endl;
  }
}