# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172951 | 2020-01-02T19:16:20 Z | phillip | Potemkin cycle (CEOI15_indcyc) | C++14 | 123 ms | 504 KB |
#include<bits/stdc++.h> #define ll long long using namespace std; int vis[109],org; vector<int>cc,v[109]; void out() { for(int i=0;i<cc.size();i++)cout<<cc[i]+1<<" "; exit(0); } void dfs(int x,int par) { //cout<<x<<" "<<par<<"\n"; cc.push_back(x); for(int i=0;i<v[x].size();i++) { if(v[x][i]==par)continue; if(vis[v[x][i]]) { if(v[x][i]==org&&cc.size()>=4)continue; cc.pop_back(); return; } } for(int i=0;i<v[x].size();i++) { if(v[x][i]==par)continue; if(v[x][i]==org&&cc.size()>=4)out(); } vis[x]=1; for(int i=0;i<v[x].size();i++) { int y=v[x][i]; if(y==par)continue; dfs(y,x); } cc.pop_back(); vis[x]=0; } int n,m,x,y; int main() { cin>>n>>m; for(int i=0;i<m;i++) { cin>>x>>y; x--;y--; v[x].push_back(y); v[y].push_back(x); } for(int i=0;i<n;i++) { memset(vis,0,sizeof(vis)); org=i; dfs(i,i); } cout<<"no"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 123 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 376 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 | 2 ms | 504 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 | 2 ms | 376 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 | 2 ms | 504 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 | 2 ms | 376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |