oj.uz

Submission #1103818

# Submission time Handle Problem Language Result Execution time Memory
1103818 2024-10-21T21:24:44 Z epicci23 Game (APIO22_game) C++17
60 / 100
 4000 ms 47740 KB 
#include "bits/stdc++.h"
#include "game.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

const int N = 3e5 + 5;
const int BL = 600;
vector<int> v[N],g[N];
int n,m,k,out[N],in[N],bin[N],bout[N];
bool ok=0;

void upd_in(int a,int val){
  if(in[a]<val || ok) return;
  in[a]=min(in[a],val);
  bin[a]=min(bin[a],val/BL);
  if(in[a]<out[a] || bin[a]<bout[a]){
    ok=1;
    return;
  }
  if(in[a]==out[a] && a>=k){
  	ok=1;
    return;
  }
  for(int x:g[a]) if(in[x]>val && bin[x]==bin[a]) upd_in(x,val);
}

void upd_out(int a,int val){
  if(out[a]>val || ok) return;
  out[a]=max(out[a],val);
  bout[a]=max(bout[a],val/BL);
  if(in[a]<out[a] || bin[a]<bout[a]){
    ok=1;
    return;
  }
  if(in[a]==out[a] && a>=k){
  	ok=1;
    return;
  }
  for(int x:v[a]) if(out[x]<val && bout[x]==bout[a]) upd_out(x,val);
}

void upd_bin(int a,int val,int real){
  if(bin[a]<=val || ok) return;
  bin[a]=val;
  in[a]=min(in[a],real);
  if(bin[a]<bout[a] || in[a]<out[a]){
    ok=1;
    return;
  }
  if(bin[a]==bout[a]){
  	upd_in(a,in[a]);
  	upd_in(in[a],in[a]);
  }
  for(int x:g[a]) if(bin[x]>val) upd_bin(x,val,in[a]);
}

void upd_bout(int a,int val,int real){
  if(bout[a]>=val || ok) return;
  bout[a]=val;
  out[a]=max(out[a],real);
  if(bin[a]<bout[a] || in[a]<out[a]){
    ok=1;
    return;
  }
  if(bin[a]==bout[a]){
  	upd_out(a,out[a]);
  	upd_out(out[a],out[a]);
  }
  for(int x:v[a]) if(bout[x]<val) upd_bout(x,val,out[a]);
}

void init(int _n,int _k){
  n=_n,k=_k;
  for(int i=1;i<k;i++){
  	v[i-1].push_back(i);
  	g[i].push_back(i-1);
  }
  fill(bout,bout+N,-1);
  fill(bin,bin+N,k);
  fill(out,out+N,-1);
  fill(in,in+N,k);
  for(int i=0;i<k;i++) bin[i]=bout[i]=i/BL;
  for(int i=0;i<k;i++) in[i]=out[i]=i;
}

int add_teleporter(int a, int b){
  if(a==b && a<k) ok=1;
  if(a<k && b<k && a>b) ok=1;
  v[a].push_back(b);
  g[b].push_back(a);
  upd_bout(b,bout[a],out[a]);
  upd_bin(a,bin[b],in[b]);
  upd_in(a,in[b]);
  upd_out(b,out[a]);
  return ok;
}

