답안 #739135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739135	2023-05-10T03:13:05 Z	PixelCat	게임 (APIO22_game)	C++17	30 / 100	62 ms	488 KB

game

#include "game.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 1010;

int n, k;
vector<int> adj[MAXN];
int vis[MAXN];

void init(int _n, int _k) {
    n = _n; k = _k;
    For(i, 0, n - 1) adj[i].clear();
    For(i, 0, k - 2) adj[i].eb(i + 1);
}

int dfs(int x) {
    if(vis[x] != -1) return vis[x];
    vis[x] = -2;
    for(auto &i:adj[x]) {
        if(i < k && vis[i] == -2) return vis[x] = 1;
        if(vis[i] == -2) continue;
        if(dfs(i)) return vis[x] = 1;
    }
    return vis[x] = 0;
}

int add_teleporter(int u, int v) {
    memset(vis, -1, sizeof(vis));
    adj[u].eb(v);
    return dfs(0);
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 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	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 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	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct

Subtask #3

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 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	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 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	1 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	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	2 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	9 ms	388 KB	Output is correct
25	Correct	40 ms	488 KB	Output is correct
26	Correct	53 ms	360 KB	Output is correct
27	Correct	62 ms	376 KB	Output is correct
28	Correct	18 ms	372 KB	Output is correct
29	Correct	40 ms	376 KB	Output is correct

Subtask #4

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 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	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 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	1 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	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	2 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	9 ms	388 KB	Output is correct
25	Correct	40 ms	488 KB	Output is correct
26	Correct	53 ms	360 KB	Output is correct
27	Correct	62 ms	376 KB	Output is correct
28	Correct	18 ms	372 KB	Output is correct
29	Correct	40 ms	376 KB	Output is correct
30	Runtime error	1 ms	452 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 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	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	0 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	1 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	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	2 ms	336 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	9 ms	388 KB	Output is correct
25	Correct	40 ms	488 KB	Output is correct
26	Correct	53 ms	360 KB	Output is correct
27	Correct	62 ms	376 KB	Output is correct
28	Correct	18 ms	372 KB	Output is correct
29	Correct	40 ms	376 KB	Output is correct
30	Runtime error	1 ms	452 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-