oj.uz

답안 #566903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566903 2022-05-23T05:51:35 Z amunduzbaev 밀림 점프 (APIO21_jumps) C++17
48 / 100
 1197 ms 79160 KB 
#include "jumps.h"

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

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

const int B = 205;
const int N = 2e5 + 5;
const int lg = 18;
int mx[N][lg], mn[N][lg], h[N], pos[N];
int lx[N], rx[N], prec[N/B][N];

struct ST{
	vector<int> tree[N << 2];
	int mx[N << 2];
	void build(int lx = 0, int rx = N, int x = 1){
		if(lx == rx) { tree[x].push_back(h[lx]), 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, 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, 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));
	}
}tree;

void init(int n, vector<int> H){
	for(int i=0;i<n;i++){
		h[i] = H[i];
		pos[h[i]] = i;
	}
	tree.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]);
		} 
		mn[i][0] = rx[i];
		mx[i][0] = lx[i];
	}
	mn[n][0] = mx[n][0] = n;
	//~ for(int i=0;i<n;i++) cout<<mn[i][0]<<" ";
	//~ cout<<"\n";
	//~ for(int i=0;i<n;i++) cout<<mx[i][0]<<" ";
	//~ cout<<"\n";
	
	for(int j=1;j<lg;j++){
		for(int i=0;i<=n;i++){
			mn[i][j] = mn[mn[i][j-1]][j-1];
			mx[i][j] = mx[mx[i][j-1]][j-1];
		}
	}
}

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 -1;
	return res;
}