/*void _(){
  cin >> n >> m >> k;
  for(int i=1;i<k;i++){
  	v[i-1].push_back(i);
  	g[i].push_back(i-1);
  }
  fill(bout,bout+N,-1);
  fill(bin,bin+N,k);
  fill(out,out+N,-1);
  fill(in,in+N,k);
  for(int i=0;i<k;i++) bin[i]=bout[i]=i/BL;
  for(int i=0;i<k;i++) in[i]=out[i]=i;
  for(int i=1;i<=m;i++){
  	int a,b;
  	cin >> a >> b;
  	if(a==b && a<k) ok=1;
  	if(a<k && b<k && a>b) ok=1;
  	v[a].push_back(b);
  	g[b].push_back(a);
    upd_bout(b,bout[a],out[a]);
    upd_bin(a,bin[b],in[b]);
    upd_bout(bout[a],bout[a],out[bout[a]]);
    upd_bin(bin[b],bin[b],in[bin[b]]);
    upd_in(a,in[b]);
    upd_out(b,out[a]);
  	cout << ok << '\n';
  }
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 6 ms 19024 KB Output is correct
3 Correct 9 ms 19024 KB Output is correct
4 Correct 10 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 4 ms 19024 KB Output is correct
7 Correct 9 ms 19024 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 6 ms 19024 KB Output is correct
3 Correct 9 ms 19024 KB Output is correct
4 Correct 10 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 4 ms 19024 KB Output is correct
7 Correct 9 ms 19024 KB Output is correct
8 Correct 6 ms 19024 KB Output is correct
9 Correct 9 ms 19024 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 8 ms 19024 KB Output is correct
13 Correct 7 ms 19232 KB Output is correct
14 Correct 7 ms 19192 KB Output is correct
15 Correct 5 ms 19024 KB Output is correct
16 Correct 8 ms 19024 KB Output is correct
17 Correct 6 ms 19024 KB Output is correct
18 Correct 9 ms 19024 KB Output is correct
19 Correct 7 ms 19024 KB Output is correct
20 Correct 6 ms 19024 KB Output is correct
21 Correct 3 ms 19024 KB Output is correct
22 Correct 6 ms 19280 KB Output is correct
23 Correct 8 ms 19536 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 6 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 10 ms 19280 KB Output is correct
28 Correct 9 ms 19280 KB Output is correct
29 Correct 6 ms 19280 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 6 ms 19024 KB Output is correct
3 Correct 9 ms 19024 KB Output is correct
4 Correct 10 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 4 ms 19024 KB Output is correct
7 Correct 9 ms 19024 KB Output is correct
8 Correct 6 ms 19024 KB Output is correct
9 Correct 9 ms 19024 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 8 ms 19024 KB Output is correct
13 Correct 7 ms 19232 KB Output is correct
14 Correct 7 ms 19192 KB Output is correct
15 Correct 5 ms 19024 KB Output is correct
16 Correct 8 ms 19024 KB Output is correct
17 Correct 6 ms 19024 KB Output is correct
18 Correct 9 ms 19024 KB Output is correct
19 Correct 7 ms 19024 KB Output is correct
20 Correct 6 ms 19024 KB Output is correct
21 Correct 3 ms 19024 KB Output is correct
22 Correct 6 ms 19280 KB Output is correct
23 Correct 8 ms 19536 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 6 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 10 ms 19280 KB Output is correct
28 Correct 9 ms 19280 KB Output is correct
29 Correct 6 ms 19280 KB Output is correct
30 Correct 16 ms 20304 KB Output is correct
31 Correct 12 ms 19536 KB Output is correct
32 Correct 18 ms 21328 KB Output is correct
33 Correct 20 ms 21072 KB Output is correct
34 Correct 1135 ms 22912 KB Output is correct
35 Correct 397 ms 21768 KB Output is correct
36 Correct 30 ms 21068 KB Output is correct
37 Correct 26 ms 21072 KB Output is correct
38 Correct 23 ms 20824 KB Output is correct
39 Correct 27 ms 20848 KB Output is correct
40 Correct 900 ms 22856 KB Output is correct
41 Correct 173 ms 21328 KB Output is correct
42 Correct 113 ms 21064 KB Output is correct
43 Correct 44 ms 22088 KB Output is correct
44 Correct 824 ms 22696 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 6 ms 19024 KB Output is correct
3 Correct 9 ms 19024 KB Output is correct
4 Correct 10 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 4 ms 19024 KB Output is correct
7 Correct 9 ms 19024 KB Output is correct
8 Correct 6 ms 19024 KB Output is correct
9 Correct 9 ms 19024 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 8 ms 19024 KB Output is correct
13 Correct 7 ms 19232 KB Output is correct
14 Correct 7 ms 19192 KB Output is correct
15 Correct 5 ms 19024 KB Output is correct
16 Correct 8 ms 19024 KB Output is correct
17 Correct 6 ms 19024 KB Output is correct
18 Correct 9 ms 19024 KB Output is correct
19 Correct 7 ms 19024 KB Output is correct
20 Correct 6 ms 19024 KB Output is correct
21 Correct 3 ms 19024 KB Output is correct
22 Correct 6 ms 19280 KB Output is correct
23 Correct 8 ms 19536 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 6 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 10 ms 19280 KB Output is correct
28 Correct 9 ms 19280 KB Output is correct
29 Correct 6 ms 19280 KB Output is correct
30 Correct 16 ms 20304 KB Output is correct
31 Correct 12 ms 19536 KB Output is correct
32 Correct 18 ms 21328 KB Output is correct
33 Correct 20 ms 21072 KB Output is correct
34 Correct 1135 ms 22912 KB Output is correct
35 Correct 397 ms 21768 KB Output is correct
36 Correct 30 ms 21068 KB Output is correct
37 Correct 26 ms 21072 KB Output is correct
38 Correct 23 ms 20824 KB Output is correct
39 Correct 27 ms 20848 KB Output is correct
40 Correct 900 ms 22856 KB Output is correct
41 Correct 173 ms 21328 KB Output is correct
42 Correct 113 ms 21064 KB Output is correct
43 Correct 44 ms 22088 KB Output is correct
44 Correct 824 ms 22696 KB Output is correct
45 Correct 256 ms 30456 KB Output is correct
46 Correct 10 ms 19600 KB Output is correct
47 Correct 9 ms 19792 KB Output is correct
48 Correct 246 ms 45844 KB Output is correct
49 Correct 232 ms 37864 KB Output is correct
50 Execution timed out 4096 ms 47740 KB Time limit exceeded
51 Halted 0 ms 0 KB -