oj.uz

답안 #1103819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1103819 2024-10-21T21:25:32 Z epicci23 게임 (APIO22_game) C++17
60 / 100
 4000 ms 47184 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 = 800;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 4 ms 19024 KB Output is correct
3 Correct 6 ms 19024 KB Output is correct
4 Correct 4 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 4 ms 19024 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 4 ms 19024 KB Output is correct
3 Correct 6 ms 19024 KB Output is correct
4 Correct 4 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 4 ms 19024 KB Output is correct
8 Correct 7 ms 19024 KB Output is correct
9 Correct 9 ms 19128 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19228 KB Output is correct
13 Correct 4 ms 19024 KB Output is correct
14 Correct 4 ms 19024 KB Output is correct
15 Correct 6 ms 19232 KB Output is correct
16 Correct 5 ms 19024 KB Output is correct
17 Correct 5 ms 19024 KB Output is correct
18 Correct 4 ms 19024 KB Output is correct
19 Correct 4 ms 19024 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 4 ms 19024 KB Output is correct
3 Correct 6 ms 19024 KB Output is correct
4 Correct 4 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 4 ms 19024 KB Output is correct
8 Correct 7 ms 19024 KB Output is correct
9 Correct 9 ms 19128 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19228 KB Output is correct
13 Correct 4 ms 19024 KB Output is correct
14 Correct 4 ms 19024 KB Output is correct
15 Correct 6 ms 19232 KB Output is correct
16 Correct 5 ms 19024 KB Output is correct
17 Correct 5 ms 19024 KB Output is correct
18 Correct 4 ms 19024 KB Output is correct
19 Correct 4 ms 19024 KB Output is correct
20 Correct 4 ms 19024 KB Output is correct
21 Correct 4 ms 19024 KB Output is correct
22 Correct 10 ms 19280 KB Output is correct
23 Correct 4 ms 19280 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 7 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 8 ms 19280 KB Output is correct
28 Correct 6 ms 19280 KB Output is correct
29 Correct 5 ms 19280 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 4 ms 19024 KB Output is correct
3 Correct 6 ms 19024 KB Output is correct
4 Correct 4 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 4 ms 19024 KB Output is correct
8 Correct 7 ms 19024 KB Output is correct
9 Correct 9 ms 19128 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19228 KB Output is correct
13 Correct 4 ms 19024 KB Output is correct
14 Correct 4 ms 19024 KB Output is correct
15 Correct 6 ms 19232 KB Output is correct
16 Correct 5 ms 19024 KB Output is correct
17 Correct 5 ms 19024 KB Output is correct
18 Correct 4 ms 19024 KB Output is correct
19 Correct 4 ms 19024 KB Output is correct
20 Correct 4 ms 19024 KB Output is correct
21 Correct 4 ms 19024 KB Output is correct
22 Correct 10 ms 19280 KB Output is correct
23 Correct 4 ms 19280 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 7 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 8 ms 19280 KB Output is correct
28 Correct 6 ms 19280 KB Output is correct
29 Correct 5 ms 19280 KB Output is correct
30 Correct 21 ms 20296 KB Output is correct
31 Correct 14 ms 19536 KB Output is correct
32 Correct 30 ms 21320 KB Output is correct
33 Correct 26 ms 21072 KB Output is correct
34 Correct 1077 ms 22916 KB Output is correct
35 Correct 378 ms 21832 KB Output is correct
36 Correct 34 ms 20940 KB Output is correct
37 Correct 32 ms 21072 KB Output is correct
38 Correct 21 ms 20816 KB Output is correct
39 Correct 34 ms 21012 KB Output is correct
40 Correct 903 ms 22920 KB Output is correct
41 Correct 172 ms 21568 KB Output is correct
42 Correct 122 ms 21040 KB Output is correct
43 Correct 34 ms 22088 KB Output is correct
44 Correct 780 ms 22940 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19024 KB Output is correct
2 Correct 4 ms 19024 KB Output is correct
3 Correct 6 ms 19024 KB Output is correct
4 Correct 4 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 4 ms 19024 KB Output is correct
8 Correct 7 ms 19024 KB Output is correct
9 Correct 9 ms 19128 KB Output is correct
10 Correct 9 ms 19024 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 4 ms 19228 KB Output is correct
13 Correct 4 ms 19024 KB Output is correct
14 Correct 4 ms 19024 KB Output is correct
15 Correct 6 ms 19232 KB Output is correct
16 Correct 5 ms 19024 KB Output is correct
17 Correct 5 ms 19024 KB Output is correct
18 Correct 4 ms 19024 KB Output is correct
19 Correct 4 ms 19024 KB Output is correct
20 Correct 4 ms 19024 KB Output is correct
21 Correct 4 ms 19024 KB Output is correct
22 Correct 10 ms 19280 KB Output is correct
23 Correct 4 ms 19280 KB Output is correct
24 Correct 7 ms 19280 KB Output is correct
25 Correct 7 ms 19280 KB Output is correct
26 Correct 6 ms 19280 KB Output is correct
27 Correct 8 ms 19280 KB Output is correct
28 Correct 6 ms 19280 KB Output is correct
29 Correct 5 ms 19280 KB Output is correct
30 Correct 21 ms 20296 KB Output is correct
31 Correct 14 ms 19536 KB Output is correct
32 Correct 30 ms 21320 KB Output is correct
33 Correct 26 ms 21072 KB Output is correct
34 Correct 1077 ms 22916 KB Output is correct
35 Correct 378 ms 21832 KB Output is correct
36 Correct 34 ms 20940 KB Output is correct
37 Correct 32 ms 21072 KB Output is correct
38 Correct 21 ms 20816 KB Output is correct
39 Correct 34 ms 21012 KB Output is correct
40 Correct 903 ms 22920 KB Output is correct
41 Correct 172 ms 21568 KB Output is correct
42 Correct 122 ms 21040 KB Output is correct
43 Correct 34 ms 22088 KB Output is correct
44 Correct 780 ms 22940 KB Output is correct
45 Correct 208 ms 30552 KB Output is correct
46 Correct 7 ms 19536 KB Output is correct
47 Correct 7 ms 19536 KB Output is correct
48 Correct 291 ms 46172 KB Output is correct
49 Correct 282 ms 38064 KB Output is correct
50 Execution timed out 4099 ms 47184 KB Time limit exceeded
51 Halted 0 ms 0 KB -