답안 #744295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744295	2023-05-18T10:49:43 Z	saayan007	게임 (APIO22_game)	C++17	30 / 100	4000 ms	82648 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 = 30001;
int n, k;
/* vector<vector<bool>> reach; */
bitset<N> reach[N];
void init(int _n, int _k) {
    n = _n; k = _k;
    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) {
    if(reach[u][v]) return 0;
    reach[u][v] = 1;
    reach[u] |= reach[v];
    for(int i = 0; i < n; ++i) {
        if(!reach[i][u]) continue;
        reach[i] |= reach[u];
    }

    for(int i = 0; i < k; ++i) if(reach[i][i]) return 1;
    return 0;
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	592 KB	Output is correct
7	Correct	1 ms	592 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	592 KB	Output is correct
7	Correct	1 ms	592 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	Correct	1 ms	644 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	3 ms	672 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct

Subtask #3

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	592 KB	Output is correct
7	Correct	1 ms	592 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	Correct	1 ms	644 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	3 ms	672 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct
20	Correct	5 ms	3272 KB	Output is correct
21	Correct	2 ms	1488 KB	Output is correct
22	Correct	9 ms	3944 KB	Output is correct
23	Correct	5 ms	3920 KB	Output is correct
24	Correct	51 ms	3920 KB	Output is correct
25	Correct	83 ms	3836 KB	Output is correct
26	Correct	102 ms	4044 KB	Output is correct
27	Correct	144 ms	3840 KB	Output is correct
28	Correct	27 ms	3784 KB	Output is correct
29	Correct	60 ms	3824 KB	Output is correct

Subtask #4

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	592 KB	Output is correct
7	Correct	1 ms	592 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	Correct	1 ms	644 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	3 ms	672 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct
20	Correct	5 ms	3272 KB	Output is correct
21	Correct	2 ms	1488 KB	Output is correct
22	Correct	9 ms	3944 KB	Output is correct
23	Correct	5 ms	3920 KB	Output is correct
24	Correct	51 ms	3920 KB	Output is correct
25	Correct	83 ms	3836 KB	Output is correct
26	Correct	102 ms	4044 KB	Output is correct
27	Correct	144 ms	3840 KB	Output is correct
28	Correct	27 ms	3784 KB	Output is correct
29	Correct	60 ms	3824 KB	Output is correct
30	Execution timed out	4041 ms	82648 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	Correct	0 ms	464 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	592 KB	Output is correct
7	Correct	1 ms	592 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	Correct	1 ms	644 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	2 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	3 ms	672 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct
20	Correct	5 ms	3272 KB	Output is correct
21	Correct	2 ms	1488 KB	Output is correct
22	Correct	9 ms	3944 KB	Output is correct
23	Correct	5 ms	3920 KB	Output is correct
24	Correct	51 ms	3920 KB	Output is correct
25	Correct	83 ms	3836 KB	Output is correct
26	Correct	102 ms	4044 KB	Output is correct
27	Correct	144 ms	3840 KB	Output is correct
28	Correct	27 ms	3784 KB	Output is correct
29	Correct	60 ms	3824 KB	Output is correct
30	Execution timed out	4041 ms	82648 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-