# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52984 | 2018-06-27T12:54:43 Z | Bruteforceman | Senior Postmen (BOI14_postmen) | C++11 | 500 ms | 55776 KB |
#include <bits/stdc++.h> using namespace std; #define prev dfsdf vector <int> g[500010]; int l[500010], r[500010]; bool del[500010]; vector <int> tour; void dfs(int x) { while (!g[x].empty()){ int i = g[x].back(); g[x].pop_back(); if(del[i]) continue; del[i] = true; int y = l[i] ^ r[i] ^ x; dfs(y); } tour.push_back(x); } bool occ[500010]; int main (int argc, char const* argv[]) { int n, m; scanf("%d %d", &n, &m); for(int i = 0; i < m; i++) { int p, q; scanf("%d %d", &p, &q); l[i] = p; r[i] = q; g[p].push_back(i); g[q].push_back(i); } dfs(1); vector <int> cycle; for(int i = 0; i < tour.size(); i++) { int x = tour[i]; if(occ[x] == false) { cycle.push_back(x); occ[x] = true; } else { while(cycle.back() != x) { int node = cycle.back(); printf("%d ", node); occ[node] = false; cycle.pop_back(); } printf("%d\n", x); } } return 0; } // 1 5 8 7 5 4 7 6 3 4 8 10 9 2 3 1
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 12160 KB | Output is correct |
2 | Correct | 12 ms | 12032 KB | Output is correct |
3 | Correct | 12 ms | 12032 KB | Output is correct |
4 | Correct | 19 ms | 12288 KB | Output is correct |
5 | Correct | 27 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12416 KB | Output is correct |
7 | Correct | 21 ms | 13032 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 59 ms | 18008 KB | Output is correct |
10 | Correct | 15 ms | 12288 KB | Output is correct |
11 | Correct | 14 ms | 12308 KB | Output is correct |
12 | Correct | 64 ms | 18396 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12160 KB | Output is correct |
2 | Correct | 12 ms | 12160 KB | Output is correct |
3 | Correct | 13 ms | 12160 KB | Output is correct |
4 | Correct | 14 ms | 12288 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12416 KB | Output is correct |
7 | Correct | 17 ms | 13160 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 53 ms | 17904 KB | Output is correct |
10 | Correct | 14 ms | 12288 KB | Output is correct |
11 | Correct | 14 ms | 12288 KB | Output is correct |
12 | Correct | 63 ms | 18312 KB | Output is correct |
13 | Correct | 102 ms | 20812 KB | Output is correct |
14 | Correct | 111 ms | 18408 KB | Output is correct |
15 | Correct | 89 ms | 19544 KB | Output is correct |
16 | Correct | 104 ms | 20852 KB | Output is correct |
17 | Correct | 106 ms | 16728 KB | Output is correct |
18 | Correct | 104 ms | 18932 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12032 KB | Output is correct |
2 | Correct | 11 ms | 12160 KB | Output is correct |
3 | Correct | 16 ms | 12032 KB | Output is correct |
4 | Correct | 17 ms | 12336 KB | Output is correct |
5 | Correct | 18 ms | 12156 KB | Output is correct |
6 | Correct | 22 ms | 12416 KB | Output is correct |
7 | Correct | 18 ms | 13056 KB | Output is correct |
8 | Correct | 17 ms | 12264 KB | Output is correct |
9 | Correct | 66 ms | 17976 KB | Output is correct |
10 | Correct | 14 ms | 12288 KB | Output is correct |
11 | Correct | 13 ms | 12288 KB | Output is correct |
12 | Correct | 70 ms | 18164 KB | Output is correct |
13 | Correct | 121 ms | 20872 KB | Output is correct |
14 | Correct | 110 ms | 18420 KB | Output is correct |
15 | Correct | 101 ms | 19440 KB | Output is correct |
16 | Correct | 113 ms | 20852 KB | Output is correct |
17 | Correct | 118 ms | 16752 KB | Output is correct |
18 | Correct | 116 ms | 18932 KB | Output is correct |
19 | Execution timed out | 651 ms | 55776 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |