Submission #1691689

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int x[100010], w[100010], ans[100010];
PII p[100010];
signed main(void)
{
  int n, l, t;
  cin >> n >> l >> t;
  REP(i, n) {
    cin >> x[i] >> w[i];
    p[i] = {x[i], w[i]};
  }
  sort(p, p+n);

  // 最初0番のゼッケンの蟻が何番のゼッケンでどの位置になるか
  int num = 0, pos = 0;
  if(p[0].second == 1) {
    num = 0;
    FOR(i, 1, n) {
      if(p[i].second == 2 && p[i].first-p[0].first<=2*t) num++;
    }
    pos = (p[0].first + t) % l;
  } else {
    num = 0;
    for(int i=n-1; i>=1; --i) {
      if(p[i].second == 1 && p[0].first+(l-p[i].first)<=2*t) num--;
    }
    // cout << num << endl;
    num = ((num%n)+n)%n;
    pos = (((p[0].first - t) % l) + l) % l;
  }

  // cout << num << " " << pos << endl;

  // 最終的に蟻がいる位置の集合
  VI v;
  REP(i, n) {
    if(p[i].second == 1) v.PB((p[i].first+t)%l);
    else v.PB((((p[i].first-t)%l)+l)%l);
  }
  sort(ALL(v));
  // for(int i: v) cout << i << " "; cout << endl;

  int st = -1;
  REP(i, n) {
    if(v[i] == pos) {st = i; break;}
  }
  // cout << "st:" << st << endl;
  FOR(i, st, n) {
    ans[num] = v[i];
    num = (num+1)%n;
  }
  REP(i, st) {
    ans[num] = v[i];
    num = (num+1)%n;
  }

  REP(i, n) cout << ans[i] << endl;

  return 0;
}

Submission Info

Judge Result