Submission #564098

# Submission time Handle Problem Language Result Execution time Memory
564098 2022-05-18T14:41:45 Z piOOE Potemkin cycle (CEOI15_indcyc) C++17
10 / 100
283 ms 184008 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, M = 100000;


int A[M], B[M];

bool e[N][N];
vector<pair<int, int>> adj[N];
vector<pair<int, int>> g[2][M];

vector<pair<int, int>> st, sus;

bool used[2][M];

void dfs(int t, int v, pair<int, int> p) {
    used[t][v] = true;
    st.emplace_back(t, v);
    for (auto to: g[t][v]) {
        if (to != p) {
            if (!used[to.first][to.second]) {
                dfs(to.first, to.second, {t, v});
            } else {
                sus.push_back(to);
                while (st.back() != to) {
                    sus.push_back(st.back());
                    st.pop_back();
                }
                for (auto i : sus) {
                    cout << (i.first ? B[i.second] : A[i.second]) + 1 << " ";
                }
                exit(0);
            }
        }
    }
    st.pop_back();
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, r;
    cin >> n >> r;
    for (int i = 0; i < r; ++i) {
        cin >> A[i] >> B[i];
        --A[i], --B[i];
        adj[A[i]].emplace_back(B[i], i);
        adj[B[i]].emplace_back(A[i], i);
        e[A[i]][B[i]] = e[B[i]][A[i]] = true;
    }
    for (int v = 0; v < n; ++v) {
        for (auto [a, i]: adj[v]) {
            for (auto [b, j]: adj[v]) {
                if (i != j && !e[a][b]) {
                    int t1 = (B[i] == a);
                    int t2 = (B[j] == v);
                    g[t1][i].emplace_back(t2, j);
                    g[t2][j].emplace_back(t1, i);
                }
            }
        }
    }
    for (int v = 0; v < r; ++v) {
        if (!used[0][v]) {
            dfs(0, v, {-1, -1});
        }
        if (!used[1][v]) {
            dfs(1, v, {-1, -1});
        }
    }
    cout << "no";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5048 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 5076 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 5076 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5204 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 5972 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 6228 KB Wrong answer on graph without induced cycle
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 11344 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 175 ms 64288 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 283 ms 184008 KB Repeated vertex
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 10228 KB Repeated vertex
2 Halted 0 ms 0 KB -