Submission #211560

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
211560	2020-03-20T17:20:18 Z	admin	Senior Postmen (BOI14_postmen)	C++14	55 / 100	500 ms	57572 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	12032 KB	Output is correct
2	Correct	13 ms	12160 KB	Output is correct
3	Correct	11 ms	12160 KB	Output is correct
4	Correct	13 ms	12288 KB	Output is correct
5	Correct	15 ms	12160 KB	Output is correct
6	Correct	13 ms	12416 KB	Output is correct
7	Correct	22 ms	13312 KB	Output is correct
8	Correct	13 ms	12288 KB	Output is correct
9	Correct	51 ms	19200 KB	Output is correct
10	Correct	13 ms	12288 KB	Output is correct
11	Correct	13 ms	12340 KB	Output is correct
12	Correct	57 ms	19580 KB	Output is correct

Subtask #2

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	12160 KB	Output is correct
2	Correct	14 ms	12160 KB	Output is correct
3	Correct	11 ms	12032 KB	Output is correct
4	Correct	24 ms	12392 KB	Output is correct
5	Correct	12 ms	12212 KB	Output is correct
6	Correct	13 ms	12416 KB	Output is correct
7	Correct	20 ms	13312 KB	Output is correct
8	Correct	17 ms	12288 KB	Output is correct
9	Correct	67 ms	19264 KB	Output is correct
10	Correct	13 ms	12288 KB	Output is correct
11	Correct	16 ms	12288 KB	Output is correct
12	Correct	48 ms	19576 KB	Output is correct
13	Correct	81 ms	21112 KB	Output is correct
14	Correct	88 ms	18424 KB	Output is correct
15	Correct	73 ms	20332 KB	Output is correct
16	Correct	98 ms	21112 KB	Output is correct
17	Correct	79 ms	16248 KB	Output is correct
18	Correct	90 ms	19624 KB	Output is correct

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	12160 KB	Output is correct
2	Correct	11 ms	12032 KB	Output is correct
3	Correct	11 ms	12160 KB	Output is correct
4	Correct	12 ms	12288 KB	Output is correct
5	Correct	13 ms	12160 KB	Output is correct
6	Correct	14 ms	12416 KB	Output is correct
7	Correct	24 ms	13312 KB	Output is correct
8	Correct	12 ms	12288 KB	Output is correct
9	Correct	48 ms	19192 KB	Output is correct
10	Correct	18 ms	12288 KB	Output is correct
11	Correct	12 ms	12288 KB	Output is correct
12	Correct	47 ms	19576 KB	Output is correct
13	Correct	88 ms	21112 KB	Output is correct
14	Correct	103 ms	18424 KB	Output is correct
15	Correct	83 ms	20332 KB	Output is correct
16	Correct	90 ms	21112 KB	Output is correct
17	Correct	79 ms	16376 KB	Output is correct
18	Correct	85 ms	19576 KB	Output is correct
19	Execution timed out	521 ms	57572 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-