Submission #211563

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
211563	2020-03-20T17:26:35 Z	admin	Senior Postmen (BOI14_postmen)	C++14	55 / 100	500 ms	57632 KB

postmen

#include <bits/stdc++.h>
using namespace std;
 
vector<pair<int, int>> graph[500001];
bool visited[500001], used[500001];
int nxt[500001];
 
void dfs(int node) {
	if (visited[node]) {
		while (visited[node]) {
			visited[node] = false;
			cout << node << ' ';
			node = nxt[node];
		}
		cout << '\n';
	}
	while (graph[node].size()) {
		int c, idx;
		tie(c, idx) = graph[node].back();
		graph[node].pop_back();
		if (!used[idx]) {
			used[idx] = true;
			visited[node] = true;
			nxt[node] = c;
			dfs(c);
		}
	}
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		graph[a].push_back({b, i});
		graph[b].push_back({a, i});
	}
	
	dfs(1);
	return 0;
}

Subtask #1

38.0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	12160 KB	Output is correct
2	Correct	13 ms	12160 KB	Output is correct
3	Correct	12 ms	12032 KB	Output is correct
4	Correct	13 ms	12416 KB	Output is correct
5	Correct	12 ms	12160 KB	Output is correct
6	Correct	13 ms	12416 KB	Output is correct
7	Correct	20 ms	13312 KB	Output is correct
8	Correct	14 ms	12288 KB	Output is correct
9	Correct	53 ms	19192 KB	Output is correct
10	Correct	13 ms	12288 KB	Output is correct
11	Correct	13 ms	12288 KB	Output is correct
12	Correct	57 ms	19552 KB	Output is correct

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	12084 KB	Output is correct
2	Correct	11 ms	12032 KB	Output is correct
3	Correct	15 ms	12160 KB	Output is correct
4	Correct	13 ms	12288 KB	Output is correct
5	Correct	12 ms	12160 KB	Output is correct
6	Correct	12 ms	12416 KB	Output is correct
7	Correct	20 ms	13288 KB	Output is correct
8	Correct	13 ms	12288 KB	Output is correct
9	Correct	47 ms	19168 KB	Output is correct
10	Correct	13 ms	12288 KB	Output is correct
11	Correct	12 ms	12288 KB	Output is correct
12	Correct	57 ms	19560 KB	Output is correct
13	Correct	94 ms	21092 KB	Output is correct
14	Correct	87 ms	18400 KB	Output is correct
15	Correct	84 ms	20332 KB	Output is correct
16	Correct	96 ms	21240 KB	Output is correct
17	Correct	86 ms	16248 KB	Output is correct
18	Correct	87 ms	19704 KB	Output is correct

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	12032 KB	Output is correct
2	Correct	12 ms	12032 KB	Output is correct
3	Correct	12 ms	12160 KB	Output is correct
4	Correct	14 ms	12356 KB	Output is correct
5	Correct	13 ms	12160 KB	Output is correct
6	Correct	13 ms	12416 KB	Output is correct
7	Correct	17 ms	13312 KB	Output is correct
8	Correct	12 ms	12288 KB	Output is correct
9	Correct	53 ms	19168 KB	Output is correct
10	Correct	17 ms	12288 KB	Output is correct
11	Correct	13 ms	12416 KB	Output is correct
12	Correct	59 ms	19536 KB	Output is correct
13	Correct	91 ms	21088 KB	Output is correct
14	Correct	82 ms	18384 KB	Output is correct
15	Correct	84 ms	20364 KB	Output is correct
16	Correct	87 ms	21088 KB	Output is correct
17	Correct	83 ms	16376 KB	Output is correct
18	Correct	85 ms	19576 KB	Output is correct
19	Execution timed out	543 ms	57632 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-