oj.uz

Submission #598954

# Submission time Handle Problem Language Result Execution time Memory
598954 2022-07-19T08:21:11 Z 이동현(#8460) Potemkin cycle (CEOI15_indcyc) C++17
30 / 100
 1000 ms 54488 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

int n, m;
vector<int> way[1004];
int chk[1004], ss, from[1004], did[1004], didN;
int que[1004], f, r;

void bfs(int s, int e){
    f = r = 0;
    que[r++] = s;
    did[s] = didN;
    while(f < r){
        int now = que[f]; ++f;
        for(auto&nxt:way[now]){
            if(nxt != e && (!chk[nxt] || did[nxt] == didN)) continue;
            from[nxt] = now;
            que[r++] = nxt;
            did[nxt] = didN;
        }
    }
    if(did[e] == didN){
        int now = e;
        while(true){
            cout << now << ' ';
            if(now == s) break;
            now = from[now];
        }
        cout << ss << '\n';
        exit(0);
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    map<pair<int, int>, int> cant;
    for(int i = 1; i <= m; ++i){
        int x, y; cin >> x >> y;
        if(x > y) swap(x, y);
        way[x].push_back(y);
        way[y].push_back(x);
        cant[{x, y}] = 1;
        cant[{y, x}] = 1;
    }
    for(int i = 1; i <= n; ++i) chk[i] = 1;
    for(int i = 1; i <= n; ++i){
        chk[i] = 0;
        sort(way[i].begin(), way[i].end());
        for(auto&nxt:way[i]){
            chk[nxt] = 0;
        }
        ss = i;
        for(int j = 0; j < (int)way[i].size(); ++j){
            for(int k = j + 1; k < (int)way[i].size(); ++k){
                if(cant[{way[i][j], way[i][k]}]) continue;
                ++didN;
                bfs(way[i][j], way[i][k]);
            }
        }
        chk[i] = 1;
        for(auto&nxt:way[i]){
            chk[nxt] = 1;
        }
    }
    cout << "no\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Wrong adjacency
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 33716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1064 ms 49944 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 936 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 86 ms 2124 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 54488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 39948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 84 ms 6912 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 518 ms 13368 KB Output is correct
2 Execution timed out 1070 ms 13292 KB Time limit exceeded
3 Halted 0 ms 0 KB -