oj.uz

Submission #315495

# Submission time Handle Problem Language Result Execution time Memory
315495 2020-10-23T01:29:11 Z qpwoeirut Game (IOI14_game) C++17
0 / 100
 0 ms 384 KB 
#include "game.h"

const int MN = 1501;

int N;
int mat[MN][MN];
int ct[MN];
void initialize(int n) {
    N = n;
    for (int i=0; i<N; ++i) {
        for (int j=0; j<N; ++j) {
            mat[i][j] = -1;
        }
        ct[i] = 0;
        mat[i][i] = 1;
    }
}

int hasEdge(int u, int v) {
    if (mat[u][v] != -1) return mat[u][v];
    ++ct[u];
    ++ct[v];

    mat[u][v] = (ct[u] == N-1) || (ct[v] == N-1);
    mat[v][u] = mat[u][v];
    return mat[u][v];
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -