Submission #975707

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
975707	2024-05-05T18:49:00 Z	ShaShi	Game (APIO22_game)	C++17	30 / 100	4000 ms	55416 KB

game

#include "game.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define pii pair<int, int>



using namespace std;

typedef long long ll;


const int MAXN = (int)1e6 + 7;
const int LG = 60;


int dp[MAXN], pd[MAXN];
vector<int> adj[MAXN][2];
bool seen[MAXN];
int N, K, X;


bool check(int x) {
	if (dp[x] <= pd[x]) return 1;
	return 0;
}


void init(int n, int k) {
	N = n;
	K = k;

	for (int i=0; i<N; i++) dp[i] = pd[i] = -1;
}


void DFS(int v, bool b) {
	seen[v] = 1;

	if (b) dp[v] = (dp[v] == -1? X : min(dp[v], X));
	else pd[v] = (pd[v] == -1? X : max(pd[v], X));

	for (int u:adj[v][b]) if (!seen[u]) DFS(u, b);
}


int add_teleporter(int u, int v) {
	if (u < K && v < K) {
		if (u >= v) return 1;
		return 0;
	}

	adj[u][0].pb(v); adj[v][1].pb(u);

	fill(seen, seen+N+1, 0);

	if (u < K) {
		X = u;
		DFS(u, 0);
	} else if (v < K) {
		X = v;
		DFS(v, 1);
	} else {
		X = pd[u];
		DFS(u, 0);
	}

	for (int i=K; i<N; i++) if (dp[i] != -1 && pd[i] != -1 && dp[i] <= pd[i]) return 1;


	return 0;
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	51544 KB	Output is correct
2	Correct	11 ms	51544 KB	Output is correct
3	Correct	14 ms	51544 KB	Output is correct
4	Correct	12 ms	51544 KB	Output is correct
5	Correct	11 ms	51544 KB	Output is correct
6	Correct	11 ms	51544 KB	Output is correct
7	Correct	11 ms	51800 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	51544 KB	Output is correct
2	Correct	11 ms	51544 KB	Output is correct
3	Correct	14 ms	51544 KB	Output is correct
4	Correct	12 ms	51544 KB	Output is correct
5	Correct	11 ms	51544 KB	Output is correct
6	Correct	11 ms	51544 KB	Output is correct
7	Correct	11 ms	51800 KB	Output is correct
8	Correct	11 ms	51544 KB	Output is correct
9	Correct	11 ms	51544 KB	Output is correct
10	Correct	11 ms	51544 KB	Output is correct
11	Correct	11 ms	51552 KB	Output is correct
12	Correct	11 ms	51544 KB	Output is correct
13	Correct	17 ms	51544 KB	Output is correct
14	Correct	11 ms	51708 KB	Output is correct
15	Correct	11 ms	51544 KB	Output is correct
16	Correct	11 ms	51544 KB	Output is correct
17	Correct	12 ms	51544 KB	Output is correct
18	Correct	11 ms	51544 KB	Output is correct
19	Correct	11 ms	51544 KB	Output is correct

Subtask #3
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	51544 KB	Output is correct
2	Correct	11 ms	51544 KB	Output is correct
3	Correct	14 ms	51544 KB	Output is correct
4	Correct	12 ms	51544 KB	Output is correct
5	Correct	11 ms	51544 KB	Output is correct
6	Correct	11 ms	51544 KB	Output is correct
7	Correct	11 ms	51800 KB	Output is correct
8	Correct	11 ms	51544 KB	Output is correct
9	Correct	11 ms	51544 KB	Output is correct
10	Correct	11 ms	51544 KB	Output is correct
11	Correct	11 ms	51552 KB	Output is correct
12	Correct	11 ms	51544 KB	Output is correct
13	Correct	17 ms	51544 KB	Output is correct
14	Correct	11 ms	51708 KB	Output is correct
15	Correct	11 ms	51544 KB	Output is correct
16	Correct	11 ms	51544 KB	Output is correct
17	Correct	12 ms	51544 KB	Output is correct
18	Correct	11 ms	51544 KB	Output is correct
19	Correct	11 ms	51544 KB	Output is correct
20	Correct	12 ms	51544 KB	Output is correct
21	Correct	11 ms	51544 KB	Output is correct
22	Correct	12 ms	52056 KB	Output is correct
23	Correct	15 ms	51796 KB	Output is correct
24	Correct	16 ms	51928 KB	Output is correct
25	Correct	22 ms	52052 KB	Output is correct
26	Correct	41 ms	52056 KB	Output is correct
27	Correct	24 ms	52056 KB	Output is correct
28	Correct	14 ms	51800 KB	Output is correct
29	Correct	16 ms	51736 KB	Output is correct

Subtask #4
0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	51544 KB	Output is correct
2	Correct	11 ms	51544 KB	Output is correct
3	Correct	14 ms	51544 KB	Output is correct
4	Correct	12 ms	51544 KB	Output is correct
5	Correct	11 ms	51544 KB	Output is correct
6	Correct	11 ms	51544 KB	Output is correct
7	Correct	11 ms	51800 KB	Output is correct
8	Correct	11 ms	51544 KB	Output is correct
9	Correct	11 ms	51544 KB	Output is correct
10	Correct	11 ms	51544 KB	Output is correct
11	Correct	11 ms	51552 KB	Output is correct
12	Correct	11 ms	51544 KB	Output is correct
13	Correct	17 ms	51544 KB	Output is correct
14	Correct	11 ms	51708 KB	Output is correct
15	Correct	11 ms	51544 KB	Output is correct
16	Correct	11 ms	51544 KB	Output is correct
17	Correct	12 ms	51544 KB	Output is correct
18	Correct	11 ms	51544 KB	Output is correct
19	Correct	11 ms	51544 KB	Output is correct
20	Correct	12 ms	51544 KB	Output is correct
21	Correct	11 ms	51544 KB	Output is correct
22	Correct	12 ms	52056 KB	Output is correct
23	Correct	15 ms	51796 KB	Output is correct
24	Correct	16 ms	51928 KB	Output is correct
25	Correct	22 ms	52052 KB	Output is correct
26	Correct	41 ms	52056 KB	Output is correct
27	Correct	24 ms	52056 KB	Output is correct
28	Correct	14 ms	51800 KB	Output is correct
29	Correct	16 ms	51736 KB	Output is correct
30	Correct	587 ms	53012 KB	Output is correct
31	Correct	161 ms	52332 KB	Output is correct
32	Correct	616 ms	54336 KB	Output is correct
33	Correct	630 ms	53824 KB	Output is correct
34	Correct	1551 ms	55416 KB	Output is correct
35	Correct	3514 ms	54752 KB	Output is correct
36	Correct	3603 ms	54308 KB	Output is correct
37	Correct	3161 ms	54104 KB	Output is correct
38	Execution timed out	4038 ms	53392 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	51544 KB	Output is correct
2	Correct	11 ms	51544 KB	Output is correct
3	Correct	14 ms	51544 KB	Output is correct
4	Correct	12 ms	51544 KB	Output is correct
5	Correct	11 ms	51544 KB	Output is correct
6	Correct	11 ms	51544 KB	Output is correct
7	Correct	11 ms	51800 KB	Output is correct
8	Correct	11 ms	51544 KB	Output is correct
9	Correct	11 ms	51544 KB	Output is correct
10	Correct	11 ms	51544 KB	Output is correct
11	Correct	11 ms	51552 KB	Output is correct
12	Correct	11 ms	51544 KB	Output is correct
13	Correct	17 ms	51544 KB	Output is correct
14	Correct	11 ms	51708 KB	Output is correct
15	Correct	11 ms	51544 KB	Output is correct
16	Correct	11 ms	51544 KB	Output is correct
17	Correct	12 ms	51544 KB	Output is correct
18	Correct	11 ms	51544 KB	Output is correct
19	Correct	11 ms	51544 KB	Output is correct
20	Correct	12 ms	51544 KB	Output is correct
21	Correct	11 ms	51544 KB	Output is correct
22	Correct	12 ms	52056 KB	Output is correct
23	Correct	15 ms	51796 KB	Output is correct
24	Correct	16 ms	51928 KB	Output is correct
25	Correct	22 ms	52052 KB	Output is correct
26	Correct	41 ms	52056 KB	Output is correct
27	Correct	24 ms	52056 KB	Output is correct
28	Correct	14 ms	51800 KB	Output is correct
29	Correct	16 ms	51736 KB	Output is correct
30	Correct	587 ms	53012 KB	Output is correct
31	Correct	161 ms	52332 KB	Output is correct
32	Correct	616 ms	54336 KB	Output is correct
33	Correct	630 ms	53824 KB	Output is correct
34	Correct	1551 ms	55416 KB	Output is correct
35	Correct	3514 ms	54752 KB	Output is correct
36	Correct	3603 ms	54308 KB	Output is correct
37	Correct	3161 ms	54104 KB	Output is correct
38	Execution timed out	4038 ms	53392 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Submission #975707

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 10.0 / 10.0

Subtask #3 18.0 / 18.0

Subtask #4 0.0 / 30.0

Subtask #5 0.0 / 40.0

Subtask #1
2.0 / 2.0

Subtask #2
10.0 / 10.0

Subtask #3
18.0 / 18.0

Subtask #4
0.0 / 30.0

Subtask #5
0.0 / 40.0