oj.uz

Submission #212372

# Submission time Handle Problem Language Result Execution time Memory
212372 2020-03-22T19:33:30 Z dolphingarlic Senior Postmen (BOI14_postmen) C++14
100 / 100
 461 ms 47224 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>> g[500001];
bool v[500001], u[500001];
int nxt[500001];
 
void dfs(int node) {
	if (v[node]) {
		while (v[node]) {
			v[node] = false;
			cout << node << ' ';
			node = nxt[node];
		}
		cout << '\n';
	}
	while (g[node].size()) {
		int c, idx;
		tie(c, idx) = g[node].back();
		g[node].pop_back();
		if (!u[idx]) {
			u[idx] = true;
			v[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;
		g[a].push_back({b, i});
		g[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 12160 KB Output is correct
3 Correct 11 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 15 ms 12928 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 40 ms 17144 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 43 ms 17528 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 12 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 12928 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 41 ms 17152 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 43 ms 17528 KB Output is correct
13 Correct 70 ms 19068 KB Output is correct
14 Correct 60 ms 17400 KB Output is correct
15 Correct 58 ms 18284 KB Output is correct
16 Correct 84 ms 19064 KB Output is correct
17 Correct 90 ms 16120 KB Output is correct
18 Correct 83 ms 17944 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 12 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 12 ms 12288 KB Output is correct
7 Correct 16 ms 12928 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 44 ms 17144 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 47 ms 17528 KB Output is correct
13 Correct 84 ms 19064 KB Output is correct
14 Correct 60 ms 17400 KB Output is correct
15 Correct 78 ms 18284 KB Output is correct
16 Correct 85 ms 19064 KB Output is correct
17 Correct 64 ms 16120 KB Output is correct
18 Correct 81 ms 18044 KB Output is correct
19 Correct 432 ms 47100 KB Output is correct
20 Correct 430 ms 38876 KB Output is correct
21 Correct 377 ms 43100 KB Output is correct
22 Correct 439 ms 47224 KB Output is correct
23 Correct 168 ms 36216 KB Output is correct
24 Correct 461 ms 32504 KB Output is correct
25 Correct 450 ms 42068 KB Output is correct