oj.uz

Submission #563893

# Submission time Handle Problem Language Result Execution time Memory
563893 2022-05-18T08:58:56 Z piOOE Potemkin cycle (CEOI15_indcyc) C++17
60 / 100
 1000 ms 2096 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)
#define sz(x) ((int)size(x))
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

const int N = 1000;

bool e[N][N];

int used[N];
vector<int> st;
int n;
vector<int> g[N];

void dfs(int v, int p, int d) {
    st.push_back(v);
    used[v] = d;
    int gg = -1;
    for (int to : st) {
        if (to != p && to != v && e[v][to] && used[to]) {
            if (gg == -1 || used[to] > used[gg]) {
                gg = to;
            }
        }
    }
    if (gg != -1) {
        cout << gg + 1 << " ";
        while (st.back() != gg) {
            cout << st.back() + 1 << " ";
            st.pop_back();
        }
        exit(0);
    }
    for (int to : g[v]) {
        if (to != p && !e[p][to]) {
            dfs(to, v, d + 1);
        }
    }
    st.pop_back();
    used[v] = false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int r;
    cin >> n >> r;
    for (int i = 0; i < r; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        e[a][b] = e[b][a] = true;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (int v = 0; v < n; ++v) {
        used[v] = true;
        st.push_back(v);
        for (int to : g[v]) {
            if (e[v][to]) {
                dfs(to, v, 2);
            }
        }
        st.pop_back();
        used[v] = false;
    }
    cout << "no";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 11 ms 468 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 624 ms 668 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1492 KB Output is correct
2 Execution timed out 1090 ms 1484 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1780 KB Output is correct
2 Correct 82 ms 1776 KB Output is correct
3 Correct 9 ms 1956 KB Output is correct
4 Execution timed out 1087 ms 2096 KB Time limit exceeded
5 Halted 0 ms 0 KB -