Submission #3046018

---

Source Code Expand

#include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
#include <iomanip>
#include <utility>
using namespace std;
using ll = long long;
typedef pair <int, int> pii;
int main()
{

	//int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
	ll a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, ans = 0;
	//cout << LONG_MAX << endl;
	string s;
	//long long n, A[1000000000];
	int n, m, q;
	//int   y[100001], z[100001], x[10001] = {};
	//pii y[100001];
	//pair<int, float> pii[100001];
	ll A[100001];
	cin >> n;
	cin >> l;
	ll t;
	cin >> t;
	t %= l;
	for (a = 0; a < n; a++)
	{
		cin >> b;
		cin >> c;
		if (a == 0)
		{
			d = b;
			e = c;
		}
		if (e != c)
		{
			if (e == 2)
			{
				f -= (t * 2 + l - (b - d)) / l;
				f %= n;
				f += n;
				f %= n;
			}
			else
			{
				f += (t * 2 + l - (b - d)) / l;
				f %= n;
			}
		}

		if (c == 1)
		{
			//cout << (b+t)%l << endl;
			A[a] = (b + t) % l;
		}
		else
		{
			//cout << (b - t+l) % l << endl;
			A[a] = (b - t + l) % l;
			A[a] += l;
			A[a] %= l;
		}
		//cout << endl;
		//cout << f << endl;
	}
	for (a = 0; a < n; a++)
	{
		//cout << A[a] << endl;
	}
	//cout << endl;
	//cout << f << endl;
	if (e == 1)
	{


		d = (d + t) % l;
		sort(A, A + n);
		//f = 0;
		//cout << d << endl;
		//cout << lower_bound(A, A + n, d) - A << endl;
		g = lower_bound(A, A + n, d) - A;

		cout << endl;
		f = (g - f) % n;
		f += n;
		f %= n;
	}
	else
	{
		d = (d - t) % l;
		d += l;
		d %= l;
		sort(A, A + n);
		//f = 0;
		//cout << d << endl;
		//cout << lower_bound(A, A + n, d) - A << endl;
		g = lower_bound(A, A + n, d) - A;
		//cout << endl;
		f = (g - f) % n;
		f += n;
		f %= n;
		/*if (A[g] == A[g - 1])
		{

		}*/
	}
	for (a = 0; a < n; a++)
	{
		cout << A[f] << endl;
		f++;
		if (f == n)
		{
			f = 0;
		}
	}

	////std::cout << std::fixed;
	//cout << std::setprecision(20) << << endl;
	//cout << d+1 << endl;
	//cout << "" << endl;


	return 0;
}

Submission Info

Judge Result