oj.uz

Submission #37655

# Submission time Handle Problem Language Result Execution time Memory
37655 2017-12-26T16:50:49 Z nickyrio Potemkin cycle (CEOI15_indcyc) C++14
10 / 100
 1000 ms 3444 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define DEBUG(x) { cerr << #x << " = " << x << endl; }
#define Arr(A, l, r) { cerr << #A  << " = "; FOR(_, l, r) cerr << A[_] << ' '; cerr << endl; }
#define N 1111
#define pp pair<int, int>
#define next __next
#define prev __prev
#define __builtin_popcount __builtin_popcountll
#define bit(S, i) (((S) >> i) & 1)
#define IO cin.tie(NULL);cout.tie(NULL);
#define taskname "Test"
using namespace std;
int n, m, p[N];
vector<int> e[N];
queue<int> q;
bitset<N> banned[N], parent[N];
void Try(int s) {
    while (!q.empty()) q.pop();
    FOR(i, 1, n) {
        p[i] = 0;
        banned[i].reset();
        parent[i].reset();
    }
    q.push(s);
    parent[s].set(s);
    p[s] = -1;
    while (!q.empty()) {
        int u = q.front();q.pop();
        for (int v : e[u]) if (v != p[u]) {
            if (p[v] == 0) {
            }
            else {
            //    FOR(i, 1, n) if (banned[v][i]) cerr << i << ' '; cerr << endl;
            //    FOR(i, 1, n) if (parent[u][i]) cerr << i << ' '; cerr << endl;
                if (parent[u].count() + parent[v].count() > 4 && (banned[v] & parent[u]).count() == 0) {
                    vector<int> res;
                    int t = u;
                    while (t != s) {
                        res.push_back(t);
                        t = p[t];
                    }
                    for (int x : res) cout << x << ' ';
                    t = v;
                    while (t != -1) {
                        cout << t << ' ';
                        t = p[t];
                    }
                    exit(0);
                }
                banned[u].set(v);
                banned[v].set(u);
            }
        }
        for (int v : e[u]) if (v != p[u]) {
            if (p[v] == 0) {
                p[v] = u;
                banned[v] = banned[u];
                parent[v] = parent[u];
                parent[v].set(v);
                q.push(v);
            }
        }
    }
}
int main() {
   // freopen(taskname".inp","r",stdin);
   // freopen(taskname".out","w",stdout);
    IO;ios::sync_with_stdio(false);
    cin >> n >> m;
    REP(i, m) {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    FOR(i, 1, n) Try(i);
    cout << "no";
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2520 KB Repeated vertex
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2520 KB Wrong adjacency

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2520 KB Repeated vertex
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2520 KB Wrong answer on graph without induced cycle
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2520 KB Repeated vertex
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 3048 KB Repeated vertex
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2784 KB Repeated vertex
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 3444 KB Execution timed out
2 Halted 0 ms 0 KB -