oj.uz

Submission #567359

# Submission time Handle Problem Language Result Execution time Memory
567359 2022-05-23T10:53:39 Z amunduzbaev Rainforest Jumps (APIO21_jumps) C++17
21 / 100
 2069 ms 1048576 KB 
#include "jumps.h"

#ifndef EVAL
#include "stub.cpp"
#endif

#include "bits/stdc++.h"
using namespace std;

const int B = 1500;
const int N = 2e5 + 5;
const int M = N / B + 2;
const int lg = 18;
vector<int> edges[N];
int mx[N][lg], mn[N][lg], h[N], pos[N];
int st[N][lg], pre[N];
int lx[N], rx[N];

struct ST{
	int tree[N][lg];
	void build(){
		for(int i=0;i<N;i++) tree[i][0] = pre[i];
		for(int j=1;j<lg;j++){
			for(int i=0;i + (1 << (j - 1))<N;i++){
				tree[i][j] = min(tree[i][j-1], tree[i + (1 << (j - 1))][j-1]);
			}
		}
	}
	
	int get(int l, int r){
		int lg = __lg(r - l + 1);
		return min(tree[l][lg], tree[r - (1 << lg) + 1][lg]);
	}
}tree[M];

void init(int n, vector<int> H){
	for(int i=0;i<n;i++){
		h[i] = H[i];
		pos[h[i]] = i;
		st[i][0] = h[i];
	}
	
	vector<int> ss;
	for(int i=0;i<n;i++){
		while(!ss.empty() && h[ss.back()] < h[i]) ss.pop_back();
		if(!ss.empty()) lx[i] = ss.back();
		else lx[i] = n;
		ss.push_back(i);
	} ss.clear();
	
	for(int i=n-1;~i;i--){
		while(!ss.empty() && h[ss.back()] < h[i]) ss.pop_back();
		if(!ss.empty()) rx[i] = ss.back();
		else rx[i] = n;
		ss.push_back(i);
	} ss.clear();
	h[n] = N;
	
	for(int i=0;i<n;i++){
		if(h[lx[i]] < h[rx[i]]){
			swap(lx[i], rx[i]);
		} 
		edges[lx[i]].push_back(i);
		edges[rx[i]].push_back(i);
		mn[i][0] = rx[i];
		mx[i][0] = lx[i];
		lx[i] = min(lx[i], rx[i]);
		if(i < lx[i]) lx[i] = -1;
	}
	mn[n][0] = mx[n][0] = n;
	edges[n].clear();
	
	for(int b=0;b * B<n;b++){
		memset(pre, 127, sizeof pre);
		queue<int> q;
		for(int i=0;b * B + i<n && i<B;i++){
			q.push(b * B + i);
			pre[b * B + i] = 0;
		}
		
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(pre[x] > pre[u] + 1){
					pre[x] = pre[u] + 1;
					q.push(x);
				}
			}
		}
		
		tree[b].build();
	}
	
	for(int j=1;j<lg;j++){
		for(int i=0;i<=n;i++){
			if(i + (1 << (j - 1)) < n) st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j-1]);
			mn[i][j] = mn[mn[i][j-1]][j-1];
			mx[i][j] = mx[mx[i][j-1]][j-1];
		}
	}
}

int get(int l, int r){
	int lg = __lg(r - l + 1);
	return max(st[l][lg], st[r - (1 << lg) + 1][lg]);
}

int check(int a, int c){
	int res = 0;
	for(int i=lg-1;~i;i--){
		if(h[mx[a][i]] <= h[c]){
			//~ cout<<mx[a][i]<<" "<<h[mx[a][i]]<<" "<<h[c]<<"\n";
			//~ cout<<i<<"\n";
			a = mx[a][i], res += (1 << i);
		}
	}
	
	for(int i=lg-1;~i;i--){
		if(h[mn[a][i]] <= h[c]){
			//~ cout<<mx[a][i]<<" "<<h[mx[a][i]]<<" "<<h[c]<<"\n";
			a = mn[a][i], res += (1 << i);
		}
	}
	
	if(a != c) return N;
	return res;
}

int minimum_jumps(int a, int b, int c, int d) {
	int bl = c / B, br = d / B;
	int res = N;
	for(int j=bl+1;j<br;j++){
		//~ assert(false);
		res = min(res, tree[j].get(a, b));
	}
	
	auto calc = [&](int l, int r){
		for(int i=l;i<=r;i++){
			int L = max(lx[i] + 1, a);
			if(L <= b){
				int mx = pos[get(L, b)];
				res = min(res, check(mx, i));
			}
		}
	};
	
	if(bl == br){
		calc(c, d);
	} else {
		if(c % B == 0) res = min(res, tree[bl].get(a, b));
		else calc(c, (bl + 1) * B - 1);
		if((d + 1) % B == 0) res = min(res, tree[br].get(a, b));
		else calc(br * B, d);
	}
	
	if(res == N) return -1;
	return res;
}

