oj.uz

Submission #444784

# Submission time Handle Problem Language Result Execution time Memory
444784 2021-07-15T09:43:03 Z arnold518 Rainforest Jumps (APIO21_jumps) C++17
31 / 100
 4000 ms 79668 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

int N;
int H[MAXN+10];

struct SEG
{
	pii tree[MAXN*4+10];
	void init(int node, int tl, int tr)
	{
		if(tl==tr)
		{
			tree[node]={H[tl], tl};
			return;
		}
		int mid=tl+tr>>1;
		init(node*2, tl, mid);
		init(node*2+1, mid+1, tr);
		tree[node]=max(tree[node*2], tree[node*2+1]);
	}
	pii query(int node, int tl, int tr, int l, int r)
	{
		if(r<tl || tr<l) return pii(-1, -1);
		if(l<=tl && tr<=r) return tree[node];
		int mid=tl+tr>>1;
		return max(query(node*2, tl, mid, l, r), query(node*2+1, mid+1, tr, l, r));
	}
}seg;

int par[MAXN+10], root, dep[MAXN+10];

int f(int l, int r, int d)
{
	if(l>r) return -1;
	int pos=seg.query(1, 1, N, l, r).second;
	dep[pos]=d;
	int lc=f(l, pos-1, d+1), rc=f(pos+1, r, d+1);
	if(lc!=-1)
	{
		par[lc]=pos;
	}
	if(rc!=-1)
	{
		par[rc]=-pos;
	}
	return pos;
}

int L[MAXN+10], R[MAXN+10];
int spa1[MAXN+10][30], spa2[MAXN+10][30];

void init(int _N, vector<int> _H)
{
	N=_N;
	for(int i=1; i<=N; i++) H[i]=_H[i-1];
	seg.init(1, 1, N);
	root=f(1, N, 1);

	H[0]=H[N+1]=2147483647;

	vector<int> S;
	S.push_back(0);
	for(int i=1; i<=N; i++)
	{
		while(!S.empty() && H[S.back()]<H[i]) S.pop_back();
		L[i]=S.back();
		if(L[i]==0) L[i]=-1;
		S.push_back(i);
	}
	S.clear();
	S.push_back(N+1);
	for(int i=N; i>=1; i--)
	{
		while(!S.empty() && H[S.back()]<H[i]) S.pop_back();
		R[i]=S.back();
		if(R[i]==N+1) R[i]=-1;
		S.push_back(i);
	}

	//for(int i=1; i<=N; i++) printf("%d ", L[i]); printf("\n");
	//for(int i=1; i<=N; i++) printf("%d ", R[i]); printf("\n");
	//for(int i=1; i<=N; i++) printf("%d ", par[i]); printf("\n");
	//for(int i=1; i<=N; i++) printf("%d ", dep[i]); printf("\n");

	for(int i=1; i<=N; i++)
	{
		if(par[i]==0) continue;
		if(par[i]>0)
		{
			spa1[i][0]=R[i];
			spa2[i][0]=L[i];
		}
		else
		{
			spa1[i][0]=L[i];
			spa2[i][0]=R[i];
		}
	}
	for(int j=1; j<=20; j++) for(int i=1; i<=N; i++)
	{
		if(spa1[i][j-1]==-1) spa1[i][j]=-1;
		else spa1[i][j]=spa1[spa1[i][j-1]][j-1];

		if(spa2[i][j-1]==-1) spa2[i][j]=-1;
		else spa2[i][j]=spa2[spa2[i][j-1]][j-1];
	}
}

int solve(int A, int B)
{
	int now=A;
	int ans=0;
	for(int i=20; i>=0; i--)
	{
		if(spa2[now][i]==-1) continue;
		if(dep[spa2[now][i]]<dep[B]) continue;
		ans+=(1<<i);
		now=spa2[now][i];
	}
	for(int i=20; i>=0; i--)
	{
		if(spa1[now][i]==-1) continue;
		if(dep[spa1[now][i]]<dep[B]) continue;
		ans+=(1<<i);
		now=spa1[now][i];
	}
	if(now!=B) return -1;
	return ans;
}

