# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154996 | 2019-09-25T20:34:07 Z | TadijaSebez | Potemkin cycle (CEOI15_indcyc) | C++11 | 167 ms | 3184 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back const int N=1005; const int inf=1e9+7; vector<int> E[N]; int n,m,par[N]; bool has[N][N]; int dist[N],ban[N]; void Solve(int u, int v) { queue<int> q; for(int i=1;i<=n;i++) dist[i]=inf,ban[i]=0; for(int i=1;i<=n;i++) if(has[u][i] && has[v][i]) ban[i]=1; dist[u]=par[u]=0; for(int i=1;i<=n;i++) if(has[u][i] && !ban[i] && i!=v) dist[i]=1,par[i]=u,q.push(i); while(q.size()) { int x=q.front(); q.pop(); for(int y:E[x]) if(dist[y]>dist[x]+1 && !ban[y]) { dist[y]=dist[x]+1; par[y]=x; q.push(y); } } if(dist[v]!=inf) { for(int i=v;i;i=par[i]) printf("%i ",i); exit(0); } } vector<pair<int,int>> edges; int main() { scanf("%i %i",&n,&m); for(int u,v;m--;) scanf("%i %i",&u,&v),E[u].pb(v),E[v].pb(u),has[u][v]=has[v][u]=1,edges.pb({u,v}); mt19937 rng(time(0)); shuffle(edges.begin(),edges.end(),rng); for(int i=0;i<edges.size() && i<=1000;i++) Solve(edges[i].first,edges[i].second); printf("no\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 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 | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 11 ms | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 760 KB | Output is correct |
2 | Correct | 4 ms | 888 KB | Output is correct |
3 | Correct | 7 ms | 760 KB | Output is correct |
4 | Correct | 17 ms | 804 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 760 KB | Output is correct |
2 | Correct | 30 ms | 760 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 2676 KB | Output is correct |
2 | Correct | 11 ms | 2068 KB | Output is correct |
3 | Correct | 103 ms | 2672 KB | Output is correct |
4 | Correct | 58 ms | 2040 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 167 ms | 2040 KB | Expected integer, but "no" found |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 34 ms | 3184 KB | Expected integer, but "no" found |
2 | Halted | 0 ms | 0 KB | - |