Submission #1241161

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 100010;
const int inf = 0x0fffffff;
#define LL long long
const long long mod = 1000000007;

int main()
{
	int N,L,T,W,X[maxn];
	int i, cur;
	cin >> N >> L >> T;
	cur = 0;
	for (i = 0; i < N; i ++)
	{
		cin >> X[i] >> W;
		if (W == 1)
		{
			cur += (X[i] + T) / L;
			X[i] = (X[i] + T) % L;
		}
		else
		{
			cur += (X[i] - T) / L;
			X[i] = (X[i] - T) % L;
			if (X[i] < 0)
			{
				X[i] += L;
				cur --;
			}
		}
		cur %= N;
	}
	cur = (cur + N) % N;
	sort(X, X+ N);
	for (i = 0; i < N; i ++)
		cout << X[(i + cur) % N] << endl;
	return 0;
}

Submission Info

Judge Result