oj.uz

Submission #567243

# Submission time Handle Problem Language Result Execution time Memory
567243 2022-05-23T09:42:25 Z amunduzbaev Rainforest Jumps (APIO21_jumps) C++17
8 / 100
 4000 ms 1048576 KB 
#include "jumps.h"

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

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

const int B = 700;
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/B][N];
int lx[N], rx[N];

struct ST{
	int tree[1 << (lg + 1)], b;
	void build(int lx = 0, int rx = N - 1, int x = 1){
		if(lx == rx) { tree[x] = pre[b][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];

 
struct ST2{
	//~ vector<int> tree[N << 2];
	int mx[N << 2];
	void build(int lx = 0, int rx = N - 1, int x = 1){
		if(lx == rx) { mx[x] = h[lx]; return; }
		int m = (lx + rx) >> 1;
		build(lx, m, x << 1);
		build(m + 1, rx, x << 1 | 1);
		//~ tree[x].insert(tree[x].end(), tree[x<<1].begin(), tree[x<<1].end());
		//~ tree[x].insert(tree[x].end(), tree[x<<1|1].begin(), tree[x<<1|1].end());
		//~ sort(tree[x].begin(), tree[x].end());
		mx[x] = max(mx[x<<1], mx[x<<1|1]);
	}
	
	int get_(int l, int r, int v, int lx = 0, int rx = N - 1, int x = 1){
		if(lx > r || rx < l) return -1;
		if(lx >= l && rx <= r){
			if(mx[x] <= v) return -1;
			if(lx == rx) return lx;
			int m = (lx + rx) >> 1;
			if(mx[x << 1 | 1] > v) return get_(l, r, v, m + 1, rx, x<<1 | 1);
			else return get_(l, r, v, lx, m, x << 1);
		} int m = (lx + rx) >> 1;
		int R = get_(l, r, v, m + 1, rx, x << 1 | 1);
		if(~R) return R;
		return get_(l, r, v, lx, m, x << 1);
	}
	
	int get(int l, int r, int lx = 0, int rx = N - 1, int x = 1){
		if(lx > r || rx < l) return -1;
		if(lx >= l && rx <= r) return mx[x];
		int m = (lx + rx) >> 1;
		return max(get(l, r, lx, m, x<<1), get(l, r, m+1, rx, x<<1|1));
	}
}tt;

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];
	}
	tt.build();
	
	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[b], 127, sizeof pre[b]);
		queue<int> q;
		for(int i=0;b * B + i<n;i++){
			q.push(b * B + i);
			pre[b][b * B + i] = 0;
		}
		
		while(!q.empty()){
			int u = q.front(); q.pop();
			for(auto x : edges[u]){
				if(pre[b][x] > pre[b][u] + 1){
					pre[b][x] = pre[b][u] + 1;
					q.push(x);
				}
			}
		}
		tree[b].b = b;
		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 8 ms 9936 KB Output is correct
2 Correct 7 ms 9936 KB Output is correct
3 Correct 1789 ms 697708 KB Output is correct
4 Execution timed out 4101 ms 870576 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9936 KB Output is correct
2 Correct 7 ms 9936 KB Output is correct
3 Correct 7 ms 9860 KB Output is correct
4 Correct 7 ms 9936 KB Output is correct
5 Correct 10 ms 9936 KB Output is correct
6 Correct 10 ms 9936 KB Output is correct
7 Correct 9 ms 9936 KB Output is correct
8 Correct 9 ms 9876 KB Output is correct
9 Correct 7 ms 9936 KB Output is correct
10 Correct 9 ms 9936 KB Output is correct
11 Correct 10 ms 9936 KB Output is correct
12 Correct 8 ms 9936 KB Output is correct
13 Correct 9 ms 9936 KB Output is correct
14 Correct 9 ms 9936 KB Output is correct
15 Correct 9 ms 9936 KB Output is correct
16 Correct 9 ms 9976 KB Output is correct
17 Correct 9 ms 9936 KB Output is correct
18 Correct 6 ms 9936 KB Output is correct
19 Correct 7 ms 9936 KB Output is correct
20 Correct 7 ms 9936 KB Output is correct
21 Correct 8 ms 9936 KB Output is correct
22 Correct 9 ms 9936 KB Output is correct
23 Correct 8 ms 9936 KB Output is correct
24 Correct 9 ms 9936 KB Output is correct
25 Correct 7 ms 9936 KB Output is correct
26 Correct 7 ms 9936 KB Output is correct
27 Correct 8 ms 9888 KB Output is correct
28 Correct 9 ms 9936 KB Output is correct
29 Correct 11 ms 9936 KB Output is correct
30 Correct 8 ms 9936 KB Output is correct
31 Correct 9 ms 9936 KB Output is correct
32 Correct 10 ms 9936 KB Output is correct
33 Correct 6 ms 9936 KB Output is correct
34 Correct 6 ms 9936 KB Output is correct
35 Correct 6 ms 9936 KB Output is correct
36 Correct 8 ms 9936 KB Output is correct
37 Correct 7 ms 9996 KB Output is correct
38 Correct 10 ms 9936 KB Output is correct
39 Correct 9 ms 9896 KB Output is correct
40 Correct 7 ms 9936 KB Output is correct
41 Correct 8 ms 9936 KB Output is correct
42 Correct 8 ms 9936 KB Output is correct
43 Correct 7 ms 9936 KB Output is correct
44 Correct 8 ms 9936 KB Output is correct
45 Correct 9 ms 9872 KB Output is correct
46 Correct 8 ms 9936 KB Output is correct
47 Correct 7 ms 9936 KB Output is correct
48 Correct 8 ms 9936 KB Output is correct
49 Correct 8 ms 9936 KB Output is correct
50 Correct 9 ms 9936 KB Output is correct
51 Correct 9 ms 9936 KB Output is correct
52 Correct 13 ms 9936 KB Output is correct
53 Correct 12 ms 9936 KB Output is correct
54 Correct 9 ms 9896 KB Output is correct
55 Correct 10 ms 9936 KB Output is correct
56 Correct 10 ms 9936 KB Output is correct
57 Correct 6 ms 9936 KB Output is correct
58 Correct 23 ms 15952 KB Output is correct
59 Correct 27 ms 16080 KB Output is correct
60 Correct 13 ms 12924 KB Output is correct
61 Correct 26 ms 16080 KB Output is correct
62 Correct 17 ms 9936 KB Output is correct
63 Incorrect 27 ms 16080 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9936 KB Output is correct
2 Correct 7 ms 9936 KB Output is correct
3 Correct 8 ms 9936 KB Output is correct
4 Correct 7 ms 9936 KB Output is correct
5 Correct 1266 ms 701408 KB Output is correct
6 Correct 1573 ms 866732 KB Output is correct
7 Correct 498 ms 450672 KB Output is correct
8 Incorrect 1902 ms 867008 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9876 KB Output is correct
2 Correct 7 ms 9844 KB Output is correct
3 Correct 7 ms 9936 KB Output is correct
4 Correct 562 ms 402212 KB Output is correct
5 Runtime error 2139 ms 1048576 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9876 KB Output is correct
2 Correct 7 ms 9844 KB Output is correct
3 Correct 7 ms 9936 KB Output is correct
4 Correct 562 ms 402212 KB Output is correct
5 Runtime error 2139 ms 1048576 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9936 KB Output is correct
2 Correct 7 ms 9936 KB Output is correct
3 Correct 1789 ms 697708 KB Output is correct
4 Execution timed out 4101 ms 870576 KB Time limit exceeded
5 Halted 0 ms 0 KB -