Submission #1358649


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n, t[100009], w[100009], L, T, J; vector<int>g;
int main() {
	cin >> n >> L >> T;
	for (int i = 0; i < n; i++) {
		cin >> t[i] >> w[i];
		if (w[i] == 1) { g.push_back((t[i] + (T%L)) % L); J += (t[i] + T) / L; }
		if (w[i] == 2) { int F = t[i] - (T%L); while (F < 0)F += L; g.push_back(F%L); J -= (T - t[i] - 1 + L) / L; }
	}
	sort(g.begin(), g.end());
	for (int i = 0; i < g.size(); i++)cout << g[(1LL * J + 1LL * n * 1000000007 + i) % n] << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Ants on a Circle
User E869120
Language C++14 (GCC 5.4.1)
Score 700
Code Size 556 Byte
Status AC
Exec Time 237 ms
Memory 2552 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_01.txt AC 139 ms 1660 KB
subtask_1_02.txt AC 110 ms 1404 KB
subtask_1_03.txt AC 235 ms 2552 KB
subtask_1_04.txt AC 237 ms 2424 KB
subtask_1_05.txt AC 36 ms 640 KB
subtask_1_06.txt AC 51 ms 768 KB
subtask_1_07.txt AC 210 ms 2168 KB
subtask_1_08.txt AC 220 ms 2168 KB
subtask_1_09.txt AC 140 ms 1532 KB
subtask_1_10.txt AC 122 ms 1404 KB
subtask_1_11.txt AC 32 ms 640 KB
subtask_1_12.txt AC 205 ms 2296 KB
subtask_1_13.txt AC 153 ms 1788 KB
subtask_1_14.txt AC 139 ms 1660 KB
subtask_1_15.txt AC 1 ms 256 KB
subtask_1_16.txt AC 1 ms 256 KB