Submission #1303906

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N, L, T;
    cin >> N >> L >> T;
    vll X(N), W(N), p(N);
    rep(i, N) {
        cin >> X[i] >> W[i];
        if (W[i] == 1) {
            p[i] = X[i] + T;
        } else {
            p[i] = X[i] - T;
        }
        p[i] %= L;
        if (p[i] < 0)p[i] += L;
    }
    ll s = p[0];
    sort(all(p));

    ll id = 0;
    FOR(i, 1, N) {
        if (W[0] != W[i]) {
            ll d = W[0] == 1 ? X[i] - X[0] : X[0] + L - X[i];
            if (T >= (d + 1) / 2) {
                ll y = (2 * T - d) / L + 1;
                if (W[0] == 1)id += y;
                else id -= y;
            }
       }
    }
    id %= N;
    if (id < 0)id += N;
    ll pos = 0;
    rep(i, N)if (s == p[i]) {
        pos = i;
        if (N > 1 && W[0] == 1 && p[i] == p[(i + 1) % N])pos = (i + 1) % N;
        if (N > 1 && W[0] == 2 && p[i] == p[(i + N - 1) % N])pos = (i + N - 1) % N;
        break;
    }

    vll ans(N);
    rep(i, N)ans[(id + i) % N] = p[(pos + i) % N];
    rep(i, N)cout << ans[i] << endl;
}

Submission Info

Judge Result