int dist[MAXN+10];

int minimum_jumps(int A, int B, int C, int D)
{
	A++; B++; C++; D++;

	int ans=987654321;
	for(int i=A; i<=B; i++) for(int j=C; j<=D; j++)
	{
		int t=solve(i, j);
		if(t!=-1) ans=min(ans, t);
	}
	if(ans==987654321) ans=-1;
	return ans;

	queue<int> Q;
	for(int i=1; i<=N; i++) dist[i]=-1;
	for(int i=A; i<=B; i++) dist[i]=0, Q.push(i);
	while(!Q.empty())
	{
		int now=Q.front(); Q.pop();
		if(C<=now && now<=D) return dist[now];
		if(L[now]!=-1)
		{
			if(dist[L[now]]==-1)
			{
				Q.push(L[now]);
				dist[L[now]]=dist[now]+1;
			}
		}
		if(R[now]!=-1)
		{
			if(dist[R[now]]==-1)
			{
				Q.push(R[now]);
				dist[R[now]]=dist[now]+1;
			}
		}
	}
	return -1;
}

Compilation message

jumps.cpp: In member function 'void SEG::init(int, int, int)':
jumps.cpp:24:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |   int mid=tl+tr>>1;
      |           ~~^~~
jumps.cpp: In member function 'pii SEG::query(int, int, int, int, int)':
jumps.cpp:33:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |   int mid=tl+tr>>1;
      |           ~~^~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Execution timed out 4053 ms 64308 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 21 ms 328 KB Output is correct
