# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
752626 |
2023-06-03T10:20:03 Z |
Dan4Life |
Game (APIO22_game) |
C++17 |
|
128 ms |
262144 KB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int mxN = (int)2e5+10;
int n, k, sm[mxN], bg[mxN];
vector<int> adj[mxN], radj[mxN];
void init(int N, int K) {
n = N; k = K;
for(int i = 0; i < k; i++)
sm[i]=bg[i] =i;
for(int i = k; i < n; i++)
sm[i] = n, bg[i] = -1;
}
void dfs(int s, int c, vector<int> adj[], bool ok){
if(ok){
if(bg[s]>=c) return;
bg[s] = c;
}
else sm[s] = c;
for(auto u : adj[s]) dfs(u,c,adj,ok);
}
int add_teleporter(int u, int v) {
if(u>=v and u<k) return 1;
if(max(u,v)<k) return 0;
adj[u].pb(v), radj[v].pb(u);
dfs(u, sm[v], radj,0), dfs(v,bg[u], adj,1);
return (sm[v]<=bg[u] and bg[u]<k);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9680 KB |
Output is correct |
2 |
Correct |
7 ms |
9680 KB |
Output is correct |
3 |
Correct |
5 ms |
9680 KB |
Output is correct |
4 |
Correct |
5 ms |
9680 KB |
Output is correct |
5 |
Correct |
5 ms |
9680 KB |
Output is correct |
6 |
Correct |
5 ms |
9680 KB |
Output is correct |
7 |
Correct |
6 ms |
9680 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9680 KB |
Output is correct |
2 |
Correct |
7 ms |
9680 KB |
Output is correct |
3 |
Correct |
5 ms |
9680 KB |
Output is correct |
4 |
Correct |
5 ms |
9680 KB |
Output is correct |
5 |
Correct |
5 ms |
9680 KB |
Output is correct |
6 |
Correct |
5 ms |
9680 KB |
Output is correct |
7 |
Correct |
6 ms |
9680 KB |
Output is correct |
8 |
Runtime error |
128 ms |
262144 KB |
Execution killed with signal 9 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9680 KB |
Output is correct |
2 |
Correct |
7 ms |
9680 KB |
Output is correct |
3 |
Correct |
5 ms |
9680 KB |
Output is correct |
4 |
Correct |
5 ms |
9680 KB |
Output is correct |
5 |
Correct |
5 ms |
9680 KB |
Output is correct |
6 |
Correct |
5 ms |
9680 KB |
Output is correct |
7 |
Correct |
6 ms |
9680 KB |
Output is correct |
8 |
Runtime error |
128 ms |
262144 KB |
Execution killed with signal 9 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9680 KB |
Output is correct |
2 |
Correct |
7 ms |
9680 KB |
Output is correct |
3 |
Correct |
5 ms |
9680 KB |
Output is correct |
4 |
Correct |
5 ms |
9680 KB |
Output is correct |
5 |
Correct |
5 ms |
9680 KB |
Output is correct |
6 |
Correct |
5 ms |
9680 KB |
Output is correct |
7 |
Correct |
6 ms |
9680 KB |
Output is correct |
8 |
Runtime error |
128 ms |
262144 KB |
Execution killed with signal 9 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
9680 KB |
Output is correct |
2 |
Correct |
7 ms |
9680 KB |
Output is correct |
3 |
Correct |
5 ms |
9680 KB |
Output is correct |
4 |
Correct |
5 ms |
9680 KB |
Output is correct |
5 |
Correct |
5 ms |
9680 KB |
Output is correct |
6 |
Correct |
5 ms |
9680 KB |
Output is correct |
7 |
Correct |
6 ms |
9680 KB |
Output is correct |
8 |
Runtime error |
128 ms |
262144 KB |
Execution killed with signal 9 |
9 |
Halted |
0 ms |
0 KB |
- |