oj.uz

답안 #172951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172951 2020-01-02T19:16:20 Z phillip Potemkin cycle (CEOI15_indcyc) C++14
50 / 100
 123 ms 504 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int vis[109],org;
vector<int>cc,v[109];
void out()
{
    for(int i=0;i<cc.size();i++)cout<<cc[i]+1<<" ";
    exit(0);
}
void dfs(int x,int par)
{
    //cout<<x<<" "<<par<<"\n";
    cc.push_back(x);
    for(int i=0;i<v[x].size();i++)
    {
        if(v[x][i]==par)continue;
        if(vis[v[x][i]])
        {
            if(v[x][i]==org&&cc.size()>=4)continue;
            cc.pop_back();
            return;
        }
    }
    for(int i=0;i<v[x].size();i++)
    {
        if(v[x][i]==par)continue;
        if(v[x][i]==org&&cc.size()>=4)out();
    }
    vis[x]=1;
    for(int i=0;i<v[x].size();i++)
    {
        int y=v[x][i];
        if(y==par)continue;
        dfs(y,x);
    }
    cc.pop_back();
    vis[x]=0;
}
int n,m,x,y;
int main()
{
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>x>>y;
        x--;y--;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=0;i<n;i++)
    {
        memset(vis,0,sizeof(vis));
        org=i;
        dfs(i,i);
    }
    cout<<"no";
}

Compilation message

indcyc.cpp: In function 'void out()':
indcyc.cpp:8:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<cc.size();i++)cout<<cc[i]+1<<" ";
                 ~^~~~~~~~~~
indcyc.cpp: In function 'void dfs(int, int)':
indcyc.cpp:15:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
indcyc.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
indcyc.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 123 ms 376 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -