oj.uz

Submission #152668

# Submission time Handle Problem Language Result Execution time Memory
152668 2019-09-09T06:17:59 Z toloraia Potemkin cycle (CEOI15_indcyc) C++17
50 / 100
 1000 ms 5640 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define y1 y122

/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/STACK: 20000000005")
*/

using namespace std;

const int N = 1005, M = 100005;

int n, m;

int u[M], v[M];

int G[N][N];

vector < int > g[N];

int par[N], fix[N];

queue < int > Q;

main()
{
    //freopen ("in.in", "r", stdin);freopen ("out.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        cin >> u[i] >> v[i];
        G[u[i]][v[i]] = 1;
        G[v[i]][u[i]] = 1;
        g[u[i]].pb (v[i]);
        g[v[i]].pb (u[i]);
    }
    for (int I = 1; I <= n; I++){
        for (int i = 1; i <= n; i++){
            par[i] = 0;
            fix[i] = 0;
        }
        for (int i = 1; i <= m; i++){
            if (G[I][u[i]] + G[I][v[i]] == 2){
                G[u[i]][v[i]] = 0;
                G[v[i]][u[i]] = 0;
            }
        }
        for (int i = 1; i <= n; i++){
            if (fix[i] > 0 || I == i || G[I][i] == 0)
                continue;
            fix[i] = i;
            Q.push (i);
            while (Q.size() > 0){
                int k = Q.front();
                Q.pop();
                for (int to : g[k]){
                    if (fix[to] > 0 || to == I || G[k][to] == 0)
                        continue;
                    fix[to] = fix[k];
                    par[to] = k;
                    Q.push (to);
                }
            }
        }
        for (int i = 1; i <= n; i++){
            if (fix[i] > 0 || I == i)
                continue;
            fix[i] = i;
            Q.push (i);
            while (Q.size() > 0){
                int k = Q.front();
                Q.pop();
                for (int to : g[k]){
                    if (fix[to] > 0 || to == I || G[k][to] == 0)
                        continue;
                    fix[to] = fix[k];
                    par[to] = k;
                    Q.push (to);
                }
            }
        }
        for (int i = 1; i <= m; i++){
            G[u[i]][v[i]] = 1;
            G[v[i]][u[i]] = 1;
        }
        for (int k : g[I]){
            int p = fix[k];
            if (p == k)
                continue;
            if (G[I][p] == 0 || G[k][p] == 1)
                continue;
            cout << I << " ";
            int x = k, y = k;
            while (x){
                if (G[I][x])
                    y = x;
                x = par[x];
            }
            while (y){
                cout << y << " ";
                y = par[y];
            }
            return 0;
        }
    }
    cout << "no" << endl;
    return 0;
}

Compilation message

indcyc.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Too short sequence
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Too short sequence

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Too short sequence
2 Correct 3 ms 504 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Too short sequence

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Too short sequence
2 Incorrect 3 ms 888 KB Wrong answer on graph without induced cycle

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Too short sequence
3 Correct 5 ms 1656 KB Too short sequence
4 Incorrect 6 ms 1656 KB Wrong answer on graph without induced cycle

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1656 KB Too short sequence
2 Incorrect 5 ms 1656 KB Wrong answer on graph without induced cycle

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5212 KB Too short sequence
2 Correct 16 ms 4856 KB Too short sequence
3 Correct 806 ms 5640 KB Output is correct
4 Correct 313 ms 4856 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4856 KB Too short sequence
2 Incorrect 13 ms 4856 KB Wrong answer on graph without induced cycle

Subtask #10
0 / 10.0

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