Submission #744255

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
744255	2023-05-18T10:00:48 Z	saayan007	Game (APIO22_game)	C++17	2 / 100	6 ms	208 KB

game

#include "bits/stdc++.h"
using namespace std;

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

const int N = 301;
bitset<N> r[N];
int n, k;
void init(int _n, int _k) {
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) r[i][j] = 0;
    }
    n = _n; k = _k;
    for(int i = 0; i < k - 1; ++i) {
        for(int j = i + 1; j < k ; ++j) {
            r[i][j] = 1;
        }
    }
    /* for(int i = 0; i < n; ++i) { */
    /*     for(int j = 0; j < n; ++j) */
    /*         cout << r[i][j]; */
    /*     cout << nl; */
    /* } */
    /* cout << nl; */
}

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

Subtask #1

2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	6 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	6 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 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	Incorrect	1 ms	208 KB	Wrong Answer[1]
13	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	6 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 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	Incorrect	1 ms	208 KB	Wrong Answer[1]
13	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	6 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 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	Incorrect	1 ms	208 KB	Wrong Answer[1]
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	6 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	4 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 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	Incorrect	1 ms	208 KB	Wrong Answer[1]
13	Halted	0 ms	0 KB	-