int minimum_jumps(int a, int b, int c, int d) {
	int l = max(a, tree.get_(a, b, h[c]) + 1);
	if(l > b) return -1;
	a = tree.get(l, b);
	return check(pos[a], c);
	//~ int res = N;	
	//~ for(int i=c;i<=d;i++){
		//~ int L = max(a, tree.get_(a, b, h[i]) + 1);
		//~ if(L > b) continue;
		//~ int mx = b;
		//~ for(int j=b;j>=L;j--){
			//~ if(h[j] > h[mx]) mx = j;
		//~ }
		//~ res = min(res, check(mx, i));
		//~ if(mx <= b) res = min(res, check(mx, i));
	//~ }
	//~ 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
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 45700 KB Output is correct
2 Correct 92 ms 45648 KB Output is correct
3 Correct 279 ms 72236 KB Output is correct
4 Correct 1148 ms 79148 KB Output is correct
5 Correct 945 ms 62368 KB Output is correct
6 Correct 1140 ms 79048 KB Output is correct
7 Correct 918 ms 68472 KB Output is correct
8 Correct 1152 ms 79140 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 45572 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 45572 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 91 ms 45684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 45640 KB Output is correct
2 Correct 103 ms 45648 KB Output is correct
3 Correct 90 ms 45620 KB Output is correct
4 Correct 376 ms 60284 KB Output is correct
5 Correct 1000 ms 78176 KB Output is correct
6 Correct 663 ms 50684 KB Output is correct
7 Correct 976 ms 78112 KB Output is correct
8 Correct 556 ms 56572 KB Output is correct
9 Correct 991 ms 78052 KB Output is correct
10 Correct 912 ms 79020 KB Output is correct
11 Correct 1107 ms 78968 KB Output is correct
12 Correct 1093 ms 79028 KB Output is correct
13 Correct 1066 ms 78168 KB Output is correct
14 Correct 932 ms 78844 KB Output is correct
15 Correct 890 ms 79100 KB Output is correct
16 Correct 886 ms 79096 KB Output is correct
17 Correct 90 ms 45676 KB Output is correct
18 Correct 90 ms 45636 KB Output is correct
19 Correct 92 ms 45680 KB Output is correct
20 Correct 92 ms 45680 KB Output is correct
21 Correct 94 ms 45664 KB Output is correct
22 Correct 91 ms 45632 KB Output is correct
23 Correct 94 ms 45572 KB Output is correct
24 Correct 91 ms 45672 KB Output is correct
25 Correct 88 ms 45596 KB Output is correct
26 Correct 92 ms 45796 KB Output is correct
27 Correct 110 ms 45652 KB Output is correct
28 Correct 104 ms 45608 KB Output is correct
29 Correct 107 ms 45636 KB Output is correct
30 Correct 107 ms 45704 KB Output is correct
31 Correct 111 ms 45628 KB Output is correct
32 Correct 91 ms 45648 KB Output is correct
33 Correct 195 ms 64240 KB Output is correct
34 Correct 266 ms 78172 KB Output is correct
35 Correct 168 ms 79020 KB Output is correct
36 Correct 246 ms 78152 KB Output is correct
37 Correct 189 ms 78716 KB Output is correct
38 Correct 162 ms 79128 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 45640 KB Output is correct
2 Correct 103 ms 45648 KB Output is correct
3 Correct 90 ms 45620 KB Output is correct
4 Correct 376 ms 60284 KB Output is correct
5 Correct 1000 ms 78176 KB Output is correct
6 Correct 663 ms 50684 KB Output is correct
7 Correct 976 ms 78112 KB Output is correct
8 Correct 556 ms 56572 KB Output is correct
9 Correct 991 ms 78052 KB Output is correct
10 Correct 912 ms 79020 KB Output is correct
11 Correct 1107 ms 78968 KB Output is correct
12 Correct 1093 ms 79028 KB Output is correct
13 Correct 1066 ms 78168 KB Output is correct
14 Correct 932 ms 78844 KB Output is correct
15 Correct 890 ms 79100 KB Output is correct
16 Correct 886 ms 79096 KB Output is correct
17 Correct 90 ms 45676 KB Output is correct
18 Correct 90 ms 45636 KB Output is correct
19 Correct 92 ms 45680 KB Output is correct
20 Correct 92 ms 45680 KB Output is correct
21 Correct 94 ms 45664 KB Output is correct
22 Correct 91 ms 45632 KB Output is correct
23 Correct 94 ms 45572 KB Output is correct
24 Correct 91 ms 45672 KB Output is correct
25 Correct 88 ms 45596 KB Output is correct
26 Correct 92 ms 45796 KB Output is correct
27 Correct 110 ms 45652 KB Output is correct
28 Correct 104 ms 45608 KB Output is correct
29 Correct 107 ms 45636 KB Output is correct
30 Correct 107 ms 45704 KB Output is correct
31 Correct 111 ms 45628 KB Output is correct
32 Correct 91 ms 45648 KB Output is correct
33 Correct 195 ms 64240 KB Output is correct
34 Correct 266 ms 78172 KB Output is correct
35 Correct 168 ms 79020 KB Output is correct
36 Correct 246 ms 78152 KB Output is correct
37 Correct 189 ms 78716 KB Output is correct
38 Correct 162 ms 79128 KB Output is correct
39 Correct 91 ms 45680 KB Output is correct
40 Correct 89 ms 45580 KB Output is correct
41 Correct 90 ms 45696 KB Output is correct
42 Correct 350 ms 60324 KB Output is correct
43 Correct 1041 ms 78172 KB Output is correct
44 Correct 658 ms 50708 KB Output is correct
45 Correct 1008 ms 78148 KB Output is correct
46 Correct 507 ms 56604 KB Output is correct
47 Correct 1082 ms 78212 KB Output is correct
48 Correct 889 ms 79096 KB Output is correct
49 Correct 1010 ms 79028 KB Output is correct
50 Correct 1006 ms 78968 KB Output is correct
51 Correct 1075 ms 78132 KB Output is correct
52 Correct 1025 ms 78716 KB Output is correct
53 Correct 905 ms 79068 KB Output is correct
54 Correct 993 ms 79144 KB Output is correct
55 Correct 90 ms 45788 KB Output is correct
56 Correct 308 ms 78016 KB Output is correct
57 Correct 981 ms 78260 KB Output is correct
58 Correct 593 ms 51096 KB Output is correct
59 Correct 1008 ms 78056 KB Output is correct
60 Correct 464 ms 56952 KB Output is correct
61 Correct 1108 ms 78168 KB Output is correct
62 Correct 1197 ms 79040 KB Output is correct
63 Correct 1078 ms 78900 KB Output is correct
64 Correct 1012 ms 78844 KB Output is correct
65 Correct 1064 ms 78296 KB Output is correct
66 Correct 936 ms 78964 KB Output is correct
67 Correct 802 ms 79068 KB Output is correct
68 Correct 703 ms 79160 KB Output is correct
69 Correct 88 ms 45604 KB Output is correct
70 Correct 92 ms 45596 KB Output is correct
71 Correct 92 ms 45572 KB Output is correct
72 Correct 96 ms 45680 KB Output is correct
73 Correct 90 ms 45620 KB Output is correct
74 Correct 90 ms 45700 KB Output is correct
75 Correct 95 ms 45636 KB Output is correct
76 Correct 91 ms 45572 KB Output is correct
77 Correct 94 ms 45692 KB Output is correct
78 Correct 89 ms 45572 KB Output is correct
79 Correct 93 ms 45632 KB Output is correct
80 Correct 90 ms 45676 KB Output is correct
81 Correct 93 ms 45740 KB Output is correct
82 Correct 90 ms 45704 KB Output is correct
83 Correct 95 ms 45616 KB Output is correct
84 Correct 88 ms 45616 KB Output is correct
85 Correct 94 ms 45576 KB Output is correct
86 Correct 111 ms 45604 KB Output is correct
87 Correct 109 ms 45664 KB Output is correct
88 Correct 113 ms 45664 KB Output is correct
89 Correct 105 ms 45720 KB Output is correct
90 Correct 108 ms 45696 KB Output is correct
91 Correct 90 ms 45572 KB Output is correct
92 Correct 90 ms 45672 KB Output is correct
93 Correct 109 ms 45704 KB Output is correct
94 Correct 116 ms 45720 KB Output is correct
95 Correct 106 ms 45680 KB Output is correct
96 Correct 105 ms 45784 KB Output is correct
97 Correct 103 ms 45624 KB Output is correct
98 Correct 91 ms 45616 KB Output is correct
99 Correct 262 ms 78012 KB Output is correct
100 Correct 265 ms 78112 KB Output is correct
101 Correct 160 ms 78872 KB Output is correct
102 Correct 260 ms 78252 KB Output is correct
103 Correct 200 ms 78648 KB Output is correct
104 Correct 163 ms 79032 KB Output is correct
105 Correct 88 ms 45672 KB Output is correct
106 Correct 196 ms 64240 KB Output is correct
107 Correct 266 ms 78172 KB Output is correct
108 Correct 160 ms 78924 KB Output is correct
109 Correct 252 ms 78060 KB Output is correct
110 Correct 207 ms 78736 KB Output is correct
111 Correct 159 ms 79080 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 45700 KB Output is correct
2 Correct 92 ms 45648 KB Output is correct
3 Correct 279 ms 72236 KB Output is correct
4 Correct 1148 ms 79148 KB Output is correct
5 Correct 945 ms 62368 KB Output is correct
6 Correct 1140 ms 79048 KB Output is correct
7 Correct 918 ms 68472 KB Output is correct
8 Correct 1152 ms 79140 KB Output is correct
9 Incorrect 89 ms 45572 KB Output isn't correct
10 Halted 0 ms 0 KB -