Submission #3457025

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200005;
int read(){
	int x=0,f=1;
	char ch=getchar();
	while (!isdigit(ch)&&ch!='-')
		ch=getchar();
	if (ch=='-')
		f=-1,ch=getchar();
	while (isdigit(ch))
		x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}
int n,L,T;
int x[N],w[N],res[N];
int main(){
	n=read(),L=read(),T=read();
	int p=n-1;
	for (int i=0;i<n;i++){
		x[i]=read(),w[i]=read()&1;
		if (w[i]){
			res[i]=(x[i]+T)%L;
			p=(p-(T+x[i])/L%n+n)%n;
		}
		else {
			res[i]=((x[i]-T)%L+L)%L;
			p=(p+(T-x[i])/L%n+n)%n;
		}
	}
	sort(res,res+n);
	for (int i=0;i<n;i++,p=(p+1)%n)
		printf("%d\n",res[p]);
	return 0;
}

Submission Info

Judge Result