Submission #1513603

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int main()
{
  int N, L, T, X[100000], W[100000];

  cin >> N >> L >> T;
  for(int i = 0; i < N; i++) {
    cin >> X[i] >> W[i];
  }
  vector< int > ans;
  int diff = 0;
  for(int i = 0; i < N; i++) {
    int vv;
    if(W[i] == 1) {
      vv = (X[i] + T) % L;
      diff += (X[i] + T) / L;
    } else {
      vv = ((X[i] - T) % L + L) % L;
      diff -= (T - X[i] + L - 1) / L;
    }
    ans.push_back(vv);
  }
  sort(begin(ans), end(ans));
  diff = (diff + N) % N;
  for(int i = 0; i < N; i++) cout << ans[(diff + i) % N] << endl;
}

Submission Info

Judge Result