oj.uz

답안 #676358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676358 2022-12-30T13:16:48 Z penguin133 밀림 점프 (APIO21_jumps) C++17
39 / 100
 1115 ms 55136 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
 
int n, flag;
int X[200005], Y[200005], h[200005];
int par[20][200005], par2[20][200005];
 
struct node{
	int s,e,m, val;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e)>>1;
		if(s != e){
			l = new node(s, m);
			r = new node(m+1, e);
			val = min(l->val, r->val);
		}
		else val = h[s];
	}
	
	int find(int a, int b, int c){
		if(val > c)return -1;
		if(s == e){
			return (val <= c ? s : -1);
		}
		if(b <= m)return (l->val <= c ? l->find(a, b, c) : -1);
		else if(a > m)return (r->val <= c ? r->find(a, b, c) : -1);
		else{
			int res = -1;
			if(r->val <= c)res = max(res, r->find(m+1, b, c));
			if(res == -1 && l->val <= c)res = max(res, l->find(a, m, c));
			return res;
		}
	}
	
}*root;
 
 
void init(int N, vector<int> H){
	n = N;
	stack<int>s;
	for(int i=0;i<n;i++){
		h[i] = H[i];
		while(!s.empty() && H[s.top()] < H[i])s.pop();
		X[i] = (s.empty() ? -1 : s.top());
		s.push(i);
	}
	flag = 1;
	for(int i=0;i<n;i++)if(H[i] != i + 1)flag= 0;
	while(!s.empty())s.pop();
	for(int i=n-1;i>=0;i--){
		while(!s.empty() && H[s.top()] < H[i])s.pop();
		Y[i] = (s.empty() ? -1 : s.top());
		s.push(i);
	}
	root = new node(0, n-1);
	for(int i=0;i<n;i++){
		if(X[i] == -1 && Y[i] == -1)par[0][i] = par2[0][i] = -1;
		else if(X[i] == -1)par[0][i] = Y[i], par2[0][i] = -1;
		else if(Y[i] == -1)par[0][i] = X[i], par2[0][i] = -1;
		else par[0][i] = (H[X[i]] > H[Y[i]] ? X[i] : Y[i]), par2[0][i] = (par[0][i] == X[i] ? Y[i] : X[i]);
	}
	for(int i=1;i<=19;i++)for(int j=0;j<n;j++)par[i][j] = (par[i-1][j] == -1 ? -1 : par[i-1][par[i-1][j]]);
	for(int i=1;i<=19;i++)for(int j=0;j<n;j++)par2[i][j] = (par2[i-1][j] == -1 ? -1 : par2[i-1][par2[i-1][j]]);
}
 
