oj.uz

Submission #246714

# Submission time Handle Problem Language Result Execution time Memory
246714 2020-07-10T01:27:30 Z dantoh000 Potemkin cycle (CEOI15_indcyc) C++14
60 / 100
 534 ms 9336 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
int id[1005][1005];
int A[1005];
int B[1005];
int vis[100005];
vector<int> ans;
int cycle;
bool dfs(int a, int b){
    vis[id[a][b]] = 2;
    for (int c = 1; c <= n; c++){
        if (c != a && id[b][c] && !id[a][c]){
            if (vis[id[b][c]] == 2){
                cycle = b;
                ans.push_back(b);
                ans.push_back(a);
                return true;
            }
            else if (dfs(b,c)){
                ans.push_back(a);
                if (a == cycle){
                    int s = 0, e = (int)ans.size()-1;
                    for (int x = 0; x < (int)ans.size(); x++){
                        for (int y = x+2; y < (int)ans.size(); y++){
                            if (id[ans[x]][ans[y]] && e-s > y-x){ ///xxx illegal operation
                                //printf("%d -> %d illegal \n",ans[x],ans[y]);
                                /// just take from x to y instead, shorter cycle and guaranteed to be >3 from initial checks
                                s = x, e = y;
                            }
                        }
                    }
                    for (int i = s; i <= e; i++) printf("%d ",ans[i]);
                    exit(0);
                }
                return true;
            }

        }
    }
    vis[id[a][b]] = 1;
    return false;
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i = 1; i <= m; i++){
        scanf("%d%d",&A[i],&B[i]);
        id[B[i]][A[i]] = id[A[i]][B[i]] = i;
    }
    for (int i = 1; i <= m; i++){
        if (vis[i] == 0) {
            dfs(A[i],B[i]);
            ans.clear();
        }
    }

    printf("no");
}

Compilation message

indcyc.cpp: In function 'int main()':
indcyc.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
indcyc.cpp:47: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 6 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 6 ms 768 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 2944 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1536 KB Output is correct
2 Correct 17 ms 1536 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 534 ms 9336 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 136 ms 8864 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 5496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -