oj.uz

Submission #605465

# Submission time Handle Problem Language Result Execution time Memory
605465 2022-07-25T18:06:25 Z AugustinasJucas Game (APIO22_game) C++17
0 / 100
 0 ms 288 KB 
#include "game.h"
const int dydis = 5001;
bool can[dydis][dydis] = {};
int n, k;
void init(int N, int K) {
    n = N; k = K;
    for(int i = 0; i < k-1; i++) {
        for(int j = i; j < k; j++) {
            can[i][j] = true;
        }
    }
}

int add_teleporter(int u, int v) {
    for(int i = 0; i < n; i++) {
        if(can[i][u]) can[i][v] = 1;
    }
    if(v < k) {
        if(can[v][u]) return 1;
    }
    return 0;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -