oj.uz

Submission #973670

# Submission time Handle Problem Language Result Execution time Memory
973670 2024-05-02T09:26:20 Z Syrius Rainforest Jumps (APIO21_jumps) C++14
44 / 100
 4000 ms 54328 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 temp = (root -> query(a , b , h[d])).ff;
	if (temp == -1) return -1;

	int ret = inf;
	for (int i = c; i <= d; i++) {
		ret = min(ret , func(inv[temp] , i));
	}
	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

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4046 ms 48176 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 31064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 31064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 31064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory 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 188 ms 41192 KB Output is correct
5 Correct 759 ms 53448 KB Output is correct
6 Correct 434 ms 34888 KB Output is correct
7 Correct 719 ms 53584 KB Output is correct
8 Correct 392 ms 38864 KB Output is correct
9 Correct 727 ms 53632 KB Output is correct
10 Correct 807 ms 52696 KB Output is correct
11 Correct 959 ms 53368 KB Output is correct
12 Correct 779 ms 52932 KB Output is correct
13 Correct 798 ms 53456 KB Output is correct
14 Correct 872 ms 54084 KB Output is correct
15 Correct 691 ms 54068 KB Output is correct
16 Correct 679 ms 54068 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 5 ms 31064 KB Output is correct
22 Correct 4 ms 31064 KB Output is correct
23 Correct 5 ms 31064 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 31076 KB Output is correct
27 Correct 13 ms 31408 KB Output is correct
28 Correct 19 ms 31320 KB Output is correct
29 Correct 16 ms 31424 KB Output is correct
30 Correct 14 ms 31320 KB Output is correct
31 Correct 12 ms 31320 KB Output is correct
32 Correct 4 ms 31224 KB Output is correct
33 Correct 29 ms 43908 KB Output is correct
34 Correct 51 ms 53448 KB Output is correct
35 Correct 40 ms 52928 KB Output is correct
36 Correct 55 ms 53464 KB Output is correct
37 Correct 45 ms 54064 KB Output is correct
38 Correct 39 ms 54092 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory 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 188 ms 41192 KB Output is correct
5 Correct 759 ms 53448 KB Output is correct
6 Correct 434 ms 34888 KB Output is correct
7 Correct 719 ms 53584 KB Output is correct
8 Correct 392 ms 38864 KB Output is correct
9 Correct 727 ms 53632 KB Output is correct
10 Correct 807 ms 52696 KB Output is correct
11 Correct 959 ms 53368 KB Output is correct
12 Correct 779 ms 52932 KB Output is correct
13 Correct 798 ms 53456 KB Output is correct
14 Correct 872 ms 54084 KB Output is correct
15 Correct 691 ms 54068 KB Output is correct
16 Correct 679 ms 54068 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 5 ms 31064 KB Output is correct
22 Correct 4 ms 31064 KB Output is correct
23 Correct 5 ms 31064 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 31076 KB Output is correct
27 Correct 13 ms 31408 KB Output is correct
28 Correct 19 ms 31320 KB Output is correct
29 Correct 16 ms 31424 KB Output is correct
30 Correct 14 ms 31320 KB Output is correct
31 Correct 12 ms 31320 KB Output is correct
32 Correct 4 ms 31224 KB Output is correct
33 Correct 29 ms 43908 KB Output is correct
34 Correct 51 ms 53448 KB Output is correct
35 Correct 40 ms 52928 KB Output is correct
36 Correct 55 ms 53464 KB Output is correct
37 Correct 45 ms 54064 KB Output is correct
38 Correct 39 ms 54092 KB Output is correct
39 Correct 3 ms 31064 KB Output is correct
40 Correct 4 ms 31064 KB Output is correct
41 Correct 4 ms 31212 KB Output is correct
42 Correct 185 ms 41516 KB Output is correct
43 Correct 775 ms 53644 KB Output is correct
44 Correct 444 ms 34904 KB Output is correct
45 Correct 832 ms 53584 KB Output is correct
46 Correct 405 ms 38868 KB Output is correct
47 Correct 736 ms 53456 KB Output is correct
48 Correct 777 ms 52820 KB Output is correct
49 Correct 930 ms 53456 KB Output is correct
50 Correct 811 ms 52936 KB Output is correct
51 Correct 792 ms 53816 KB Output is correct
52 Correct 797 ms 54216 KB Output is correct
53 Correct 631 ms 54072 KB Output is correct
54 Correct 655 ms 54328 KB Output is correct
55 Correct 5 ms 31064 KB Output is correct
56 Correct 92 ms 53536 KB Output is correct
57 Correct 784 ms 53400 KB Output is correct
58 Correct 338 ms 35160 KB Output is correct
59 Correct 735 ms 53448 KB Output is correct
60 Correct 308 ms 39120 KB Output is correct
61 Correct 703 ms 53432 KB Output is correct
62 Correct 854 ms 52672 KB Output is correct
63 Correct 923 ms 53196 KB Output is correct
64 Correct 875 ms 53196 KB Output is correct
65 Correct 768 ms 53700 KB Output is correct
66 Correct 856 ms 54064 KB Output is correct
67 Correct 668 ms 54084 KB Output is correct
68 Correct 671 ms 54000 KB Output is correct
69 Correct 5 ms 31064 KB Output is correct
70 Correct 4 ms 31064 KB Output is correct
71 Correct 5 ms 31064 KB Output is correct
72 Correct 4 ms 31064 KB Output is correct
73 Correct 4 ms 31064 KB Output is correct
74 Correct 4 ms 31064 KB Output is correct
75 Correct 4 ms 31064 KB Output is correct
76 Correct 3 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 4 ms 31236 KB Output is correct
81 Correct 5 ms 31064 KB Output is correct
82 Correct 5 ms 31064 KB Output is correct
83 Correct 4 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 15 ms 31320 KB Output is correct
88 Correct 12 ms 31320 KB Output is correct
89 Correct 17 ms 31320 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 15 ms 31428 KB Output is correct
94 Correct 15 ms 31320 KB Output is correct
95 Correct 13 ms 31320 KB Output is correct
96 Correct 12 ms 31320 KB Output is correct
97 Correct 12 ms 31320 KB Output is correct
98 Correct 4 ms 31060 KB Output is correct
99 Correct 50 ms 53448 KB Output is correct
100 Correct 48 ms 53460 KB Output is correct
101 Correct 41 ms 53192 KB Output is correct
102 Correct 47 ms 53436 KB Output is correct
103 Correct 39 ms 54012 KB Output is correct
104 Correct 49 ms 54064 KB Output is correct
105 Correct 4 ms 31060 KB Output is correct
106 Correct 34 ms 43908 KB Output is correct
107 Correct 49 ms 53460 KB Output is correct
108 Correct 43 ms 53164 KB Output is correct
109 Correct 46 ms 53452 KB Output is correct
110 Correct 38 ms 54192 KB Output is correct
111 Correct 43 ms 54084 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31064 KB Output is correct
2 Correct 4 ms 31064 KB Output is correct
3 Execution timed out 4046 ms 48176 KB Time limit exceeded
4 Halted 0 ms 0 KB -