oj.uz

답안 #973680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973680 2024-05-02T09:33:45 Z Syrius 밀림 점프 (APIO21_jumps) C++14
44 / 100
 4000 ms 54228 KB 
#include <bits/stdc++.h>
#include "jumps.h"
using namespace std;

// #define int long long
#define ll long long
#define ff first
#define ss second
#define pint pair < int , int >
#define fast ios_base::sync_with_stdio(NULL); cin.tie(NULL)
typedef vector < int > vint;

const int inf = 1e9 + 9;
const int mxn = 2e5 + 5;
const int mod = 1e9 + 7;

int n;
int h[mxn] , le[mxn] , ri[mxn];
int inv[mxn];
int spx[19][mxn] , spn[19][mxn];

vint v;

struct node {

	int tl , tm , tr;
	int mx;
	node *left , *right;

	node (int l , int r) {
		tl = l , tr = r , tm = (l + r) / 2;
		mx = 0;
		left = right = NULL;
	}

	void build() {
		if (tl == tr) {
			mx = h[tl];
			return;
		}
		left = new node(tl , tm);
		right = new node(tm+1 , tr);
		left -> build();
		right -> build();
		mx = max(left -> mx , right -> mx);
	}

	pint query(int l , int r , int x) {
		if (tl == tr) {
			if (mx > x) return {-1 , 0};
			return {mx , 1};
		}
		if (tl == l && tr == r) {
			if (mx < x) return {mx , 1};
			pint pr = right -> query(tm+1 , r , x);
			if (pr.ss == 0) return pr;
			pint pl = left -> query(tl , tm , x);
			return {max(pl.ff , pr.ff) , 0};
		}
		if (r <= tm) return left -> query(l , r , x);
		if (l > tm) return right -> query(l , r , x);

		pint pr = right -> query(tm+1 , r , x);
		if (pr.ss == 0) return pr;
		pint pl = left -> query(l , tm , x);
		return {max(pl.ff , pr.ff) , pl.ss};
	}

} *root;

void init(int N , vint H) {
	n = N;
	for (int i = 0; i < n; i++) {
		h[i] = H[i];
		inv[h[i]] = i;
	}

	root = new node(0 , n-1);
	root -> build();

	for (int i = 0; i < n; i++) {
		while (v.size() > 0 && v.back() < h[i]) {
			ri[v.back()] = h[i];
			v.pop_back();
		}
		if (v.size() > 0) le[h[i]] = v.back();
		v.push_back(h[i]);
	}

	for (int i = 0; i < n; i++) {
		spx[0][h[i]] = max(le[h[i]] , ri[h[i]]);
		spn[0][h[i]] = min(le[h[i]] , ri[h[i]]);
		if (spn[0][h[i]] == 0) spn[0][h[i]] = spx[0][h[i]];
	}

	for (int j = 1; j < 19; j++) {
		for (int i = 0; i < n; i++) {
			spx[j][h[i]] = spx[j-1][spx[j-1][h[i]]];
			spn[j][h[i]] = spn[j-1][spn[j-1][h[i]]];
		}
	}
}

int func(int a , int d) {
	if (h[a] > h[d]) return -1;
	int dis = 0;
	for (int i = 18; i >= 0; i--) {
		if (spx[i][h[a]] > h[d] || spx[i][h[a]] == 0) continue;
		if (spx[i][h[a]] == h[d]) return (1 << i);
		int t = func(inv[spx[i][h[a]]] , d);
		return (t == -1) ? t : ((1<<i) + t);
	}

	for (int i = 18; i >= 0; i--) {
		if (spn[i][h[a]] > h[d] || spn[i][h[a]] == 0) continue;
		if (spn[i][h[a]] == h[d]) return (1 << i);
		int t = func(inv[spn[i][h[a]]] , d);
		return (t == -1) ? t : ((1<<i) + t);
	}

	return -1;
}

int minimum_jumps(int a , int b , int c , int d) {
	int ret = inf;
	for (int i = c; i <= d; i++) {
		int temp = (root -> query(a , b , h[i])).ff;
		if (temp == -1) continue;
		if (temp != -1) ret = min(ret , func(inv[temp] , i));
	}
	if (ret == inf) return -1;
	return ret;
}

Compilation message

