Submission #2241927

---

Source Code Expand

#include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;

vector<ll> solve(int N, ll L, ll T, const vector<ll>& X, const vector<ll>& W) {
  vector<ll> pos(N);
  for (int i = 0; i < N; i++) {
    pos[i] = W[i] == 1 ? (X[i] + T) % L : (X[i] - T % L + L) % L;
  }
  int k = -1;
  for (int i = 0; i < N; i++) {
    if (W[i] == 1) {
      k = i;
      break;
    }
  }
  if (k == -1) {
    return pos;
  }
  ll cross_k = 0;
  for (int i = 0; i < N; i++) {
    if (W[i] == 2) {
      ll d = X[i] - X[0];
      if (d < 2 * T) {
        cross_k += (2 * T - d + L - 1) / L;
      }
    }
  }
  int label_k = cross_k % N;
  ll pos_k = pos[k];
  sort(pos.begin(), pos.end());
  int off = find(pos.begin(), pos.end(), pos_k) - pos.begin();
  vector<ll> ans(N);
  for (int i = 0; i < N; i++) {
    int j = (off + i) % N;
    int label = (label_k + i) % N;
    ans[label] = pos[j];
  }
  return ans;
}

int main() {
  int N;
  ll L, T;
  while (cin >> N >> L >> T) {
    vector<ll> X(N), W(N);
    for (int i = 0; i < N; i++) {
      cin >> X[i] >> W[i];
    }
    auto ans = solve(N, L, T, X, W);
    for (ll x : ans) {
      cout << x << endl;
    }
  }
  return 0;
}

Submission Info

Judge Result