# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98420 | 2019-02-23T11:58:40 Z | Kastanda | Senior Postmen (BOI14_postmen) | C++11 | 500 ms | 42912 KB |
#include<bits/stdc++.h> using namespace std; const int N = 500005; int n, m, cyc, from[N], to[N], M[N], S[N], ri[N]; int ts, st[N]; vector < int > Adj[N]; /*void DFS(int v) { S[v] = 1; #define id (Adj[v][ri[v]]) #define u (from[id] ^ to[id] ^ v) while (ri[v]) { ri[v] --; //int id = Adj[v][ri[v]]; if (M[id]) continue; M[id] = 1; //int u = from[id] ^ to[id] ^ v; if (S[u]) { cyc = u; S[v] = 0; printf("%d", v); return ; } DFS(u); if (cyc) printf(" %d", v); if (cyc != v) { S[v] = 0; return ; } else cyc = 0, printf("\n"); } #undef id #undef u S[v] = 0; }*/ int v, u, id; inline void DFS() { ts = 0; st[++ ts] = v; while (ts) { v = st[ts]; S[v] = 1; while (ri[v] < (int)Adj[v].size()) { id = (Adj[v][ri[v]]); ri[v] ++; u = (from[id] ^ to[id] ^ v); if (M[id]) continue; M[id] = 1; if (S[u]) { while (st[ts] != u) { printf("%d ", st[ts]); S[st[ts]] = 0; ts --; } printf("%d\n", u); ts ++; break; } st[++ ts] = u; ts ++; break; } ts --; } } int main() { scanf("%d%d", &n, &m); for (int i = 1; i <= m; i++) { scanf("%d%d", &from[i], &to[i]); Adj[from[i]].push_back(i); Adj[to[i]].push_back(i); } for (int i = 1; i <= n; i++) ri[i] = 0; for (int i = 1; i <= n; i++) v = i, DFS(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12080 KB | Output is correct |
2 | Correct | 14 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12160 KB | Output is correct |
4 | Correct | 14 ms | 12288 KB | Output is correct |
5 | Correct | 11 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12288 KB | Output is correct |
7 | Correct | 18 ms | 12520 KB | Output is correct |
8 | Correct | 14 ms | 12288 KB | Output is correct |
9 | Correct | 49 ms | 14712 KB | Output is correct |
10 | Correct | 18 ms | 12288 KB | Output is correct |
11 | Correct | 12 ms | 12288 KB | Output is correct |
12 | Correct | 61 ms | 14968 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12160 KB | Output is correct |
4 | Correct | 13 ms | 12288 KB | Output is correct |
5 | Correct | 13 ms | 12160 KB | Output is correct |
6 | Correct | 17 ms | 12288 KB | Output is correct |
7 | Correct | 17 ms | 12544 KB | Output is correct |
8 | Correct | 13 ms | 12160 KB | Output is correct |
9 | Correct | 60 ms | 14616 KB | Output is correct |
10 | Correct | 13 ms | 12264 KB | Output is correct |
11 | Correct | 13 ms | 12244 KB | Output is correct |
12 | Correct | 61 ms | 14840 KB | Output is correct |
13 | Correct | 94 ms | 18296 KB | Output is correct |
14 | Correct | 95 ms | 16760 KB | Output is correct |
15 | Correct | 80 ms | 16624 KB | Output is correct |
16 | Correct | 99 ms | 18124 KB | Output is correct |
17 | Correct | 104 ms | 16608 KB | Output is correct |
18 | Correct | 98 ms | 16864 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 12136 KB | Output is correct |
2 | Correct | 15 ms | 12160 KB | Output is correct |
3 | Correct | 11 ms | 12160 KB | Output is correct |
4 | Correct | 14 ms | 12208 KB | Output is correct |
5 | Correct | 11 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12288 KB | Output is correct |
7 | Correct | 18 ms | 12544 KB | Output is correct |
8 | Correct | 13 ms | 12288 KB | Output is correct |
9 | Correct | 52 ms | 14584 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 13 ms | 12288 KB | Output is correct |
12 | Correct | 72 ms | 14840 KB | Output is correct |
13 | Correct | 95 ms | 18168 KB | Output is correct |
14 | Correct | 96 ms | 16760 KB | Output is correct |
15 | Correct | 85 ms | 16624 KB | Output is correct |
16 | Correct | 115 ms | 18144 KB | Output is correct |
17 | Correct | 98 ms | 16632 KB | Output is correct |
18 | Correct | 102 ms | 16888 KB | Output is correct |
19 | Execution timed out | 609 ms | 42912 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |