Submission #1820074

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 100010
ll x[N], w[N], y[N];
int main(){
	ll n, l, t;
	cin>>n>>l>>t;
	rep(i, n){
		cin>>x[i]>>w[i];
		w[i] = w[i]==1?1:-1;
		y[i] = (x[i]+w[i]*t)%l;
		if(y[i]<0) y[i] += l;
	}
	ll sw = 0, w0 = w[0];
	if(w[0]<0){
		rep(i, n) w[i] *= -1;
		rep(i, n) x[i] *= -1;
	}
	rep(i, n){
		if(w[i]>0) continue;
		ll a = x[0]-x[i], b = x[0]-x[i]+2*t;
		//cerr<<i<<" "<<a<<" "<<b<<endl;
		if(a<0) sw++;
		sw += b/l;
	}
	if(w0<0){
		rep(i, n) w[i] *= -1;
		rep(i, n) x[i] *= -1;
		sw *= -1;
		sw %= n;
		if(sw<0) sw += n;
	}
	cerr<<sw<<endl;
	rep(i, n) cout<<y[(i-sw+n)%n]<<endl;
	return 0;
}

Submission Info

Judge Result