| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 578450 |
2022-06-17T00:54:44 Z |
handlename |
Game (APIO22_game) |
C++17 |
|
10 ms |
14348 KB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
const int MOD=1e9+7;
int n,k;
vector<int> adj[300001],rev[300001];
pair<int,int> range[300001];
//rightmost special node to go i, leftmost special node i can go to
void init(int N,int K){
n=N;
k=K;
for (int i=1;i<=k;i++){
adj[i].pb(i+1);
rev[i+1].pb(i);
range[i]=mp(i,i);
}
for (int i=k+1;i<=n;i++){
range[i]=mp(0,k+1);
}
}
bool upd(int u,int v){
if (range[u].second<=range[v].first) return false;
if (range[u].first>=range[v].second) return true;
while ((range[v].first+range[v].second)/2<range[u].first){
range[v].first=(range[v].first+range[v].second)/2+1;
for (auto i:adj[v]){
if (upd(v,i)) return true;
}
}
while ((range[u].second+range[u].first)/2>=range[v].second){
range[u].second=(range[u].second+range[u].first)/2;
for (auto i:rev[u]){
if (upd(i,u)) return true;
}
}
return false;
}
int add_teleporter(int u,int v){
u++;
v++;
if (u>=v && u<=k) return 1;
if (u==v) return 0;
adj[u].pb(v);
rev[v].pb(u);
return upd(u,v);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 2 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14348 KB |
Output is correct |
| 4 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 5 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 6 |
Correct |
8 ms |
14288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
14288 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 2 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14348 KB |
Output is correct |
| 4 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 5 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 6 |
Correct |
8 ms |
14288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 8 |
Incorrect |
10 ms |
14288 KB |
Wrong Answer[1] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 2 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14348 KB |
Output is correct |
| 4 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 5 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 6 |
Correct |
8 ms |
14288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 8 |
Incorrect |
10 ms |
14288 KB |
Wrong Answer[1] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 2 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14348 KB |
Output is correct |
| 4 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 5 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 6 |
Correct |
8 ms |
14288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 8 |
Incorrect |
10 ms |
14288 KB |
Wrong Answer[1] |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 2 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14348 KB |
Output is correct |
| 4 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 5 |
Correct |
7 ms |
14288 KB |
Output is correct |
| 6 |
Correct |
8 ms |
14288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
14288 KB |
Output is correct |
| 8 |
Incorrect |
10 ms |
14288 KB |
Wrong Answer[1] |
| 9 |
Halted |
0 ms |
0 KB |
- |
