oj.uz

답안 #594295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594295 2022-07-12T10:38:37 Z andrei_boaca Potemkin cycle (CEOI15_indcyc) C++14
90 / 100
 968 ms 2548 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")

using namespace std;
mt19937 rng(time(NULL));
vector<int> muchii[1005];
bool adj[1005][1005];
auto S=chrono::steady_clock::now();
int n,m;
vector<int> v;
int use[1005];
int start=0;
void dfs(int nod)
{
    auto E=chrono::steady_clock::now();
    int x=chrono::duration_cast<chrono::milliseconds>(E - S).count();
    if(v.size()>=25)
        return;
    if(x>=980)
    {
        cout<<"no";
        exit(0);
    }
    use[nod]=v.size();
    bool good=1;
    int pmax=0;
    int pmin=1e9;
    for(int i:muchii[nod])
    {
        if(use[i])
        {
            if(i==v[v.size()-2])
                continue;
            if(i==start)
            {
                if(v.size()>=4);
                else
                    good=0;
            }
            else if(i!=v[v.size()-2])
                good=0;
            pmax=max(pmax,use[i]);
            pmin=min(pmin,use[i]);
        }
    }
    if(v.size()-pmax+1>=4&&pmax!=0)
    {
        for(int i=pmax-1;i<v.size();i++)
            cout<<v[i]<<' ';
        exit(0);
    }
    if(adj[nod][start]&&pmin+1>=4&&pmin!=1e9)
    {
        for(int i=0;i<pmin;i++)
            cout<<v[i]<<' ';
        cout<<nod;
        exit(0);
    }
    if(good)
    {
        for(int i:muchii[nod])
            if(!use[i])
            {
                v.push_back(i);
                dfs(i);
                use[i]=0;
                v.pop_back();
            }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
        adj[a][b]=adj[b][a]=1;
    }
    for(int i=1;i<=n;i++)
        shuffle(muchii[i].begin(),muchii[i].end(),rng);
    vector<int> nodes;
    for(int i=1;i<=n;i++)
        nodes.push_back(i);
    shuffle(nodes.begin(),nodes.end(),rng);
    for(int i:nodes)
    {
        start=i;
        v.clear();
        v.push_back(i);
        for(int j=1;j<=n;j++)
            use[j]=0;
        dfs(i);
    }
    cout<<"no";
    return 0;
}

Compilation message

indcyc.cpp: In function 'void dfs(int)':
indcyc.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int i=pmax-1;i<v.size();i++)
      |                          ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 965 ms 700 KB Output is correct
2 Correct 698 ms 720 KB Output is correct
3 Correct 7 ms 724 KB Output is correct
4 Correct 967 ms 736 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 968 ms 2232 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 516 ms 2476 KB Output is correct
2 Correct 963 ms 2516 KB Output is correct
3 Correct 70 ms 2524 KB Output is correct
4 Correct 965 ms 2548 KB Output is correct