/*

7 2
3 2 1 6 4 5 7
4 4 6 6
0 1 2 2

*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 19924 KB Output is correct
2 Correct 31 ms 19900 KB Output is correct
3 Runtime error 2069 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 19920 KB Output is correct
2 Correct 35 ms 19920 KB Output is correct
3 Correct 40 ms 19920 KB Output is correct
4 Correct 36 ms 19908 KB Output is correct
5 Correct 39 ms 19844 KB Output is correct
6 Correct 39 ms 19860 KB Output is correct
7 Correct 41 ms 19912 KB Output is correct
8 Correct 37 ms 19964 KB Output is correct
9 Correct 33 ms 19920 KB Output is correct
10 Correct 38 ms 19920 KB Output is correct
11 Correct 35 ms 19908 KB Output is correct
12 Correct 36 ms 19876 KB Output is correct
13 Correct 39 ms 19920 KB Output is correct
14 Correct 36 ms 19920 KB Output is correct
15 Correct 38 ms 19868 KB Output is correct
16 Correct 43 ms 19964 KB Output is correct
17 Correct 41 ms 20012 KB Output is correct
18 Correct 33 ms 19920 KB Output is correct
19 Correct 38 ms 19920 KB Output is correct
20 Correct 38 ms 19964 KB Output is correct
21 Correct 40 ms 19988 KB Output is correct
22 Correct 40 ms 19960 KB Output is correct
23 Correct 38 ms 19932 KB Output is correct
24 Correct 37 ms 19920 KB Output is correct
25 Correct 33 ms 19924 KB Output is correct
26 Correct 35 ms 19900 KB Output is correct
27 Correct 34 ms 19920 KB Output is correct
28 Correct 34 ms 19972 KB Output is correct
29 Correct 38 ms 19976 KB Output is correct
30 Correct 37 ms 19964 KB Output is correct
31 Correct 40 ms 19980 KB Output is correct
32 Correct 39 ms 19972 KB Output is correct
33 Correct 31 ms 19920 KB Output is correct
34 Correct 33 ms 19956 KB Output is correct
35 Correct 38 ms 19964 KB Output is correct
36 Correct 32 ms 19984 KB Output is correct
37 Correct 31 ms 19920 KB Output is correct
38 Correct 31 ms 19960 KB Output is correct
39 Correct 31 ms 19980 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 19920 KB Output is correct
2 Correct 35 ms 19920 KB Output is correct
3 Correct 40 ms 19920 KB Output is correct
4 Correct 36 ms 19908 KB Output is correct
5 Correct 39 ms 19844 KB Output is correct
6 Correct 39 ms 19860 KB Output is correct
7 Correct 41 ms 19912 KB Output is correct
8 Correct 37 ms 19964 KB Output is correct
9 Correct 33 ms 19920 KB Output is correct
10 Correct 38 ms 19920 KB Output is correct
11 Correct 35 ms 19908 KB Output is correct
12 Correct 36 ms 19876 KB Output is correct
13 Correct 39 ms 19920 KB Output is correct
14 Correct 36 ms 19920 KB Output is correct
15 Correct 38 ms 19868 KB Output is correct
16 Correct 43 ms 19964 KB Output is correct
17 Correct 41 ms 20012 KB Output is correct
18 Correct 33 ms 19920 KB Output is correct
19 Correct 38 ms 19920 KB Output is correct
20 Correct 38 ms 19964 KB Output is correct
21 Correct 40 ms 19988 KB Output is correct
22 Correct 40 ms 19960 KB Output is correct
23 Correct 38 ms 19932 KB Output is correct
24 Correct 37 ms 19920 KB Output is correct
25 Correct 33 ms 19924 KB Output is correct
26 Correct 35 ms 19900 KB Output is correct
27 Correct 34 ms 19920 KB Output is correct
28 Correct 34 ms 19972 KB Output is correct
29 Correct 38 ms 19976 KB Output is correct
30 Correct 37 ms 19964 KB Output is correct
31 Correct 40 ms 19980 KB Output is correct
32 Correct 39 ms 19972 KB Output is correct
33 Correct 31 ms 19920 KB Output is correct
34 Correct 33 ms 19956 KB Output is correct
35 Correct 38 ms 19964 KB Output is correct
36 Correct 32 ms 19984 KB Output is correct
37 Correct 31 ms 19920 KB Output is correct
38 Correct 31 ms 19960 KB Output is correct
39 Correct 31 ms 19980 KB Output is correct
40 Correct 32 ms 19924 KB Output is correct
41 Correct 38 ms 19864 KB Output is correct
42 Correct 33 ms 19820 KB Output is correct
43 Correct 37 ms 19808 KB Output is correct
44 Correct 36 ms 19908 KB Output is correct
45 Correct 32 ms 19920 KB Output is correct
46 Correct 38 ms 19920 KB Output is correct
47 Correct 36 ms 19920 KB Output is correct
48 Correct 36 ms 19960 KB Output is correct
49 Correct 33 ms 19980 KB Output is correct
50 Correct 42 ms 19968 KB Output is correct
51 Correct 40 ms 19920 KB Output is correct
52 Correct 35 ms 19920 KB Output is correct
53 Correct 34 ms 19984 KB Output is correct
54 Correct 37 ms 19920 KB Output is correct
55 Correct 33 ms 19920 KB Output is correct
56 Correct 34 ms 19988 KB Output is correct
57 Correct 35 ms 19920 KB Output is correct
58 Correct 75 ms 34448 KB Output is correct
59 Correct 80 ms 34508 KB Output is correct
60 Correct 35 ms 20096 KB Output is correct
61 Correct 77 ms 34508 KB Output is correct
62 Correct 45 ms 19960 KB Output is correct
63 Correct 95 ms 34508 KB Output is correct
64 Correct 125 ms 34552 KB Output is correct
65 Correct 131 ms 34504 KB Output is correct
66 Correct 122 ms 34552 KB Output is correct
67 Correct 77 ms 34504 KB Output is correct
68 Correct 100 ms 34504 KB Output is correct
69 Correct 86 ms 34552 KB Output is correct
70 Correct 121 ms 34428 KB Output is correct
71 Correct 31 ms 19856 KB Output is correct
72 Correct 36 ms 19868 KB Output is correct
73 Correct 33 ms 19920 KB Output is correct
74 Correct 33 ms 19920 KB Output is correct
75 Correct 37 ms 19988 KB Output is correct
76 Correct 34 ms 19920 KB Output is correct
77 Correct 33 ms 19920 KB Output is correct
78 Correct 32 ms 19920 KB Output is correct
79 Correct 32 ms 19920 KB Output is correct
80 Correct 35 ms 19924 KB Output is correct
81 Correct 35 ms 19920 KB Output is correct
82 Correct 34 ms 19920 KB Output is correct
83 Correct 33 ms 19920 KB Output is correct
84 Correct 38 ms 19972 KB Output is correct
85 Correct 34 ms 19984 KB Output is correct
86 Correct 32 ms 19820 KB Output is correct
87 Correct 31 ms 19972 KB Output is correct
88 Correct 34 ms 19972 KB Output is correct
89 Correct 32 ms 19988 KB Output is correct
90 Correct 32 ms 19920 KB Output is correct
91 Correct 37 ms 19920 KB Output is correct
92 Correct 33 ms 19984 KB Output is correct
93 Correct 33 ms 19964 KB Output is correct
94 Correct 36 ms 19920 KB Output is correct
95 Correct 76 ms 34392 KB Output is correct
96 Correct 75 ms 34544 KB Output is correct
97 Correct 77 ms 34392 KB Output is correct
98 Correct 81 ms 34416 KB Output is correct
99 Correct 77 ms 34556 KB Output is correct
100 Correct 32 ms 19980 KB Output is correct
101 Correct 38 ms 20104 KB Output is correct
102 Correct 79 ms 34516 KB Output is correct
103 Correct 79 ms 34684 KB Output is correct
104 Correct 78 ms 34396 KB Output is correct
105 Correct 75 ms 34504 KB Output is correct
106 Correct 85 ms 34676 KB Output is correct
107 Correct 31 ms 19984 KB Output is correct
108 Correct 31 ms 20176 KB Output is correct
109 Correct 58 ms 34384 KB Output is correct
110 Correct 61 ms 34520 KB Output is correct
111 Correct 60 ms 34520 KB Output is correct
112 Correct 60 ms 34540 KB Output is correct
113 Correct 64 ms 34548 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 20032 KB Output is correct
2 Correct 31 ms 19920 KB Output is correct
3 Correct 31 ms 19928 KB Output is correct
4 Correct 32 ms 19904 KB Output is correct
5 Runtime error 2060 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 19904 KB Output is correct
2 Correct 31 ms 19908 KB Output is correct
3 Correct 31 ms 19920 KB Output is correct
4 Correct 1878 ms 889144 KB Output is correct
5 Runtime error 1943 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 19904 KB Output is correct
2 Correct 31 ms 19908 KB Output is correct
3 Correct 31 ms 19920 KB Output is correct
4 Correct 1878 ms 889144 KB Output is correct
5 Runtime error 1943 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 19924 KB Output is correct
2 Correct 31 ms 19900 KB Output is correct
3 Runtime error 2069 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -