# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231117 | 2020-05-12T19:31:56 Z | MKopchev | Potemkin cycle (CEOI15_indcyc) | C++14 | 9 ms | 2688 KB |
#include<bits/stdc++.h> using namespace std; const int nmax=1e3+42,mmax=1e5+42; int n,m; bool in[nmax][nmax]; vector<int> adj[nmax]; pair<int,int> inp[nmax]; int when[nmax],parent[nmax]; queue< pair<int/*node*/,int/*dist*/> > q,idle; void test_build(int u,int v) { q=idle; for(int i=1;i<=n;i++)when[i]=n+1; for(int i=1;i<=n;i++) if(in[i][u]&&in[i][v])when[i]=-1; q.push({u,0}); when[u]=0; while(q.size()) { pair<int/*node*/,int/*dist*/> tp=q.front(); q.pop(); for(auto k:adj[tp.first]) { if(tp.first==u&&k==v)continue; if(when[k]>when[tp.first]+1) { when[k]=when[tp.first]+1; q.push({k,when[k]}); parent[k]=tp.first; } } } /* cout<<u<<" "<<v<<endl; for(int i=1;i<=n;i++)cout<<when[i]<<" ";cout<<endl; */ if(when[v]>n)return; printf("%i",v); while(v!=u) { v=parent[v]; printf(" %i",v); } printf("\n"); exit(0); } int main() { scanf("%i%i",&n,&m); for(int i=1;i<=m;i++) { int u,v; scanf("%i%i",&u,&v); in[u][v]=1; in[v][u]=1; inp[i]={u,v}; adj[u].push_back(v); adj[v].push_back(u); } for(int i=1;i<=m;i++) test_build(inp[i].first,inp[i].second); printf("no\n"); return 0; }
Compilation message
# | 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 | 4 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 4 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 512 KB | Output is correct |
2 | Correct | 9 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 1280 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 1280 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 2688 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 2688 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 1584 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |