# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260023 | 2020-08-09T01:36:08 Z | anonymous | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 61412 KB |
#include <iostream> #include <vector> #include <utility> #define MAXN 500005 using namespace std; int N, M, del[MAXN], inStack[MAXN]; vector <pair<int,int> > adj[MAXN]; vector <int> S,S2; void dfs(int u) { //Hierholzer while (adj[u].size()) { int v = adj[u].back().first, id = adj[u].back().second; adj[u].pop_back(); if (!del[id]) { del[id] = true; dfs(v); } } S.push_back(u); } int main() { //freopen("seniorin.txt","r",stdin); scanf("%d %d",&N,&M); for (int i=1; i<=M; i++) { int u,v; scanf("%d %d",&u,&v); adj[u].push_back({v,i}); adj[v].push_back({u,i}); } dfs(1); for (int i=0; i<S.size(); i++) { if (inStack[S[i]]) { while (S2.size() && S2.back() != S[i]) { printf("%d ",S2.back()); inStack[S2.back()]--; S2.pop_back(); } printf("%d\n",S[i]); } else { inStack[S[i]]++; S2.push_back(S[i]); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 8 ms | 12032 KB | Output is correct |
3 | Correct | 8 ms | 12032 KB | Output is correct |
4 | Correct | 11 ms | 12288 KB | Output is correct |
5 | Correct | 9 ms | 12160 KB | Output is correct |
6 | Correct | 10 ms | 12416 KB | Output is correct |
7 | Correct | 15 ms | 13312 KB | Output is correct |
8 | Correct | 10 ms | 12288 KB | Output is correct |
9 | Correct | 54 ms | 19196 KB | Output is correct |
10 | Correct | 10 ms | 12288 KB | Output is correct |
11 | Correct | 11 ms | 12288 KB | Output is correct |
12 | Correct | 59 ms | 19700 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 8 ms | 12032 KB | Output is correct |
3 | Correct | 8 ms | 12032 KB | Output is correct |
4 | Correct | 10 ms | 12288 KB | Output is correct |
5 | Correct | 9 ms | 12160 KB | Output is correct |
6 | Correct | 10 ms | 12416 KB | Output is correct |
7 | Correct | 15 ms | 13312 KB | Output is correct |
8 | Correct | 9 ms | 12288 KB | Output is correct |
9 | Correct | 58 ms | 19196 KB | Output is correct |
10 | Correct | 10 ms | 12288 KB | Output is correct |
11 | Correct | 10 ms | 12288 KB | Output is correct |
12 | Correct | 58 ms | 19700 KB | Output is correct |
13 | Correct | 80 ms | 21748 KB | Output is correct |
14 | Correct | 95 ms | 19700 KB | Output is correct |
15 | Correct | 72 ms | 20716 KB | Output is correct |
16 | Correct | 88 ms | 21748 KB | Output is correct |
17 | Correct | 89 ms | 17908 KB | Output is correct |
18 | Correct | 87 ms | 20340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 12032 KB | Output is correct |
2 | Correct | 8 ms | 12032 KB | Output is correct |
3 | Correct | 9 ms | 12032 KB | Output is correct |
4 | Correct | 10 ms | 12288 KB | Output is correct |
5 | Correct | 9 ms | 12160 KB | Output is correct |
6 | Correct | 10 ms | 12416 KB | Output is correct |
7 | Correct | 15 ms | 13312 KB | Output is correct |
8 | Correct | 9 ms | 12288 KB | Output is correct |
9 | Correct | 52 ms | 19196 KB | Output is correct |
10 | Correct | 10 ms | 12288 KB | Output is correct |
11 | Correct | 10 ms | 12288 KB | Output is correct |
12 | Correct | 58 ms | 19700 KB | Output is correct |
13 | Correct | 78 ms | 21748 KB | Output is correct |
14 | Correct | 78 ms | 19832 KB | Output is correct |
15 | Correct | 72 ms | 20844 KB | Output is correct |
16 | Correct | 85 ms | 21876 KB | Output is correct |
17 | Correct | 81 ms | 17908 KB | Output is correct |
18 | Correct | 74 ms | 20340 KB | Output is correct |
19 | Execution timed out | 525 ms | 61412 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |