Submission #1337974

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N, L, T;
int pos1;
vector<int> X;
vector<char> W;
vector<int> P;
vector<int> ans;

void calcu_last_pos(void) {
	P.resize(N);
	for (int i = 0; i < N; ++i) {
		int pos = (W[i] == '+') ? X[i] + T : X[i] - T;
		pos %= L;
		if (pos < 0)
			pos += L;
		P[i] = pos;
		if (i == 0)
			pos1 = pos;
	}
}

int calcu_cross_count(void) {
	int cnt = 0;
	if (W[0] == '+') {
		for (int i = 1; i < N; ++i) {
			if (W[i] == '+')
				continue;
			int d = 2 * T - (X[i] - X[0]);
			if (d > 0) {
				++cnt;
				int k =  d / L;
				cnt += k;
			}
		}
	}
	else {
		for (int i = 1; i < N; ++i) {
			if (W[i] == '-')
				continue;
			int d = 2 * T + (X[i] - X[0]) - L;
			if (d > 0) {
				++cnt;
				int k = d / L;
				cnt += k;
			}
		}
	}
	return cnt;
}

void set_ans(int k, int m) {
	for (int i = 0; i < N; ++i) {
		ans[m - 1] = P[k];
		++k;
		if (k >= N)
			k = 0;
		++m;
		if (m > N)
			m = 1;
	}
}

void solve(void) {
	ans.resize(N, 0);
	for (int i = 0; i < N; ++i) {
		if (P[i] == pos1) {
			int num;
			int cnt;
			if (W[0] == '+') {
				cnt = calcu_cross_count();
				num = (1 + cnt) % N;
				if (num == 0)
					num = N;
				if (i < N - 1 && P[i] == P[i + 1])
					i += 1;
			}
			else {
				cnt = calcu_cross_count();
				num = (1 - cnt) % N;
				num += N;
				num %= N;
				if (num == 0)
					num = N;
				if (i < N - 1 && P[i] == P[i + 1] && (num - cnt == 1))
					i += 1;
			}
			set_ans(i, num);
			break;
		}
	}
}

int main(void) {
	cin >> N >> L >> T;
	X.resize(N);
	W.resize(N, '+');

	for (int i = 0; i < N; ++i) {
		int dir;
		cin >> X[i] >> dir;
		if (dir == 2)
			W[i] = '-';
	}

	calcu_last_pos();
	sort(P.begin(), P.end());
	solve();

	for (int i = 0; i < N; ++i)
		cout << ans[i] << '\n';
	return 0;
}

Submission Info

Judge Result