int minimum_jumps(int a, int b, int c, int d){
	if(flag){
		if(a > d)return -1;
		else if(b >= c || a >= d)return 0;
		else return c-b;
	}
	if(c == d){
		int ans = 0, tmp = b;
		for(int i=19;i>=0;i--)if(par[i][tmp] != -1 && par[i][tmp] >= a && par[i][tmp] <= b && h[par[i][tmp]] <= h[c])tmp = par[i][tmp];
		for(int i=19;i>=0;i--)if(par[i][tmp] != -1 && h[par[i][tmp]] <= h[c])tmp = par[i][tmp], ans += (1 << i);
		for(int i=19;i>=0;i--)if(par2[i][tmp] != -1 && h[par2[i][tmp]] <= h[c])tmp = par2[i][tmp], ans += (1 << i);
		return (tmp == c ? ans : -1);
	}
	queue<int>q;
	int dist[n+1];
	for(int i=0;i<n;i++)dist[i] = 1e9;
	for(int i=a;i<=b;i++)dist[i] = 0, q.push(i);
	while(!q.empty()){
		int x = q.front();q.pop();
		if(X[x] != -1 && dist[X[x]] > dist[x] + 1)dist[X[x]] = dist[x] + 1, q.push(X[x]);
		if(Y[x] != -1 && dist[Y[x]] > dist[x] + 1)dist[Y[x]] = dist[x] + 1, q.push(Y[x]);
	}
	int mini = 1e9;
	for(int i=c;i<=d;i++)mini = min(mini, dist[i]);
	return (mini == 1e9 ? -1 : mini);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 112 ms 44080 KB Output is correct
4 Correct 904 ms 55092 KB Output is correct
5 Correct 894 ms 28092 KB Output is correct
6 Correct 806 ms 55136 KB Output is correct
7 Correct 758 ms 37836 KB Output is correct
8 Correct 894 ms 55112 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Incorrect 2 ms 464 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 3 ms 464 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Incorrect 2 ms 464 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 51 ms 44188 KB Output is correct
6 Correct 63 ms 54516 KB Output is correct
7 Correct 29 ms 28092 KB Output is correct
8 Correct 62 ms 55004 KB Output is correct
9 Correct 14 ms 8648 KB Output is correct
10 Correct 70 ms 54528 KB Output is correct
11 Correct 51 ms 55092 KB Output is correct
12 Correct 69 ms 54660 KB Output is correct
13 Correct 71 ms 54804 KB Output is correct
14 Correct 68 ms 54484 KB Output is correct
15 Correct 57 ms 54692 KB Output is correct
16 Correct 73 ms 54944 KB Output is correct
17 Correct 77 ms 54968 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 1 ms 976 KB Output is correct
28 Correct 1 ms 976 KB Output is correct
29 Correct 1 ms 992 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 1 ms 976 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 62 ms 54192 KB Output is correct
34 Correct 57 ms 54216 KB Output is correct
35 Correct 53 ms 54860 KB Output is correct
36 Correct 56 ms 54188 KB Output is correct
37 Correct 51 ms 54276 KB Output is correct
38 Correct 54 ms 54348 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 32 ms 31652 KB Output is correct
41 Correct 56 ms 54180 KB Output is correct
42 Correct 49 ms 54944 KB Output is correct
43 Correct 57 ms 54196 KB Output is correct
44 Correct 50 ms 54272 KB Output is correct
45 Correct 51 ms 54324 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 273 ms 25192 KB Output is correct
5 Correct 787 ms 54216 KB Output is correct
6 Correct 683 ms 9296 KB Output is correct
7 Correct 1039 ms 54216 KB Output is correct
8 Correct 656 ms 19068 KB Output is correct
9 Correct 970 ms 54216 KB Output is correct
10 Correct 964 ms 55072 KB Output is correct
11 Correct 925 ms 54332 KB Output is correct
12 Correct 1115 ms 55008 KB Output is correct
13 Correct 918 ms 54296 KB Output is correct
14 Correct 928 ms 54236 KB Output is correct
15 Correct 944 ms 54304 KB Output is correct
16 Correct 776 ms 54300 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 3 ms 592 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 20 ms 976 KB Output is correct
29 Correct 15 ms 976 KB Output is correct
30 Correct 16 ms 976 KB Output is correct
31 Correct 21 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 33 ms 31692 KB Output is correct
34 Correct 60 ms 54200 KB Output is correct
35 Correct 52 ms 54900 KB Output is correct
36 Correct 55 ms 54216 KB Output is correct
37 Correct 58 ms 54276 KB Output is correct
38 Correct 52 ms 54196 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 273 ms 25192 KB Output is correct
5 Correct 787 ms 54216 KB Output is correct
6 Correct 683 ms 9296 KB Output is correct
7 Correct 1039 ms 54216 KB Output is correct
8 Correct 656 ms 19068 KB Output is correct
9 Correct 970 ms 54216 KB Output is correct
10 Correct 964 ms 55072 KB Output is correct
11 Correct 925 ms 54332 KB Output is correct
12 Correct 1115 ms 55008 KB Output is correct
13 Correct 918 ms 54296 KB Output is correct
14 Correct 928 ms 54236 KB Output is correct
15 Correct 944 ms 54304 KB Output is correct
16 Correct 776 ms 54300 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Correct 3 ms 592 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 720 KB Output is correct
27 Correct 21 ms 976 KB Output is correct
28 Correct 20 ms 976 KB Output is correct
29 Correct 15 ms 976 KB Output is correct
30 Correct 16 ms 976 KB Output is correct
31 Correct 21 ms 976 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 33 ms 31692 KB Output is correct
34 Correct 60 ms 54200 KB Output is correct
35 Correct 52 ms 54900 KB Output is correct
36 Correct 55 ms 54216 KB Output is correct
37 Correct 58 ms 54276 KB Output is correct
38 Correct 52 ms 54196 KB Output is correct
39 Correct 0 ms 464 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 0 ms 464 KB Output is correct
42 Correct 282 ms 25140 KB Output is correct
43 Correct 955 ms 54176 KB Output is correct
44 Correct 699 ms 9424 KB Output is correct
45 Correct 962 ms 54180 KB Output is correct
46 Correct 505 ms 19188 KB Output is correct
47 Correct 959 ms 54216 KB Output is correct
48 Correct 823 ms 55076 KB Output is correct
49 Correct 784 ms 54452 KB Output is correct
50 Correct 965 ms 54956 KB Output is correct
51 Correct 866 ms 54284 KB Output is correct
52 Correct 1026 ms 54276 KB Output is correct
53 Correct 968 ms 54304 KB Output is correct
54 Correct 819 ms 54296 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Incorrect 110 ms 54180 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 464 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 112 ms 44080 KB Output is correct
4 Correct 904 ms 55092 KB Output is correct
5 Correct 894 ms 28092 KB Output is correct
6 Correct 806 ms 55136 KB Output is correct
7 Correct 758 ms 37836 KB Output is correct
8 Correct 894 ms 55112 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Correct 3 ms 464 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 3 ms 464 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 3 ms 464 KB Output is correct
23 Incorrect 2 ms 464 KB Output isn't correct
24 Halted 0 ms 0 KB -