# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29804 | Diuven | Ronald (COCI17_ronald) | C++11 | 56 ms | 3020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
int n, i, m, D[1010], a, b;
bool G[1010][1010], flag=true;
void toggle(int v){
for(int k=1; k<=n; k++){
if(k==v) continue;
if(G[v][k])
G[v][k]=G[k][v]=false, D[v]--, D[k]--;
else
G[v][k]=G[k][v]=true, D[v]++, D[k]++;
}
}
int main(){
scanf("%d%d", &n, &m);
for(; m--; ){
scanf("%d%d", &a, &b);
G[a][b]=G[b][a]=true;
D[a]++, D[b]++;
}
for(i=2; i<=n; i++)
if(!G[1][i]) toggle(i);
for(i=1; i<=n; i++)
flag&=(D[i]==n-1);
puts(flag?"DA":"NE");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |