railway Batch , stdin/stdout

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

For all subtasks, 1 ≤ N ≤ 100 000, 1 ≤ Q ≤ 100 000.

Subtask 1 (27%): Each city is connected by at most 2 trains.

Subtask 2 (22%): 1 ≤ N ≤ 10 000, 1 ≤ Q ≤ 10 000.

Subtask 3 (51%): No further constraints.

Subtask 4 (0%): Sample Testcases.

Your browser does not support embedded PDF files. Please download the PDF instead.

Subtask	Score	#TC	Time	Memory	Scoring
1	27	10	1s	32MB	Minimum
2	22	11	1s	32MB	Minimum
3	51	31	1s	32MB	Minimum
4	0	1	1s	32MB	Minimum

g++-8 ans.cpp -o railway -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512