# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26873 | 2017-07-06T17:02:15 Z | top34051 | Senior Postmen (BOI14_postmen) | C++14 | 500 ms | 86652 KB |
#include<bits/stdc++.h> using namespace std; #define maxn 500005 int n,m; int now[maxn]; int out[maxn]; bool vis[maxn]; vector<pair<int,int> > from[maxn]; stack<pair<int,int> > st; void dfs(int x,int last) { int i,y; if(out[x]) { while(!st.empty()) { y = st.top().first; printf("%d ",y); --out[y]; st.pop(); if(y==x) break; } printf("\n"); } for(;now[x]<from[x].size();) { i = now[x]++; if(!vis[from[x][i].second]) { ++out[x]; st.push({x,from[x][i].first}); vis[from[x][i].second] = 1; dfs(from[x][i].first,x); } } } main() { int i,x,y; scanf("%d%d",&n,&m); for(i=1;i<=m;i++) { scanf("%d%d",&x,&y); from[x].push_back({y,i}); from[y].push_back({x,i}); } dfs(1,0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 12160 KB | Output is correct |
2 | Correct | 11 ms | 12032 KB | Output is correct |
3 | Correct | 11 ms | 12160 KB | Output is correct |
4 | Correct | 13 ms | 12520 KB | Output is correct |
5 | Correct | 12 ms | 12212 KB | Output is correct |
6 | Correct | 18 ms | 12572 KB | Output is correct |
7 | Correct | 18 ms | 13952 KB | Output is correct |
8 | Correct | 15 ms | 12392 KB | Output is correct |
9 | Correct | 59 ms | 23904 KB | Output is correct |
10 | Correct | 13 ms | 12288 KB | Output is correct |
11 | Correct | 15 ms | 12416 KB | Output is correct |
12 | Correct | 88 ms | 24300 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 12160 KB | Output is correct |
2 | Correct | 15 ms | 12160 KB | Output is correct |
3 | Correct | 12 ms | 12064 KB | Output is correct |
4 | Correct | 13 ms | 12408 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 15 ms | 12672 KB | Output is correct |
7 | Correct | 19 ms | 13952 KB | Output is correct |
8 | Correct | 12 ms | 12416 KB | Output is correct |
9 | Correct | 56 ms | 23856 KB | Output is correct |
10 | Correct | 15 ms | 12264 KB | Output is correct |
11 | Correct | 15 ms | 12416 KB | Output is correct |
12 | Correct | 65 ms | 24308 KB | Output is correct |
13 | Correct | 93 ms | 26872 KB | Output is correct |
14 | Correct | 77 ms | 20984 KB | Output is correct |
15 | Correct | 93 ms | 25192 KB | Output is correct |
16 | Correct | 94 ms | 26872 KB | Output is correct |
17 | Correct | 102 ms | 17132 KB | Output is correct |
18 | Correct | 97 ms | 23576 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 12032 KB | Output is correct |
2 | Correct | 12 ms | 12132 KB | Output is correct |
3 | Correct | 13 ms | 12032 KB | Output is correct |
4 | Correct | 13 ms | 12544 KB | Output is correct |
5 | Correct | 12 ms | 12160 KB | Output is correct |
6 | Correct | 13 ms | 12672 KB | Output is correct |
7 | Correct | 20 ms | 13952 KB | Output is correct |
8 | Correct | 13 ms | 12416 KB | Output is correct |
9 | Correct | 55 ms | 23928 KB | Output is correct |
10 | Correct | 15 ms | 12316 KB | Output is correct |
11 | Correct | 13 ms | 12416 KB | Output is correct |
12 | Correct | 71 ms | 24224 KB | Output is correct |
13 | Correct | 89 ms | 27000 KB | Output is correct |
14 | Correct | 80 ms | 20984 KB | Output is correct |
15 | Correct | 93 ms | 25264 KB | Output is correct |
16 | Correct | 102 ms | 26872 KB | Output is correct |
17 | Correct | 105 ms | 17144 KB | Output is correct |
18 | Correct | 93 ms | 23416 KB | Output is correct |
19 | Execution timed out | 550 ms | 86652 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |