oj.uz

Submission #1004713

# Submission time Handle Problem Language Result Execution time Memory
1004713 2024-06-21T13:08:30 Z Valaki2 Potemkin cycle (CEOI15_indcyc) C++14
30 / 100
 30 ms 2604 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int maxn = 1000;

int n, m;
vector<int> graph[1 + maxn];
bool matrix[1 + maxn][1 + maxn];
bool neigh[1 + maxn];
int cur_mid;
int dist[1 + maxn];
int prv[1 + maxn];

void bfs(int start) {
    queue<int> q;
    queue<int> all;
    q.push(start);
    all.push(start);
    prv[start] = -1;
    while(!q.empty()) {
        int cur = q.front();
        q.pop();
        for(int nei : graph[cur]) {
            if(prv[nei] == 0 && (!neigh[cur] || !neigh[nei])) {
                q.push(nei);
                all.push(nei);
                dist[nei] = dist[cur] + 1;
                prv[nei] = cur;
                if(neigh[nei] && !matrix[start][nei]) {
                    while(nei != start) {
                        cout << nei << " ";
                        nei = prv[nei];
                    }
                    cout << start << " " << cur_mid << "\n";
                    exit(0);
                }
            }
        }
    }
    while(!all.empty()) {
        dist[all.front()] = prv[all.front()] = 0;
        all.pop();
    }
}

void try_for(int cur) {
    cur_mid = cur;
    if(graph[cur].empty()) {
        return;
    }
    for(int nei : graph[cur]) {
        neigh[nei] = true;
    }
    neigh[cur] = true;
    for(int start : graph[cur]) {
        bfs(start);
    }
    for(int nei : graph[cur]) {
        neigh[nei] = false;
    }
    neigh[cur] = false;
}

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
        matrix[a][b] = matrix[b][a] = true;
    }
    for(int i = 1; i <= n; i++) {
        try_for(i);
    }
    cout << "no\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong answer on graph without induced cycle
3 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Incorrect 1 ms 860 KB Wrong adjacency
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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