Submission #975720

# Submission time Handle Problem Language Result Execution time Memory
975720 2024-05-05T18:58:30 Z ShaShi Game (APIO22_game) C++17
30 / 100
4000 ms 55264 KB
#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], flag;
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) {
	if (flag) return;

	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));

	if (!flag && v >= K && dp[v] != -1 && pd[v] != -1 && dp[v] <= pd[v]) flag = 1;
 
	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(v, 0);
	} else if (v < K) {
		X = v;
		DFS(u, 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 flag;
}
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51544 KB Output is correct
2 Correct 11 ms 51544 KB Output is correct
3 Correct 11 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 51544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51544 KB Output is correct
2 Correct 11 ms 51544 KB Output is correct
3 Correct 11 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 51544 KB Output is correct
8 Correct 11 ms 51544 KB Output is correct
9 Correct 13 ms 51716 KB Output is correct
10 Correct 12 ms 51652 KB Output is correct
11 Correct 11 ms 51544 KB Output is correct
12 Correct 11 ms 51544 KB Output is correct
13 Correct 12 ms 51544 KB Output is correct
14 Correct 11 ms 51544 KB Output is correct
15 Correct 11 ms 51628 KB Output is correct
16 Correct 11 ms 51744 KB Output is correct
17 Correct 11 ms 51544 KB Output is correct
18 Correct 12 ms 51544 KB Output is correct
19 Correct 11 ms 51544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51544 KB Output is correct
2 Correct 11 ms 51544 KB Output is correct
3 Correct 11 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 51544 KB Output is correct
8 Correct 11 ms 51544 KB Output is correct
9 Correct 13 ms 51716 KB Output is correct
10 Correct 12 ms 51652 KB Output is correct
11 Correct 11 ms 51544 KB Output is correct
12 Correct 11 ms 51544 KB Output is correct
13 Correct 12 ms 51544 KB Output is correct
14 Correct 11 ms 51544 KB Output is correct
15 Correct 11 ms 51628 KB Output is correct
16 Correct 11 ms 51744 KB Output is correct
17 Correct 11 ms 51544 KB Output is correct
18 Correct 12 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 12 ms 51796 KB Output is correct
22 Correct 12 ms 52052 KB Output is correct
23 Correct 12 ms 51800 KB Output is correct
24 Correct 15 ms 51800 KB Output is correct
25 Correct 17 ms 52312 KB Output is correct
26 Correct 35 ms 51800 KB Output is correct
27 Correct 13 ms 51800 KB Output is correct
28 Correct 12 ms 51544 KB Output is correct
29 Correct 13 ms 51912 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51544 KB Output is correct
2 Correct 11 ms 51544 KB Output is correct
3 Correct 11 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 51544 KB Output is correct
8 Correct 11 ms 51544 KB Output is correct
9 Correct 13 ms 51716 KB Output is correct
10 Correct 12 ms 51652 KB Output is correct
11 Correct 11 ms 51544 KB Output is correct
12 Correct 11 ms 51544 KB Output is correct
13 Correct 12 ms 51544 KB Output is correct
14 Correct 11 ms 51544 KB Output is correct
15 Correct 11 ms 51628 KB Output is correct
16 Correct 11 ms 51744 KB Output is correct
17 Correct 11 ms 51544 KB Output is correct
18 Correct 12 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 12 ms 51796 KB Output is correct
22 Correct 12 ms 52052 KB Output is correct
23 Correct 12 ms 51800 KB Output is correct
24 Correct 15 ms 51800 KB Output is correct
25 Correct 17 ms 52312 KB Output is correct
26 Correct 35 ms 51800 KB Output is correct
27 Correct 13 ms 51800 KB Output is correct
28 Correct 12 ms 51544 KB Output is correct
29 Correct 13 ms 51912 KB Output is correct
30 Correct 40 ms 53024 KB Output is correct
31 Correct 18 ms 52056 KB Output is correct
32 Correct 42 ms 54124 KB Output is correct
33 Correct 55 ms 54044 KB Output is correct
34 Correct 983 ms 55120 KB Output is correct
35 Correct 827 ms 54696 KB Output is correct
36 Correct 1684 ms 54136 KB Output is correct
37 Correct 777 ms 54432 KB Output is correct
38 Correct 529 ms 53372 KB Output is correct
39 Correct 587 ms 53896 KB Output is correct
40 Correct 899 ms 55224 KB Output is correct
41 Correct 522 ms 54188 KB Output is correct
42 Correct 255 ms 54104 KB Output is correct
43 Execution timed out 4046 ms 55264 KB Time limit exceeded
44 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 15 ms 51544 KB Output is correct
2 Correct 11 ms 51544 KB Output is correct
3 Correct 11 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 51544 KB Output is correct
8 Correct 11 ms 51544 KB Output is correct
9 Correct 13 ms 51716 KB Output is correct
10 Correct 12 ms 51652 KB Output is correct
11 Correct 11 ms 51544 KB Output is correct
12 Correct 11 ms 51544 KB Output is correct
13 Correct 12 ms 51544 KB Output is correct
14 Correct 11 ms 51544 KB Output is correct
15 Correct 11 ms 51628 KB Output is correct
16 Correct 11 ms 51744 KB Output is correct
17 Correct 11 ms 51544 KB Output is correct
18 Correct 12 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 12 ms 51796 KB Output is correct
22 Correct 12 ms 52052 KB Output is correct
23 Correct 12 ms 51800 KB Output is correct
24 Correct 15 ms 51800 KB Output is correct
25 Correct 17 ms 52312 KB Output is correct
26 Correct 35 ms 51800 KB Output is correct
27 Correct 13 ms 51800 KB Output is correct
28 Correct 12 ms 51544 KB Output is correct
29 Correct 13 ms 51912 KB Output is correct
30 Correct 40 ms 53024 KB Output is correct
31 Correct 18 ms 52056 KB Output is correct
32 Correct 42 ms 54124 KB Output is correct
33 Correct 55 ms 54044 KB Output is correct
34 Correct 983 ms 55120 KB Output is correct
35 Correct 827 ms 54696 KB Output is correct
36 Correct 1684 ms 54136 KB Output is correct
37 Correct 777 ms 54432 KB Output is correct
38 Correct 529 ms 53372 KB Output is correct
39 Correct 587 ms 53896 KB Output is correct
40 Correct 899 ms 55224 KB Output is correct
41 Correct 522 ms 54188 KB Output is correct
42 Correct 255 ms 54104 KB Output is correct
43 Execution timed out 4046 ms 55264 KB Time limit exceeded
44 Halted 0 ms 0 KB -