# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42217 | 2018-02-23T17:50:10 Z | gabrielsimoes | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 80716 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 500010; vector<pair<int, int>> g[MAXN]; int ix[MAXN]; bool used[MAXN]; vector<int> v; int dfs(int cur) { while (ix[cur] < g[cur].size()) { if (!used[g[cur][ix[cur]].second]) { used[g[cur][ix[cur]].second] = true; dfs(g[cur][ix[cur]].first); v.push_back(cur); } ix[cur]++; } } void print(vector<int>& v, int pos) { while (pos < v.size()) printf("%d ", v[pos++]); printf("\n"); } vector<int> in[MAXN]; int main() { int n, m; scanf("%d %d", &n, &m); for (int i = 0, a, b; i < m; i++) { scanf("%d %d", &a, &b); g[a].push_back({b, i}); g[b].push_back({a, i}); } dfs(1); reverse(v.begin(), v.end()); vector<int> stk; for (int x : v) { if (!in[x].empty()) { int pos = in[x].back(); print(stk, pos); for (int i = pos; i < stk.size(); i++) in[stk[i]].pop_back(); stk.resize(pos); } in[x].push_back(stk.size()); stk.push_back(x); } print(stk, 0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 23784 KB | Output is correct |
2 | Correct | 21 ms | 23808 KB | Output is correct |
3 | Correct | 20 ms | 23808 KB | Output is correct |
4 | Correct | 21 ms | 24064 KB | Output is correct |
5 | Correct | 27 ms | 23936 KB | Output is correct |
6 | Correct | 20 ms | 24064 KB | Output is correct |
7 | Correct | 25 ms | 24960 KB | Output is correct |
8 | Correct | 22 ms | 24064 KB | Output is correct |
9 | Correct | 60 ms | 29820 KB | Output is correct |
10 | Correct | 21 ms | 24064 KB | Output is correct |
11 | Correct | 20 ms | 24064 KB | Output is correct |
12 | Correct | 67 ms | 30324 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 23784 KB | Output is correct |
2 | Correct | 17 ms | 23808 KB | Output is correct |
3 | Correct | 18 ms | 23808 KB | Output is correct |
4 | Correct | 19 ms | 24064 KB | Output is correct |
5 | Correct | 18 ms | 23936 KB | Output is correct |
6 | Correct | 24 ms | 24096 KB | Output is correct |
7 | Correct | 25 ms | 24960 KB | Output is correct |
8 | Correct | 20 ms | 24060 KB | Output is correct |
9 | Correct | 60 ms | 29924 KB | Output is correct |
10 | Correct | 25 ms | 24112 KB | Output is correct |
11 | Correct | 18 ms | 24064 KB | Output is correct |
12 | Correct | 70 ms | 30196 KB | Output is correct |
13 | Correct | 95 ms | 35060 KB | Output is correct |
14 | Correct | 100 ms | 32116 KB | Output is correct |
15 | Correct | 121 ms | 32924 KB | Output is correct |
16 | Correct | 107 ms | 35060 KB | Output is correct |
17 | Correct | 147 ms | 30452 KB | Output is correct |
18 | Correct | 108 ms | 32732 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 23808 KB | Output is correct |
2 | Correct | 19 ms | 23784 KB | Output is correct |
3 | Correct | 19 ms | 23808 KB | Output is correct |
4 | Correct | 23 ms | 24064 KB | Output is correct |
5 | Correct | 19 ms | 23936 KB | Output is correct |
6 | Correct | 23 ms | 24064 KB | Output is correct |
7 | Correct | 28 ms | 24960 KB | Output is correct |
8 | Correct | 20 ms | 23988 KB | Output is correct |
9 | Correct | 67 ms | 29924 KB | Output is correct |
10 | Correct | 20 ms | 24064 KB | Output is correct |
11 | Correct | 21 ms | 24064 KB | Output is correct |
12 | Correct | 67 ms | 30300 KB | Output is correct |
13 | Correct | 117 ms | 35108 KB | Output is correct |
14 | Correct | 122 ms | 32116 KB | Output is correct |
15 | Correct | 117 ms | 32852 KB | Output is correct |
16 | Correct | 119 ms | 35036 KB | Output is correct |
17 | Correct | 127 ms | 30452 KB | Output is correct |
18 | Correct | 104 ms | 32732 KB | Output is correct |
19 | Execution timed out | 567 ms | 80716 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |