# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34364 | bnahmad15 | Potemkin cycle (CEOI15_indcyc) | C++14 | 1000 ms | 27428 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;
int n,m,u,v;
bool is[1001][1001] = {false},vis[1001]={false};
vector <int> adj[1001];
vector <int> roads[1001][1001];
vector <int> taken;
void output(vector<int> &to){
for (auto i : to){
printf("%d ",i+1);
}
exit(0);
}
void DFS(int src,int node,int dis){
if (roads[src][node].size() < 3){
roads[src][node].push_back(dis);
}
if (vis[node])
return;
vis[node]=true;
taken.push_back(node);
if (dis >= 3 && is[node][src]){
bool flag = true;
for (int i = 0;i<taken.size();i++){
for (int j = i+2;j<taken.size();j++){
if (i==0&&j==taken.size()-1)
continue;
if (is[taken[i]][taken[j]]){
flag = false;
break;
}
}
if (!flag)
break;
}
if (flag){
output(taken);
}
}
for(auto i : adj[node]){
DFS(src,i,dis+1);
}
taken.pop_back();
vis[node]=false;
}
int main(){
scanf("%d%d",&n,&m);
for (int i = 0; i<m;i++){
scanf("%d%d",&u,&v);
u--,v--;
adj[u].push_back(v);
adj[v].push_back(u);
is[u][v]=is[v][u]=true;
}
for (int i = 0 ; i < n;i++){
memset(vis,false,sizeof vis);
DFS(i,i,0);
}
puts("no");
return 0;
}
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... |