Submission #744271

# Submission time Handle Problem Language Result Execution time Memory
744271 2023-05-18T10:16:40 Z saayan007 Game (APIO22_game) C++17
30 / 100
4000 ms 111816 KB
#include "bits/stdc++.h"
using namespace std;

#define fr first
#define sc second
const char nl = '\n';
#include "game.h"

const int N = 301;
int n, k;
vector<vector<bool>> reach;
void init(int _n, int _k) {
    n = _n; k = _k;
    reach = vector<vector<bool>>(n, vector<bool>(n, 0));
    for(int i = 0; i < k - 1; ++i) {
        for(int j = i + 1; j < k; ++j) {
            reach[i][j] = 1;
        }
    }
}

int add_teleporter(int u, int v) {
    reach[u][v] = 1;
    for(int i = 0; i < n; ++i) if(reach[v][i]) reach[u][i] = 1;
    for(int i = 0; i < n; ++i) {
        if(!reach[i][u]) continue;
        for(int j = 0; j < n; ++j) {
            if(reach[u][j]) reach[i][j] = 1;
        }
    }

    for(int i = 0; i < k; ++i) if(reach[i][i]) return 1;
    return 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 4 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
# 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 4 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
# 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 4 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 8 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 15 ms 464 KB Output is correct
23 Correct 10 ms 464 KB Output is correct
24 Correct 234 ms 464 KB Output is correct
25 Correct 1252 ms 464 KB Output is correct
26 Correct 1059 ms 464 KB Output is correct
27 Correct 1563 ms 464 KB Output is correct
28 Correct 392 ms 464 KB Output is correct
29 Correct 918 ms 464 KB Output is correct
# 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 4 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 8 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 15 ms 464 KB Output is correct
23 Correct 10 ms 464 KB Output is correct
24 Correct 234 ms 464 KB Output is correct
25 Correct 1252 ms 464 KB Output is correct
26 Correct 1059 ms 464 KB Output is correct
27 Correct 1563 ms 464 KB Output is correct
28 Correct 392 ms 464 KB Output is correct
29 Correct 918 ms 464 KB Output is correct
30 Execution timed out 4064 ms 111816 KB Time limit exceeded
31 Halted 0 ms 0 KB -
# 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 4 ms 256 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 2 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 8 ms 464 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 15 ms 464 KB Output is correct
23 Correct 10 ms 464 KB Output is correct
24 Correct 234 ms 464 KB Output is correct
25 Correct 1252 ms 464 KB Output is correct
26 Correct 1059 ms 464 KB Output is correct
27 Correct 1563 ms 464 KB Output is correct
28 Correct 392 ms 464 KB Output is correct
29 Correct 918 ms 464 KB Output is correct
30 Execution timed out 4064 ms 111816 KB Time limit exceeded
31 Halted 0 ms 0 KB -