oj.uz

Submission #1029990

# Submission time Handle Problem Language Result Execution time Memory
1029990 2024-07-21T15:30:02 Z codexistent Game (IOI14_game) C++14
0 / 100
 1 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1505
#define FOR(i, a, b) for(int i = a; i <= b; i++)

int N, ec[MAXN], r = 0, e = 0;

void initialize(int n){
    N = n;
    FOR(i, 1, N) ec[i] = 0;

    n = N - 1;
    r = N * (N - 1) / 2 + 1;
}

int hasEdge(int u, int v){
    r--;
    ec[u]++, ec[v]++;

    if(ec[u] == N - 1 || ec[v] == N - 1) {
        e--;
        return 1;
    }
    if(e == r){
        e--;
        return 1;
    }
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 1 ms 344 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -