oj.uz

Submission #413377

# Submission time Handle Problem Language Result Execution time Memory
413377 2021-05-28T15:27:52 Z keta_tsimakuridze Rainforest Jumps (APIO21_jumps) C++14
48 / 100
 1540 ms 49436 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define pii pair<int,int>
 
using namespace std;
const int N = 2e5+5;
int r[N],l[N],n,dist[N],F,ans,aft[2][N][20],Lg,a[N],tree[4*N],idx[N];
vector<int>V[N];
void build(int u,int l,int r){
	if(l==r) {
		tree[u] = a[l];
		return;
	}
	int mid=(l+r)/2;
	build(2*u,l,mid);
	build(2*u+1,mid+1,r);
	tree[u] = max(tree[2*u],tree[2*u+1]);
}
int getans(int u,int start,int end,int l,int r){
	if(l>end || r<start) return 0;
	if(start<=l && r<=end) return tree[u];
	int mid = (l+r)/2;
	return max(getans(2*u,start,end,l,mid),getans(2*u+1,start,end,mid+1,r));
}
void init(int NN, std::vector<int> H) {
	n=NN;
	for(int i=0;i<n;i++){
		aft[0][i][0] = -1;
		aft[1][i][0] = -1;
		a[i]=H[i];
		idx[a[i]] = i;
		int x = i-1;
		if(H[i]!=i+1) F=1;
		while(x>=0 && H[x]<=H[i]) x = l[x];
		l[i] = x;
		if(x>=0) V[i].push_back(x);
	}
	build(1,0,n-1);
	for(int i=n-1;i>=0;i--){
		int x = i+1;
		while(x<n && H[x]<H[i]) x = r[x];
		r[i] = x;
		if(x<n) V[i].push_back(x);
		if(r[i]<n && l[i]>=0) {
			aft[1][i][0] = r[i];
			aft[0][i][0] = l[i];
			if(H[r[i]] < H[l[i]]) swap(aft[1][i][0],aft[0][i][0]);
		}
		else if(r[i]<n) {
			aft[1][i][0] = r[i];
		}
		else if(l[i]>=0){
			aft[1][i][0] = l[i];
		}
	//	cout<<i<<"__"<<aft[0][i][0]<<" "<<aft[1][i][0]<<endl;
	}
	Lg = log2(n)+1;
	for(int f=0;f<2;f++){
		for(int j=1;j<=Lg;j++)
		for(int i=0;i<n;i++) {
			if(aft[f][i][j-1]==-1) aft[f][i][j] = -1;
			else aft[f][i][j]=aft[f][aft[f][i][j-1]][j-1];
		}
	}
}
int Up(int u,int f,int b,int c,int d){ 
	for(int i=Lg;i>=0;i--){
		if(u>=c && u<=d) return u;
		if(aft[f][u][i]!=-1 && a[aft[f][u][i]] <= b ) ans += (1<<i),u=aft[f][u][i];
	}
	return u;
}
int minimum_jumps(int A, int B, int C, int D) {
	if(!F) {
		if(A>D ) return -1;
		if(B<=C) return C-B;
		return 0;
	}
	else { int c=C,d=D;
	if(!(B<C || D<A)) return 0;
		C  = idx[getans(1,C,D,0,n-1)];
		D = C;
		ans = 0;
		if(A<=C && C<=B) return 0;
		if(B<C) {
			if(l[D] >= B) return -1;
			A = getans(1,max(A,l[D]+1),B,0,n-1);
		}
		else  {
			if(r[D] <= A) return -1;
			A= getans(1,A,min(B,r[D]-1),0,n-1);
		}
		A = idx[A];
	//	cout<<ans<<endl;
	int x = Up(Up(A,1,a[C],c,d),0,a[C],c,d) ;
		if(x>=c && x<=d) return ans;
		return -1;
	}
 
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 227 ms 40704 KB Output is correct
4 Correct 1179 ms 49320 KB Output is correct
5 Correct 1104 ms 27200 KB Output is correct
6 Correct 1214 ms 49312 KB Output is correct
7 Correct 797 ms 35824 KB Output is correct
8 Correct 1126 ms 49344 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Incorrect 6 ms 4936 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 3 ms 4936 KB Output is correct
5 Incorrect 6 ms 4936 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4988 KB Output is correct
2 Correct 4 ms 4936 KB Output is correct
3 Correct 4 ms 4936 KB Output is correct
4 Correct 5 ms 4936 KB Output is correct
5 Correct 111 ms 41072 KB Output is correct
6 Correct 156 ms 49436 KB Output is correct
7 Correct 56 ms 27640 KB Output is correct
8 Correct 132 ms 49216 KB Output is correct
9 Correct 16 ms 11592 KB Output is correct
10 Correct 150 ms 49196 KB Output is correct
11 Correct 117 ms 49332 KB Output is correct
12 Incorrect 119 ms 49196 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5012 KB Output is correct
2 Correct 3 ms 4996 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 382 ms 25312 KB Output is correct
5 Correct 1343 ms 49296 KB Output is correct
6 Correct 910 ms 12500 KB Output is correct
7 Correct 1177 ms 49312 KB Output is correct
8 Correct 640 ms 20544 KB Output is correct
9 Correct 1276 ms 49272 KB Output is correct
10 Correct 1046 ms 49216 KB Output is correct
11 Correct 1268 ms 49312 KB Output is correct
12 Correct 1014 ms 49216 KB Output is correct
13 Correct 903 ms 49216 KB Output is correct
14 Correct 1389 ms 49312 KB Output is correct
15 Correct 1131 ms 49280 KB Output is correct
16 Correct 1042 ms 49360 KB Output is correct
17 Correct 4 ms 4936 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 5 ms 5000 KB Output is correct
20 Correct 6 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 5064 KB Output is correct
24 Correct 5 ms 5064 KB Output is correct
25 Correct 4 ms 5064 KB Output is correct
26 Correct 4 ms 5192 KB Output is correct
27 Correct 14 ms 5448 KB Output is correct
28 Correct 31 ms 5476 KB Output is correct
29 Correct 37 ms 5448 KB Output is correct
30 Correct 27 ms 5448 KB Output is correct
31 Correct 29 ms 5448 KB Output is correct
32 Correct 4 ms 4936 KB Output is correct
33 Correct 75 ms 30416 KB Output is correct
34 Correct 135 ms 49368 KB Output is correct
35 Correct 122 ms 49264 KB Output is correct
36 Correct 131 ms 49276 KB Output is correct
37 Correct 146 ms 49272 KB Output is correct
38 Correct 119 ms 49216 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5012 KB Output is correct
2 Correct 3 ms 4996 KB Output is correct
3 Correct 3 ms 4936 KB Output is correct
4 Correct 382 ms 25312 KB Output is correct
5 Correct 1343 ms 49296 KB Output is correct
6 Correct 910 ms 12500 KB Output is correct
7 Correct 1177 ms 49312 KB Output is correct
8 Correct 640 ms 20544 KB Output is correct
9 Correct 1276 ms 49272 KB Output is correct
10 Correct 1046 ms 49216 KB Output is correct
11 Correct 1268 ms 49312 KB Output is correct
12 Correct 1014 ms 49216 KB Output is correct
13 Correct 903 ms 49216 KB Output is correct
14 Correct 1389 ms 49312 KB Output is correct
15 Correct 1131 ms 49280 KB Output is correct
16 Correct 1042 ms 49360 KB Output is correct
17 Correct 4 ms 4936 KB Output is correct
18 Correct 3 ms 4936 KB Output is correct
19 Correct 5 ms 5000 KB Output is correct
20 Correct 6 ms 5064 KB Output is correct
21 Correct 6 ms 5064 KB Output is correct
22 Correct 6 ms 5064 KB Output is correct
23 Correct 6 ms 5064 KB Output is correct
24 Correct 5 ms 5064 KB Output is correct
25 Correct 4 ms 5064 KB Output is correct
26 Correct 4 ms 5192 KB Output is correct
27 Correct 14 ms 5448 KB Output is correct
28 Correct 31 ms 5476 KB Output is correct
29 Correct 37 ms 5448 KB Output is correct
30 Correct 27 ms 5448 KB Output is correct
31 Correct 29 ms 5448 KB Output is correct
32 Correct 4 ms 4936 KB Output is correct
33 Correct 75 ms 30416 KB Output is correct
34 Correct 135 ms 49368 KB Output is correct
35 Correct 122 ms 49264 KB Output is correct
36 Correct 131 ms 49276 KB Output is correct
37 Correct 146 ms 49272 KB Output is correct
38 Correct 119 ms 49216 KB Output is correct
39 Correct 4 ms 4936 KB Output is correct
40 Correct 4 ms 4936 KB Output is correct
41 Correct 4 ms 4936 KB Output is correct
42 Correct 384 ms 25288 KB Output is correct
43 Correct 1185 ms 49292 KB Output is correct
44 Correct 896 ms 12488 KB Output is correct
45 Correct 1032 ms 49264 KB Output is correct
46 Correct 602 ms 20500 KB Output is correct
47 Correct 1135 ms 49316 KB Output is correct
48 Correct 1267 ms 49384 KB Output is correct
49 Correct 1317 ms 49344 KB Output is correct
50 Correct 1056 ms 49308 KB Output is correct
51 Correct 1280 ms 49308 KB Output is correct
52 Correct 1420 ms 49292 KB Output is correct
53 Correct 1260 ms 49412 KB Output is correct
54 Correct 1232 ms 49272 KB Output is correct
55 Correct 3 ms 4936 KB Output is correct
56 Correct 178 ms 49148 KB Output is correct
57 Correct 1059 ms 49336 KB Output is correct
58 Correct 557 ms 12952 KB Output is correct
59 Correct 1214 ms 49216 KB Output is correct
60 Correct 493 ms 21056 KB Output is correct
61 Correct 1261 ms 49216 KB Output is correct
62 Correct 1057 ms 49344 KB Output is correct
63 Correct 1540 ms 49312 KB Output is correct
64 Correct 1032 ms 49216 KB Output is correct
65 Correct 1031 ms 49292 KB Output is correct
66 Correct 1391 ms 49272 KB Output is correct
67 Correct 1101 ms 49312 KB Output is correct
68 Correct 1129 ms 49272 KB Output is correct
69 Correct 4 ms 4936 KB Output is correct
70 Correct 4 ms 4936 KB Output is correct
71 Correct 6 ms 5064 KB Output is correct
72 Correct 5 ms 5064 KB Output is correct
73 Correct 5 ms 5064 KB Output is correct
74 Correct 7 ms 5064 KB Output is correct
75 Correct 5 ms 5064 KB Output is correct
76 Correct 4 ms 4936 KB Output is correct
77 Correct 3 ms 4936 KB Output is correct
78 Correct 5 ms 4936 KB Output is correct
79 Correct 7 ms 5064 KB Output is correct
80 Correct 7 ms 5064 KB Output is correct
81 Correct 6 ms 5064 KB Output is correct
82 Correct 7 ms 5064 KB Output is correct
83 Correct 6 ms 5064 KB Output is correct
84 Correct 4 ms 5064 KB Output is correct
85 Correct 8 ms 5064 KB Output is correct
86 Correct 29 ms 5448 KB Output is correct
87 Correct 31 ms 5448 KB Output is correct
88 Correct 37 ms 5448 KB Output is correct
89 Correct 30 ms 5448 KB Output is correct
90 Correct 29 ms 5448 KB Output is correct
91 Correct 4 ms 5064 KB Output is correct
92 Correct 4 ms 5192 KB Output is correct
93 Correct 31 ms 5448 KB Output is correct
94 Correct 29 ms 5448 KB Output is correct
95 Correct 24 ms 5448 KB Output is correct
96 Correct 31 ms 5384 KB Output is correct
97 Correct 21 ms 5448 KB Output is correct
98 Correct 3 ms 4936 KB Output is correct
99 Correct 151 ms 49244 KB Output is correct
100 Correct 138 ms 49308 KB Output is correct
101 Correct 116 ms 49344 KB Output is correct
102 Correct 134 ms 49284 KB Output is correct
103 Correct 159 ms 49296 KB Output is correct
104 Correct 118 ms 49216 KB Output is correct
105 Correct 4 ms 4936 KB Output is correct
106 Correct 75 ms 30400 KB Output is correct
107 Correct 155 ms 49404 KB Output is correct
108 Correct 129 ms 49296 KB Output is correct
109 Correct 141 ms 49296 KB Output is correct
110 Correct 145 ms 49308 KB Output is correct
111 Correct 122 ms 49264 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4936 KB Output is correct
2 Correct 3 ms 4936 KB Output is correct
3 Correct 227 ms 40704 KB Output is correct
4 Correct 1179 ms 49320 KB Output is correct
5 Correct 1104 ms 27200 KB Output is correct
6 Correct 1214 ms 49312 KB Output is correct
7 Correct 797 ms 35824 KB Output is correct
8 Correct 1126 ms 49344 KB Output is correct
9 Correct 3 ms 4936 KB Output is correct
10 Correct 3 ms 4936 KB Output is correct
11 Correct 3 ms 4936 KB Output is correct
12 Correct 3 ms 4936 KB Output is correct
13 Incorrect 6 ms 4936 KB Output isn't correct
14 Halted 0 ms 0 KB -