Submission #29789

# Submission time Handle Problem Language Result Execution time Memory
29789 2017-07-20T16:35:13 Z TAMREF Ronald (COCI17_ronald) C++11
120 / 120
63 ms 3020 KB
#include <bits/stdc++.h>
using namespace std;
const int mx=1005;
bool G[mx][mx];
int rep[mx<<1], sz[mx<<1], V, E;
inline int f(int x){return x==rep[x]?x:rep[x]=f(rep[x]);}
void c(int x,int y){
    x=f(x), y=f(y);
    if(sz[x]<sz[y]) swap(x,y);
    sz[x]+=sz[y];
    rep[y]=x;
}
void input(){
    scanf("%d%d",&V,&E);
    for(int i=0,a,b;i<E;i++){
        scanf("%d%d",&a,&b);
        G[a][b]=G[b][a]=true;
    }
    for(int i=1;i<=(V<<1);i++) rep[i]=i, sz[i]=1;
}
void unite(){
    for(int i=1;i<=V;i++){
        for(int j=1;j<i;j++){
            if(G[i][j]){
                c(i,j);
                c(V+i,V+j);
            }else{
                c(i,V+j);
                c(V+i,j);
            }
        }
    }
}
bool det(){
    for(int i=1;i<=V;i++) if(f(i)==f(V+i)) return false;
    return true;
}
int main(){
    input();
    unite();
    puts(det()?"DA":"NE");
}

Compilation message

ronald.cpp: In function 'void input()':
ronald.cpp:14:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&V,&E);
                        ^
ronald.cpp:16:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
                            ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 0 ms 3020 KB Output is correct
3 Correct 0 ms 3020 KB Output is correct
4 Correct 0 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 3020 KB Output is correct
2 Correct 16 ms 3020 KB Output is correct
3 Correct 6 ms 3020 KB Output is correct
4 Correct 3 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3020 KB Output is correct
2 Correct 13 ms 3020 KB Output is correct
3 Correct 49 ms 3020 KB Output is correct
4 Correct 63 ms 3020 KB Output is correct