oj.uz

Submission #65509

# Submission time Handle Problem Language Result Execution time Memory
65509 2018-08-07T19:45:12 Z 3zp Potemkin cycle (CEOI15_indcyc) C++14
80 / 100
 1000 ms 7288 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int> c,C, v[1009];
int n, m;
stack<int> S;
int f[1009][1009];
int F[1009], P[1009];
int G[1009];
int a[200009], b[200009];
void dfs(int x){
    F[x] = 1;
    c.push_back(x);
    for(int i = 0; i < v[x].size(); i++)
        if(!F[v[x][i]]) dfs(v[x][i]);
}
void dfs1(int x, int en){
    F[x] = 1;

    S.push(x);
    if(x == en){
        while(S.size())
        {
            C.push_back(S.top());
            S.pop();
        }
        return;
    }
    for(int i = 0; i < v[x].size(); i++)
        if(!F[v[x][i]]) dfs1(v[x][i], en);
    S.pop();
}
void fnd(int x, int y, int z){
   /* for(int i = 0; i <= n; i++)
        F[i] = 1;
    for(int i = 0; i < c.size(); i++)
        F[c[i]] = 0;
    F[x] = 0;
    F[y] = 0;
    F[z] = 0;
    dfs1(y, z);
    for(int i = 0; i < C.size(); i++)
        P[C[i]] = i;
    int X = 0;
    /*while(1){
        int k = C[X], m1 = k, m2 = X;
        cout << k<<" ";

        if(X == C.size() - 1) break;
        for(int i = 0; i < v[k].size(); i++){
            int p = v[k][i];
            if(P[p] > m2){
                m2 = P[p];
                m1 = p;
            }
        }
        X = m2;
    }
    cout << x << endl;*/
}
main(){
    cin >> n >> m;
    for(int i =  1; i <= m; i++){
        scanf("%d%d",&a[i],&b[i]);
        f[a[i]][b[i]] = 1;
        f[b[i]][a[i]] = 1;
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++)
            F[j] = 0, v[j].clear();
        F[i] = 1;
        for(int j = 1; j <= m; j++){
            int x = a[j], y = b[j];
            if(x == i){
                F[y] = 2;
                continue;
            }
            if(y == i){
                F[x] = 2;
                continue;
            }
            if(f[i][x] && f[i][y]) continue;
            v[x].push_back(y);
            v[y].push_back(x);
        }
        for(int j = 1; j <= n; j++){
            if(!F[j]){
                c.clear();
                dfs(j);
                vector<int> g;
                for(int k = 0; k < c.size(); k++){
                    for(int t = 0;  t < v[c[k]].size(); t++){
                        int x = v[c[k]][t];
                        if(G[x] == 0 && F[x] == 2){
                            g.push_back(x);
                            G[x] = 1;
                        }
                    }
                }
                for(int i = 0; i < g.size(); i++)
                    G[g[i]] = 0;
                for(int i1 = 0; i1 < g.size(); i1++){
                    for(int j = i1 + 1; j < g.size(); j++){
                        if(f[g[i1]][g[j]]) continue;
                        fnd(i, g[i1], g[j]);
                        return 0;
                    }
                }
            }

        }
    }
    cout<<"no"<<endl;
}

Compilation message

indcyc.cpp:44:5: warning: "/*" within comment [-Wcomment]
     /*while(1){
      
indcyc.cpp: In function 'void dfs(int)':
indcyc.cpp:13:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[x].size(); i++)
                    ~~^~~~~~~~~~~~~
indcyc.cpp: In function 'void dfs1(int, int)':
indcyc.cpp:28:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[x].size(); i++)
                    ~~^~~~~~~~~~~~~
indcyc.cpp: At global scope:
indcyc.cpp:60:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
indcyc.cpp: In function 'int main()':
indcyc.cpp:90:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int k = 0; k < c.size(); k++){
                                ~~^~~~~~~~~~
indcyc.cpp:91:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for(int t = 0;  t < v[c[k]].size(); t++){
                                     ~~^~~~~~~~~~~~~~~~
indcyc.cpp:99:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i = 0; i < g.size(); i++)
                                ~~^~~~~~~~~~
indcyc.cpp:101:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i1 = 0; i1 < g.size(); i1++){
                                 ~~~^~~~~~~~~~
indcyc.cpp:102:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for(int j = i1 + 1; j < g.size(); j++){
                                         ~~^~~~~~~~~~
indcyc.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a[i],&b[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

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 392 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 2 ms 492 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Too short sequence
2 Correct 2 ms 520 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1864 KB Output is correct
2 Correct 5 ms 1864 KB Too short sequence
3 Correct 6 ms 1912 KB Too short sequence
4 Correct 31 ms 2100 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2100 KB Too short sequence
2 Correct 23 ms 2100 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 5700 KB Too short sequence
2 Correct 17 ms 5700 KB Too short sequence
3 Execution timed out 1072 ms 6236 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 6236 KB Too short sequence
2 Correct 560 ms 6236 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 6236 KB Too short sequence
2 Correct 130 ms 6236 KB Output is correct
3 Correct 53 ms 6800 KB Too short sequence
4 Execution timed out 1067 ms 7288 KB Time limit exceeded