jumps.cpp: In function 'int func(int, int)':
jumps.cpp:106:6: warning: unused variable 'dis' [-Wunused-variable]
  106 |  int dis = 0;
      |      ^~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4040 ms 48172 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 31064 KB Output is correct
2 Correct 5 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 4 ms 31064 KB Output is correct
5 Incorrect 4 ms 31200 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 31064 KB Output is correct
2 Correct 5 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 4 ms 31064 KB Output is correct
5 Incorrect 4 ms 31200 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 4 ms 31208 KB Output is correct
5 Incorrect 41 ms 49196 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 190 ms 41328 KB Output is correct
5 Correct 754 ms 53440 KB Output is correct
6 Correct 450 ms 34880 KB Output is correct
7 Correct 678 ms 53432 KB Output is correct
8 Correct 387 ms 38872 KB Output is correct
9 Correct 758 ms 53448 KB Output is correct
10 Correct 785 ms 52680 KB Output is correct
11 Correct 998 ms 53364 KB Output is correct
12 Correct 825 ms 52788 KB Output is correct
13 Correct 702 ms 53436 KB Output is correct
14 Correct 854 ms 54088 KB Output is correct
15 Correct 639 ms 54228 KB Output is correct
16 Correct 620 ms 54228 KB Output is correct
17 Correct 4 ms 31064 KB Output is correct
18 Correct 4 ms 31064 KB Output is correct
19 Correct 4 ms 31064 KB Output is correct
20 Correct 5 ms 31064 KB Output is correct
21 Correct 4 ms 31064 KB Output is correct
22 Correct 4 ms 31064 KB Output is correct
23 Correct 4 ms 31260 KB Output is correct
24 Correct 4 ms 31064 KB Output is correct
25 Correct 4 ms 31064 KB Output is correct
26 Correct 4 ms 31064 KB Output is correct
27 Correct 14 ms 31320 KB Output is correct
28 Correct 13 ms 31320 KB Output is correct
29 Correct 14 ms 31320 KB Output is correct
30 Correct 13 ms 31424 KB Output is correct
31 Correct 13 ms 31320 KB Output is correct
32 Correct 4 ms 31064 KB Output is correct
33 Correct 29 ms 44072 KB Output is correct
34 Correct 52 ms 53456 KB Output is correct
35 Correct 38 ms 52968 KB Output is correct
36 Correct 50 ms 53576 KB Output is correct
37 Correct 42 ms 54068 KB Output is correct
38 Correct 39 ms 54080 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Correct 4 ms 31064 KB Output is correct
4 Correct 190 ms 41328 KB Output is correct
5 Correct 754 ms 53440 KB Output is correct
6 Correct 450 ms 34880 KB Output is correct
7 Correct 678 ms 53432 KB Output is correct
8 Correct 387 ms 38872 KB Output is correct
9 Correct 758 ms 53448 KB Output is correct
10 Correct 785 ms 52680 KB Output is correct
11 Correct 998 ms 53364 KB Output is correct
12 Correct 825 ms 52788 KB Output is correct
13 Correct 702 ms 53436 KB Output is correct
14 Correct 854 ms 54088 KB Output is correct
15 Correct 639 ms 54228 KB Output is correct
16 Correct 620 ms 54228 KB Output is correct
17 Correct 4 ms 31064 KB Output is correct
18 Correct 4 ms 31064 KB Output is correct
19 Correct 4 ms 31064 KB Output is correct
20 Correct 5 ms 31064 KB Output is correct
21 Correct 4 ms 31064 KB Output is correct
22 Correct 4 ms 31064 KB Output is correct
23 Correct 4 ms 31260 KB Output is correct
24 Correct 4 ms 31064 KB Output is correct
25 Correct 4 ms 31064 KB Output is correct
26 Correct 4 ms 31064 KB Output is correct
27 Correct 14 ms 31320 KB Output is correct
28 Correct 13 ms 31320 KB Output is correct
29 Correct 14 ms 31320 KB Output is correct
30 Correct 13 ms 31424 KB Output is correct
31 Correct 13 ms 31320 KB Output is correct
32 Correct 4 ms 31064 KB Output is correct
33 Correct 29 ms 44072 KB Output is correct
34 Correct 52 ms 53456 KB Output is correct
35 Correct 38 ms 52968 KB Output is correct
36 Correct 50 ms 53576 KB Output is correct
37 Correct 42 ms 54068 KB Output is correct
38 Correct 39 ms 54080 KB Output is correct
39 Correct 4 ms 31060 KB Output is correct
40 Correct 4 ms 31064 KB Output is correct
41 Correct 4 ms 31064 KB Output is correct
42 Correct 192 ms 41572 KB Output is correct
43 Correct 760 ms 53424 KB Output is correct
44 Correct 453 ms 34900 KB Output is correct
45 Correct 779 ms 53436 KB Output is correct
46 Correct 403 ms 38740 KB Output is correct
47 Correct 695 ms 53432 KB Output is correct
48 Correct 792 ms 52664 KB Output is correct
49 Correct 985 ms 53448 KB Output is correct
50 Correct 807 ms 52928 KB Output is correct
51 Correct 735 ms 53432 KB Output is correct
52 Correct 814 ms 54084 KB Output is correct
53 Correct 648 ms 54084 KB Output is correct
54 Correct 675 ms 54080 KB Output is correct
55 Correct 4 ms 31064 KB Output is correct
56 Correct 91 ms 53452 KB Output is correct
57 Correct 732 ms 53448 KB Output is correct
58 Correct 339 ms 35160 KB Output is correct
59 Correct 787 ms 53436 KB Output is correct
60 Correct 298 ms 39140 KB Output is correct
61 Correct 743 ms 53432 KB Output is correct
62 Correct 970 ms 52812 KB Output is correct
63 Correct 957 ms 53336 KB Output is correct
64 Correct 827 ms 53180 KB Output is correct
65 Correct 793 ms 53452 KB Output is correct
66 Correct 804 ms 54100 KB Output is correct
67 Correct 725 ms 54080 KB Output is correct
68 Correct 603 ms 54068 KB Output is correct
69 Correct 4 ms 31064 KB Output is correct
70 Correct 5 ms 31064 KB Output is correct
71 Correct 5 ms 31064 KB Output is correct
72 Correct 4 ms 31204 KB Output is correct
73 Correct 5 ms 31064 KB Output is correct
74 Correct 4 ms 31064 KB Output is correct
75 Correct 5 ms 31064 KB Output is correct
76 Correct 4 ms 31064 KB Output is correct
77 Correct 4 ms 31064 KB Output is correct
78 Correct 4 ms 31064 KB Output is correct
79 Correct 5 ms 31064 KB Output is correct
80 Correct 5 ms 31064 KB Output is correct
81 Correct 5 ms 31064 KB Output is correct
82 Correct 4 ms 31064 KB Output is correct
83 Correct 5 ms 31064 KB Output is correct
84 Correct 4 ms 31064 KB Output is correct
85 Correct 5 ms 31064 KB Output is correct
86 Correct 12 ms 31320 KB Output is correct
87 Correct 14 ms 31320 KB Output is correct
88 Correct 12 ms 31320 KB Output is correct
89 Correct 16 ms 31324 KB Output is correct
90 Correct 13 ms 31320 KB Output is correct
91 Correct 4 ms 31064 KB Output is correct
92 Correct 4 ms 31064 KB Output is correct
93 Correct 13 ms 31320 KB Output is correct
94 Correct 14 ms 31320 KB Output is correct
95 Correct 13 ms 31320 KB Output is correct
96 Correct 15 ms 31320 KB Output is correct
97 Correct 14 ms 31320 KB Output is correct
98 Correct 4 ms 31064 KB Output is correct
99 Correct 56 ms 53432 KB Output is correct
100 Correct 59 ms 53688 KB Output is correct
101 Correct 37 ms 52948 KB Output is correct
102 Correct 47 ms 53456 KB Output is correct
103 Correct 39 ms 54088 KB Output is correct
104 Correct 39 ms 54084 KB Output is correct
105 Correct 4 ms 31064 KB Output is correct
106 Correct 30 ms 43896 KB Output is correct
107 Correct 55 ms 53880 KB Output is correct
108 Correct 38 ms 52916 KB Output is correct
109 Correct 48 ms 53652 KB Output is correct
110 Correct 50 ms 54064 KB Output is correct
111 Correct 39 ms 54076 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4040 ms 48172 KB Time limit exceeded
4 Halted 0 ms 0 KB -