oj.uz

Submission #718430

# Submission time Handle Problem Language Result Execution time Memory
718430 2023-04-04T04:58:23 Z vjudge1 Game (APIO22_game) C++17
0 / 100
 1 ms 592 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 3e4 + 5;
int n, k;
bitset <N> bs[N];

void init(int N, int K){
  n = N; k = K;
  for(int i = 0; i < k - 1; ++i){
    bs[i].set(i + 1);
  }
}

int add_teleporter(int u, int v){
  bs[u] |= bs[v];
  if (u < k && (bs[u][u] == 1 || u == v)){
    return 1;
  } else return 0;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 0 ms 336 KB Wrong Answer[1]
5 Halted 0 ms 0 KB -