oj.uz

Submission #122979

# Submission time Handle Problem Language Result Execution time Memory
122979 2019-06-29T21:52:59 Z Leonardo_Paes Ronald (COCI17_ronald) C++11
120 / 120
 195 ms 3412 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e3+3;

bool state[maxn], tab[maxn][maxn], ok=1;

int main(){

    int n, m;

    cin >> n >> m;

    for(int i=0; i<m; i++){
        int x, y;
        cin >> x >> y;
        tab[x][y]=tab[y][x]=1;
    }

    for(int i=2; i<=n; i++){
        state[i]=state[i-1];
        if(tab[i][i-1]==0)state[i]^=1;
    }

    for(int i=1; i<=n; i++){
        for(int j=i+1; j<=n; j++){
            int sum = state[i]+state[j];
            if(tab[i][j]==0)if(sum%2==0)ok=0;
            if(tab[i][j]==1)if(sum%2==1)ok=0;
        }
        if(ok==0){
            cout << "NE\n";
            return 0;
        }
    }
    cout << "DA\n";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 3 ms 376 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
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

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 704 KB Output is correct
2 Correct 47 ms 1376 KB Output is correct
3 Correct 18 ms 760 KB Output is correct
4 Correct 12 ms 760 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 632 KB Output is correct
2 Correct 32 ms 1252 KB Output is correct
3 Correct 123 ms 2604 KB Output is correct
4 Correct 195 ms 3412 KB Output is correct