7 Correct 13 ms 328 KB Output is correct
8 Correct 18 ms 328 KB Output is correct
9 Correct 4 ms 328 KB Output is correct
10 Correct 23 ms 328 KB Output is correct
11 Correct 24 ms 328 KB Output is correct
12 Correct 22 ms 328 KB Output is correct
13 Correct 21 ms 328 KB Output is correct
14 Correct 21 ms 328 KB Output is correct
15 Correct 20 ms 328 KB Output is correct
16 Correct 14 ms 328 KB Output is correct
17 Correct 7 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 5 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 0 ms 328 KB Output is correct
27 Correct 2 ms 328 KB Output is correct
28 Correct 2 ms 328 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 3 ms 328 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 2 ms 328 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 21 ms 328 KB Output is correct
7 Correct 13 ms 328 KB Output is correct
8 Correct 18 ms 328 KB Output is correct
9 Correct 4 ms 328 KB Output is correct
10 Correct 23 ms 328 KB Output is correct
11 Correct 24 ms 328 KB Output is correct
12 Correct 22 ms 328 KB Output is correct
13 Correct 21 ms 328 KB Output is correct
14 Correct 21 ms 328 KB Output is correct
15 Correct 20 ms 328 KB Output is correct
16 Correct 14 ms 328 KB Output is correct
17 Correct 7 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 5 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 0 ms 328 KB Output is correct
26 Correct 0 ms 328 KB Output is correct
27 Correct 2 ms 328 KB Output is correct
28 Correct 2 ms 328 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 3 ms 328 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 2 ms 328 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 0 ms 328 KB Output is correct
43 Correct 0 ms 328 KB Output is correct
44 Correct 2 ms 328 KB Output is correct
45 Correct 23 ms 328 KB Output is correct
46 Correct 12 ms 328 KB Output is correct
47 Correct 18 ms 328 KB Output is correct
48 Correct 3 ms 328 KB Output is correct
49 Correct 19 ms 328 KB Output is correct
50 Correct 26 ms 328 KB Output is correct
51 Correct 21 ms 328 KB Output is correct
52 Correct 22 ms 328 KB Output is correct
53 Correct 21 ms 328 KB Output is correct
54 Correct 20 ms 328 KB Output is correct
55 Correct 14 ms 328 KB Output is correct
56 Correct 6 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Execution timed out 4069 ms 712 KB Time limit exceeded
59 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Execution timed out 4062 ms 46640 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 320 ms 26296 KB Output is correct
5 Correct 1286 ms 56752 KB Output is correct
6 Correct 899 ms 9964 KB Output is correct
7 Correct 1252 ms 56976 KB Output is correct
8 Correct 823 ms 20400 KB Output is correct
9 Correct 1362 ms 56788 KB Output is correct
10 Correct 1235 ms 79668 KB Output is correct
11 Correct 1377 ms 77824 KB Output is correct
12 Correct 1484 ms 76468 KB Output is correct
13 Correct 1264 ms 56768 KB Output is correct
14 Correct 1259 ms 79160 KB Output is correct
15 Correct 1143 ms 79632 KB Output is correct
16 Correct 1137 ms 79624 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 16 ms 840 KB Output is correct
28 Correct 27 ms 1096 KB Output is correct
29 Correct 24 ms 840 KB Output is correct
30 Correct 27 ms 1096 KB Output is correct
31 Correct 29 ms 1096 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 103 ms 32860 KB Output is correct
34 Correct 179 ms 56848 KB Output is correct
35 Correct 197 ms 76180 KB Output is correct
36 Correct 179 ms 56768 KB Output is correct
37 Correct 236 ms 79284 KB Output is correct
38 Correct 184 ms 79668 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 320 ms 26296 KB Output is correct
5 Correct 1286 ms 56752 KB Output is correct
6 Correct 899 ms 9964 KB Output is correct
7 Correct 1252 ms 56976 KB Output is correct
8 Correct 823 ms 20400 KB Output is correct
9 Correct 1362 ms 56788 KB Output is correct
10 Correct 1235 ms 79668 KB Output is correct
11 Correct 1377 ms 77824 KB Output is correct
12 Correct 1484 ms 76468 KB Output is correct
13 Correct 1264 ms 56768 KB Output is correct
14 Correct 1259 ms 79160 KB Output is correct
15 Correct 1143 ms 79632 KB Output is correct
16 Correct 1137 ms 79624 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 3 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 3 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 16 ms 840 KB Output is correct
28 Correct 27 ms 1096 KB Output is correct
29 Correct 24 ms 840 KB Output is correct
30 Correct 27 ms 1096 KB Output is correct
31 Correct 29 ms 1096 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 103 ms 32860 KB Output is correct
34 Correct 179 ms 56848 KB Output is correct
35 Correct 197 ms 76180 KB Output is correct
36 Correct 179 ms 56768 KB Output is correct
37 Correct 236 ms 79284 KB Output is correct
38 Correct 184 ms 79668 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 0 ms 328 KB Output is correct
41 Correct 0 ms 328 KB Output is correct
42 Correct 394 ms 26364 KB Output is correct
43 Correct 1044 ms 56768 KB Output is correct
44 Correct 627 ms 9928 KB Output is correct
45 Correct 1104 ms 56896 KB Output is correct
46 Correct 688 ms 20428 KB Output is correct
47 Correct 1266 ms 56976 KB Output is correct
48 Correct 1450 ms 79668 KB Output is correct
49 Correct 1159 ms 77856 KB Output is correct
50 Correct 1248 ms 76556 KB Output is correct
51 Correct 1271 ms 56848 KB Output is correct
52 Correct 1360 ms 79300 KB Output is correct
53 Correct 1270 ms 79648 KB Output is correct
54 Correct 1136 ms 79668 KB Output is correct
55 Correct 0 ms 328 KB Output is correct
56 Execution timed out 4018 ms 56748 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Execution timed out 4053 ms 64308 KB Time limit exceeded
4 Halted 0 ms 0 KB -