# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103596 | 2019-03-31T19:25:04 Z | luciocf | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 21112 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 5e5+10; typedef pair<int, int> pii; int stk[maxn], tt; bool markEdge[maxn], mark[maxn]; vector<pii> grafo[maxn]; void dfs(int u) { if (mark[u]) { while (true) { int v = stk[tt--]; mark[v] = 0; if (v == u) { printf("%d\n", v); break; } printf("%d ", v); } } for (auto v: grafo[u]) { if (!markEdge[v.second]) { mark[u] = 1; stk[++tt] = u; markEdge[v.second] = 1; dfs(v.first); } } } int main(void) { int n, m; scanf("%d %d", &n, &m); for (int i = 1; i <= m; i++) { int u, v; scanf("%d %d", &u, &v); grafo[u].push_back({v, i}); grafo[v].push_back({u, i}); } dfs(1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 12032 KB | Output is correct |
2 | Correct | 14 ms | 12008 KB | Output is correct |
3 | Correct | 14 ms | 12032 KB | Output is correct |
4 | Correct | 15 ms | 12288 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 14 ms | 12416 KB | Output is correct |
7 | Correct | 23 ms | 13312 KB | Output is correct |
8 | Correct | 14 ms | 12288 KB | Output is correct |
9 | Correct | 115 ms | 19192 KB | Output is correct |
10 | Correct | 17 ms | 12160 KB | Output is correct |
11 | Correct | 12 ms | 12288 KB | Output is correct |
12 | Correct | 76 ms | 19548 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12208 KB | Output is correct |
2 | Correct | 12 ms | 12160 KB | Output is correct |
3 | Correct | 12 ms | 12032 KB | Output is correct |
4 | Correct | 16 ms | 12288 KB | Output is correct |
5 | Correct | 13 ms | 12160 KB | Output is correct |
6 | Correct | 17 ms | 12416 KB | Output is correct |
7 | Correct | 19 ms | 13312 KB | Output is correct |
8 | Correct | 12 ms | 12288 KB | Output is correct |
9 | Correct | 105 ms | 19168 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 13 ms | 12288 KB | Output is correct |
12 | Correct | 74 ms | 19596 KB | Output is correct |
13 | Correct | 102 ms | 21112 KB | Output is correct |
14 | Correct | 98 ms | 18220 KB | Output is correct |
15 | Execution timed out | 1095 ms | 19948 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |
# | 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 | 13 ms | 12032 KB | Output is correct |
4 | Correct | 17 ms | 12288 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 15 ms | 12444 KB | Output is correct |
7 | Correct | 20 ms | 13288 KB | Output is correct |
8 | Correct | 17 ms | 12288 KB | Output is correct |
9 | Correct | 114 ms | 19104 KB | Output is correct |
10 | Correct | 16 ms | 12160 KB | Output is correct |
11 | Correct | 13 ms | 12288 KB | Output is correct |
12 | Correct | 71 ms | 19552 KB | Output is correct |
13 | Correct | 99 ms | 21088 KB | Output is correct |
14 | Correct | 97 ms | 18040 KB | Output is correct |
15 | Execution timed out | 1084 ms | 20068 KB | Time limit exceeded |
16 | Halted | 0 ms | 0 KB | - |