Submission #718435

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
718435	2023-04-04T05:14:54 Z	vjudge1	Game (APIO22_game)	C++17	2 / 100	1 ms	336 KB

game

#include "game.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1000 + 5;
int n, k;
bool f[N][N];

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

int add_teleporter(int u, int v){
  f[u][v] = true;
  if (u >= v && u < k) return 1;

  for(int i = 0; i < n; ++i){
    if (!f[i][u]) continue;
    //i -> u

    for(int j = 0; j < n; ++j){
      if (!f[v][j]) continue;
      //v -> j
      //i -> u -> v -> j;

      f[i][j] = true;
      if (i >= j && i < k) return 1;
    }
  }
  return 0;
}

Subtask #1

2.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	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct

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	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Incorrect	0 ms	336 KB	Wrong Answer[1]
12	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	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Incorrect	0 ms	336 KB	Wrong Answer[1]
12	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	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Incorrect	0 ms	336 KB	Wrong Answer[1]
12	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	336 KB	Output is correct
4	Correct	0 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Incorrect	0 ms	336 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-