# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
11586 | 2014-12-02T16:05:43 Z | gs14004 | Senior Postmen (BOI14_postmen) | C++ | 500 ms | 6752 KB |
#include <cstdio> #include <vector> #include <cstring> using namespace std; int n,m; int st[1000005], con[1000005], link[1000005], v[1000005], sz; vector<int> cyc, temp; void add_edge(int s, int e){ sz++; link[sz] = e; con[sz] = st[s]; st[s] = sz; sz++; link[sz] = s; con[sz] = st[e]; st[e] = sz; } void f(int x){ int p = st[x]; while (p) { int pos = link[p]; if(p&1) v[p+1]=1; else v[p-1]=1; if(!v[p]){ v[p]=1; f(pos); } p = con[p]; } st[x] = 0; cyc.push_back(x); } int vis[500005]; int main(){ scanf("%d %d",&n,&m); for (int i=0; i<m; i++) { int s,e; scanf("%d %d",&s,&e); add_edge(s,e); } f(1); for (int i=0; i<cyc.size(); i++) { temp.push_back(cyc[i]); if(vis[cyc[i]]){ printf("%d",temp.back()); temp.pop_back(); while(temp.back() != cyc[i]){ printf(" %d",temp.back()); vis[temp.back()] = 0; temp.pop_back(); if(temp.back() == cyc[i]) printf("\n"); } } else vis[cyc[i]] = 1; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 13 ms | 512 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 9 ms | 640 KB | Output is correct |
7 | Correct | 32 ms | 1408 KB | Output is correct |
8 | Correct | 6 ms | 512 KB | Output is correct |
9 | Execution timed out | 726 ms | 6748 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 15 ms | 636 KB | Output is correct |
5 | Correct | 6 ms | 384 KB | Output is correct |
6 | Correct | 12 ms | 640 KB | Output is correct |
7 | Correct | 34 ms | 1376 KB | Output is correct |
8 | Correct | 6 ms | 512 KB | Output is correct |
9 | Execution timed out | 772 ms | 6752 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 13 ms | 616 KB | Output is correct |
5 | Correct | 6 ms | 384 KB | Output is correct |
6 | Correct | 12 ms | 804 KB | Output is correct |
7 | Correct | 31 ms | 1280 KB | Output is correct |
8 | Correct | 7 ms | 544 KB | Output is correct |
9 | Execution timed out | 739 ms | 6740 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |