이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define DIM 1010
#define INF 2000000000
using namespace std;
vector <int> L[DIM];
deque <int> c,sol,w;
int dist[DIM],t[DIM],a[DIM][DIM];
int n,m,x,y,i,j,k,ok;
int bfs (int start){
for (int i=1;i<=n;i++){
dist[i] = INF;
t[i] = 0;
}
c.clear(), sol.clear();
c.push_back(start);
dist[start] = 0;
int ok = 0, x;
while (!c.empty()){
int nod = c.front();
c.pop_front();
for (auto vecin : L[nod]){
if (!a[nod][vecin]) /// nu am muchia asta
continue;
if (dist[vecin] == INF){
dist[vecin] = 1 + dist[nod];
t[vecin] = nod;
if (a[vecin][i]){
if (dist[vecin] > 1){
x = vecin;
ok = 1;
break;
}
} else c.push_back(vecin);
}}
if (ok)
break;
}
if (ok){
while (x){
sol.push_back(x);
x = t[x];
}
return 1;
}
return 0;
}
int main (){
//ifstream cin ("date.in");
//ofstream cout ("date.out");
cin>>n>>m;
for (i=1;i<=m;i++){
cin>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
a[x][y] = a[y][x] = 1;
}
for (i=1;i<=n;i++){
w.clear();
for (auto it : L[i])
w.push_back(it);
for (j=0;j<w.size();j++){
x = w[j];
//L[i].erase(x), L[x].erase(i);
a[i][x] = a[x][i] = 0;
if (bfs(x)){ /// am gasit un drum ok
for (auto it : sol)
cout<<it<<" ";
cout<<i;
return 0;
}
//L[i].insert(x), L[x].insert(i);
a[i][x] = a[x][i] = 1;
}
}
cout<<"no";
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
indcyc.cpp: In function 'int main()':
indcyc.cpp:73:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0;j<w.size();j++){
~^~~~~~~~~
# | 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... |