# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527325 | jamielim | Potemkin cycle (CEOI15_indcyc) | C++14 | 207 ms | 5152 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;
int n,r;
vector<int> adj[1005];
int mat[1005][1005];
int main(){
scanf("%d%d",&n,&r);
int a,b;
for(int i=0;i<r;i++){
scanf("%d%d",&a,&b);a--;b--;
adj[a].pb(b);
adj[b].pb(a);
mat[a][b]=1;mat[b][a]=1;
}
vector<int> ans;
for(int s=0;s<n;s++){
int dist[n];
for(int i=0;i<n;i++)dist[i]=INF;
dist[s]=0;
int par[n];par[s]=-1;
queue<int> q;
q.push(s);
pair<int,int> p;
int d=INF;
while(!q.empty()){
int cur=q.front();q.pop();
for(int i:adj[cur]){
if(dist[i]>dist[cur]+1){
dist[i]=dist[cur]+1;
par[i]=cur;
q.push(i);
}else{
if(i!=par[cur]&&dist[i]+dist[cur]+1<d&&dist[i]+dist[cur]+1>3){
if(dist[i]+dist[cur]+1==4){
if(mat[i][par[cur]]==1||mat[cur][par[i]]==1)continue;
}
d=dist[i]+dist[cur]+1;
p=mp(i,cur);
}
}
}
if(par[s]!=-1)break;
}
if(d>=INF)continue;
vector<int> v;
int cur=p.fi;
while(cur!=-1){
v.pb(cur);
cur=par[cur];
}
reverse(ALL(v));
cur=p.se;
while(cur!=s){
v.pb(cur);
cur=par[cur];
}
//printf("%d %d\n",s,SZ(v));
//for(int i:v)printf("%d ",i+1);
//printf("\n");
if(ans.empty()||SZ(v)<SZ(ans)){
ans.clear();
for(int i:v)ans.pb(i);
}
}
if(ans.empty())printf("no");
else{
for(int i:ans)printf("%d ",i+1);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |