제출 #393151

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393151		dolphingarlic	Potemkin cycle (CEOI15_indcyc)	C++14	20 / 100	376 ms	51236 KiB

indcyc

/*
CEOI 2016 Potemkin Cycle
- Let each edge (u, v) represent a node (uv) in graph H
- There is an edge between (uv) and (vw) in H iff (uw) doesn't exist
    - This means that there are no cycles of length 3 in H
    - We can construct H in O(NR) time
- An answer exists iff a cycle exists in H; run DFS to find a cycle
*/

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int u[200001], v[200001], adj[1001][1001];
vector<int> graph[100001], stck;
int visited[100001];

void dfs(int node, int root, int parent = -1) {
    if (visited[node] == root) {
        while (stck.back() != node) {
            cout << v[stck.back()] << ' ';
            stck.pop_back();
        }
        cout << v[node];
        exit(0);
    }
    if (visited[node]) return;

    stck.push_back(node);
    visited[node] = root;
    for (int i : graph[node]) if (i != parent) dfs(i, root, node);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, r;
    cin >> n >> r;
    for (int i = 1; i <= r; i++) {
        cin >> u[i] >> v[i];
        u[i + r] = v[i], v[i + r] = u[i];
        adj[u[i]][v[i]] = i, adj[v[i]][u[i]] = i + r;
    }

    for (int i = 1; i <= 2 * r; i++) {
        for (int j = 1; j <= n; j++) if (j != u[i]) {
            if (adj[v[i]][j] && !adj[u[i]][j])
                graph[i].push_back(adj[v[i]][j]);
        }
    }

    for (int i = 1; i <= 2 * r; i++) if (!visited[i]) dfs(i, i);
    cout << "no";
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10