# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
171110 | Ruxandra985 | Potemkin cycle (CEOI15_indcyc) | C++14 | 1038 ms | 2808 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define DIMN 1010
using namespace std;
vector <int> v[DIMN];
int tt[DIMN] , f[DIMN] , sol[DIMN];
pair <int,int> mch[100010];
int elem , found , n , m;
deque <int> dq;
void ignoree (int x){
int i , nod , vecin;
/// cel mai scurt drum de la mch[i].first la mch[i].second
memset (f , 0 , sizeof(f));
memset (tt , 0 , sizeof(tt));
dq.push_back(mch[x].first);
f[mch[x].first] = 1;
while (!dq.empty()){
nod = dq.front();
dq.pop_front();
if (nod == mch[x].second){
if (f[mch[x].second] > 3)
found = 1;
break;
}
for (i=0;i<v[nod].size();i++){
vecin = v[nod][i];
if (nod == mch[x].first && vecin == mch[x].second)
continue;
if (!f[vecin]){
f[vecin] = 1 + f[nod];
tt[vecin] = nod;
dq.push_back(vecin);
}
}
}
if (found){
nod = mch[x].second;
while (nod){
sol[++elem] = nod;
nod = tt[nod];
}
}
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int i;
fscanf (fin,"%d%d",&n,&m);
for (i=1;i<=m;i++){
fscanf (fin,"%d%d",&mch[i].first,&mch[i].second);
v[mch[i].first].push_back(mch[i].second);
v[mch[i].second].push_back(mch[i].first);
}
for (i=1;i<=m;i++){
/// daca ignoram muchia i
ignoree (i);
if (found)
break;
}
if (!found)
fprintf (fout,"no");
else {
for (i=1;i<=elem;i++)
fprintf (fout,"%d ",sol[i]);
}
return 0;
}
컴파일 시 표준 에러 (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... |