oj.uz

Submission #212368

# Submission time Handle Problem Language Result Execution time Memory
212368 2020-03-22T19:29:15 Z dolphingarlic Senior Postmen (BOI14_postmen) C++14
100 / 100
 473 ms 54016 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
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 11 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 12 ms 12288 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 40 ms 17912 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 45 ms 18296 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 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 11 ms 12160 KB Output is correct
6 Correct 12 ms 12416 KB Output is correct
7 Correct 16 ms 13184 KB Output is correct
8 Correct 12 ms 12280 KB Output is correct
9 Correct 40 ms 17784 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 46 ms 18296 KB Output is correct
13 Correct 65 ms 20216 KB Output is correct
14 Correct 72 ms 18424 KB Output is correct
15 Correct 60 ms 19180 KB Output is correct
16 Correct 74 ms 20216 KB Output is correct
17 Correct 67 ms 17272 KB Output is correct
18 Correct 70 ms 19184 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 12 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 39 ms 17920 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 46 ms 18296 KB Output is correct
13 Correct 65 ms 20216 KB Output is correct
14 Correct 63 ms 18552 KB Output is correct
15 Correct 59 ms 19180 KB Output is correct
16 Correct 75 ms 20216 KB Output is correct
17 Correct 67 ms 17144 KB Output is correct
18 Correct 63 ms 19192 KB Output is correct
19 Correct 457 ms 54016 KB Output is correct
20 Correct 425 ms 45304 KB Output is correct
21 Correct 390 ms 48092 KB Output is correct
22 Correct 444 ms 53880 KB Output is correct
23 Correct 176 ms 40056 KB Output is correct
24 Correct 473 ms 39032 KB Output is correct
25 Correct 450 ms 48376 KB Output is correct