oj.uz

Submission #567335

# Submission time Handle Problem Language Result Execution time Memory
567335 2022-05-23T10:39:04 Z amunduzbaev Rainforest Jumps (APIO21_jumps) C++17
52 / 100
 4000 ms 693384 KB 
#include "jumps.h"

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

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

const int B = 650;
const int N = 2e5 + 5;
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 << 2], b;
	void build(int lx = 0, int rx = N - 1, int x = 1){
		if(lx == rx) { tree[x] = pre[lx]; return; }
		int m = (lx + rx) >> 1;
		build(lx, m, x << 1);
		build(m + 1, rx, x << 1 | 1);
		tree[x] = min(tree[x<<1], tree[x<<1 | 1]);
	}
	
	int get(int l, int r, int lx = 0, int rx = N - 1, int x = 1){
		if(lx > r || rx < l) return N;
		if(lx >= l && rx <= r) return tree[x];
		int m = (lx + rx) >> 1;
		return min(get(l, r, lx, m, x<<1), get(l, r, m+1, rx, x<<1|1));
	}
}tree[N/B];

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<n/B;b++){
		memset(pre, 127, sizeof pre);
		queue<int> q;
		for(int i=0;b * B + i<n;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 4 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 2154 ms 552216 KB Output is correct
4 Execution timed out 4117 ms 693252 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4924 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 5020 KB Output is correct
7 Correct 6 ms 5072 KB Output is correct
8 Correct 6 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 7 ms 5072 KB Output is correct
11 Correct 7 ms 5072 KB Output is correct
12 Correct 7 ms 5072 KB Output is correct
13 Correct 5 ms 5072 KB Output is correct
14 Correct 5 ms 5072 KB Output is correct
15 Correct 6 ms 5072 KB Output is correct
16 Correct 6 ms 5072 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 5000 KB Output is correct
20 Correct 5 ms 5072 KB Output is correct
21 Correct 6 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4944 KB Output is correct
26 Correct 3 ms 4944 KB Output is correct
27 Correct 5 ms 4992 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 4 ms 5072 KB Output is correct
30 Correct 5 ms 5072 KB Output is correct
31 Correct 5 ms 5072 KB Output is correct
32 Correct 5 ms 5072 KB Output is correct
33 Correct 4 ms 4944 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 4 ms 5072 KB Output is correct
38 Correct 3 ms 5072 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4924 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 5020 KB Output is correct
7 Correct 6 ms 5072 KB Output is correct
8 Correct 6 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 7 ms 5072 KB Output is correct
11 Correct 7 ms 5072 KB Output is correct
12 Correct 7 ms 5072 KB Output is correct
13 Correct 5 ms 5072 KB Output is correct
14 Correct 5 ms 5072 KB Output is correct
15 Correct 6 ms 5072 KB Output is correct
16 Correct 6 ms 5072 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 5000 KB Output is correct
20 Correct 5 ms 5072 KB Output is correct
21 Correct 6 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 3 ms 4944 KB Output is correct
26 Correct 3 ms 4944 KB Output is correct
27 Correct 5 ms 4992 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 4 ms 5072 KB Output is correct
30 Correct 5 ms 5072 KB Output is correct
31 Correct 5 ms 5072 KB Output is correct
32 Correct 5 ms 5072 KB Output is correct
33 Correct 4 ms 4944 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 3 ms 5072 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 4 ms 5072 KB Output is correct
38 Correct 3 ms 5072 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4944 KB Output is correct
42 Correct 2 ms 4944 KB Output is correct
43 Correct 3 ms 4944 KB Output is correct
44 Correct 5 ms 4944 KB Output is correct
45 Correct 6 ms 5072 KB Output is correct
46 Correct 4 ms 5072 KB Output is correct
47 Correct 7 ms 5072 KB Output is correct
48 Correct 5 ms 5072 KB Output is correct
49 Correct 6 ms 5072 KB Output is correct
50 Correct 5 ms 5072 KB Output is correct
51 Correct 5 ms 5072 KB Output is correct
52 Correct 4 ms 5072 KB Output is correct
53 Correct 5 ms 5072 KB Output is correct
54 Correct 5 ms 5072 KB Output is correct
55 Correct 4 ms 5072 KB Output is correct
56 Correct 5 ms 5072 KB Output is correct
57 Correct 3 ms 5120 KB Output is correct
58 Correct 21 ms 10320 KB Output is correct
59 Incorrect 24 ms 12496 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 1323 ms 556360 KB Output is correct
6 Correct 1458 ms 689472 KB Output is correct
7 Correct 458 ms 355820 KB Output is correct
8 Incorrect 1987 ms 689712 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 626 ms 317680 KB Output is correct
5 Correct 2406 ms 689940 KB Output is correct
6 Correct 688 ms 117332 KB Output is correct
7 Correct 2327 ms 689916 KB Output is correct
8 Correct 716 ms 239836 KB Output is correct
9 Correct 2130 ms 689840 KB Output is correct
10 Correct 2231 ms 693280 KB Output is correct
11 Correct 2004 ms 693152 KB Output is correct
12 Correct 2408 ms 693124 KB Output is correct
13 Correct 2305 ms 690284 KB Output is correct
14 Correct 2033 ms 692052 KB Output is correct
15 Correct 1969 ms 693236 KB Output is correct
16 Correct 1671 ms 693248 KB Output is correct
17 Correct 4 ms 4944 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 7 ms 5072 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 6 ms 5072 KB Output is correct
23 Correct 17 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 8 ms 8016 KB Output is correct
27 Correct 24 ms 12480 KB Output is correct
28 Correct 25 ms 12496 KB Output is correct
29 Correct 26 ms 12584 KB Output is correct
30 Correct 31 ms 12528 KB Output is correct
31 Correct 28 ms 12472 KB Output is correct
32 Correct 3 ms 4944 KB Output is correct
33 Correct 604 ms 402460 KB Output is correct
34 Correct 1449 ms 689604 KB Output is correct
35 Correct 1251 ms 693012 KB Output is correct
36 Correct 2027 ms 690140 KB Output is correct
37 Correct 1036 ms 692000 KB Output is correct
38 Correct 870 ms 693192 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 626 ms 317680 KB Output is correct
5 Correct 2406 ms 689940 KB Output is correct
6 Correct 688 ms 117332 KB Output is correct
7 Correct 2327 ms 689916 KB Output is correct
8 Correct 716 ms 239836 KB Output is correct
9 Correct 2130 ms 689840 KB Output is correct
10 Correct 2231 ms 693280 KB Output is correct
11 Correct 2004 ms 693152 KB Output is correct
12 Correct 2408 ms 693124 KB Output is correct
13 Correct 2305 ms 690284 KB Output is correct
14 Correct 2033 ms 692052 KB Output is correct
15 Correct 1969 ms 693236 KB Output is correct
16 Correct 1671 ms 693248 KB Output is correct
17 Correct 4 ms 4944 KB Output is correct
18 Correct 3 ms 4944 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 7 ms 5072 KB Output is correct
21 Correct 5 ms 5072 KB Output is correct
22 Correct 6 ms 5072 KB Output is correct
23 Correct 17 ms 5072 KB Output is correct
24 Correct 6 ms 5072 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 8 ms 8016 KB Output is correct
27 Correct 24 ms 12480 KB Output is correct
28 Correct 25 ms 12496 KB Output is correct
29 Correct 26 ms 12584 KB Output is correct
30 Correct 31 ms 12528 KB Output is correct
31 Correct 28 ms 12472 KB Output is correct
32 Correct 3 ms 4944 KB Output is correct
33 Correct 604 ms 402460 KB Output is correct
34 Correct 1449 ms 689604 KB Output is correct
35 Correct 1251 ms 693012 KB Output is correct
36 Correct 2027 ms 690140 KB Output is correct
37 Correct 1036 ms 692000 KB Output is correct
38 Correct 870 ms 693192 KB Output is correct
39 Correct 3 ms 4944 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 3 ms 4944 KB Output is correct
42 Correct 789 ms 317636 KB Output is correct
43 Correct 2753 ms 689992 KB Output is correct
44 Correct 788 ms 117292 KB Output is correct
45 Correct 2279 ms 689924 KB Output is correct
46 Correct 773 ms 239804 KB Output is correct
47 Correct 2299 ms 689924 KB Output is correct
48 Correct 2162 ms 693176 KB Output is correct
49 Correct 2019 ms 693248 KB Output is correct
50 Correct 2223 ms 693212 KB Output is correct
51 Correct 2206 ms 690276 KB Output is correct
52 Correct 1847 ms 692060 KB Output is correct
53 Correct 1674 ms 693260 KB Output is correct
54 Correct 1814 ms 693236 KB Output is correct
55 Correct 3 ms 4944 KB Output is correct
56 Correct 1934 ms 687628 KB Output is correct
57 Correct 2544 ms 689704 KB Output is correct
58 Correct 626 ms 124032 KB Output is correct
59 Correct 2192 ms 689932 KB Output is correct
60 Correct 695 ms 248664 KB Output is correct
61 Correct 2476 ms 689472 KB Output is correct
62 Correct 2162 ms 693120 KB Output is correct
63 Correct 2003 ms 693080 KB Output is correct
64 Correct 2086 ms 692956 KB Output is correct
65 Correct 2305 ms 689620 KB Output is correct
66 Correct 1824 ms 692008 KB Output is correct
67 Correct 1619 ms 693384 KB Output is correct
68 Correct 1602 ms 693244 KB Output is correct
69 Correct 3 ms 4944 KB Output is correct
70 Correct 4 ms 4956 KB Output is correct
71 Correct 5 ms 5072 KB Output is correct
72 Correct 5 ms 5072 KB Output is correct
73 Correct 6 ms 5072 KB Output is correct
74 Correct 7 ms 5072 KB Output is correct
75 Correct 5 ms 5072 KB Output is correct
76 Correct 4 ms 4944 KB Output is correct
77 Correct 3 ms 4944 KB Output is correct
78 Correct 6 ms 4996 KB Output is correct
79 Correct 6 ms 5076 KB Output is correct
80 Correct 6 ms 5120 KB Output is correct
81 Correct 4 ms 5072 KB Output is correct
82 Correct 5 ms 5072 KB Output is correct
83 Correct 5 ms 5072 KB Output is correct
84 Correct 4 ms 5072 KB Output is correct
85 Correct 5 ms 5072 KB Output is correct
86 Correct 36 ms 12496 KB Output is correct
87 Correct 24 ms 12496 KB Output is correct
88 Correct 34 ms 12496 KB Output is correct
89 Correct 28 ms 12496 KB Output is correct
90 Correct 37 ms 12508 KB Output is correct
91 Correct 4 ms 5072 KB Output is correct
92 Correct 6 ms 8016 KB Output is correct
93 Correct 28 ms 12496 KB Output is correct
94 Correct 26 ms 12496 KB Output is correct
95 Correct 26 ms 12496 KB Output is correct
96 Correct 37 ms 12452 KB Output is correct
97 Correct 31 ms 12496 KB Output is correct
98 Correct 3 ms 4944 KB Output is correct
99 Correct 1686 ms 689916 KB Output is correct
100 Correct 1311 ms 689980 KB Output is correct
101 Correct 1073 ms 692952 KB Output is correct
102 Correct 1566 ms 690112 KB Output is correct
103 Correct 1022 ms 692000 KB Output is correct
104 Correct 776 ms 693192 KB Output is correct
105 Correct 3 ms 4944 KB Output is correct
106 Correct 575 ms 402396 KB Output is correct
107 Correct 1278 ms 689724 KB Output is correct
108 Correct 1093 ms 693140 KB Output is correct
109 Correct 1805 ms 690152 KB Output is correct
110 Correct 1029 ms 691984 KB Output is correct
111 Correct 826 ms 693308 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 2154 ms 552216 KB Output is correct
4 Execution timed out 4117 ms 693252 KB Time limit exceeded
5 Halted 0 ms 0 KB -