oj.uz

Submission #444783

# Submission time Handle Problem Language Result Execution time Memory
444783 2021-07-15T09:25:20 Z arnold518 Rainforest Jumps (APIO21_jumps) C++17
33 / 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++;

	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 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Execution timed out 4093 ms 64368 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.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 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 3 ms 328 KB Output is correct
17 Correct 2 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 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 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 2 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 0 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 1 ms 328 KB Output is correct

Subtask #3
13.0 / 13.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 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 3 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 3 ms 328 KB Output is correct
16 Correct 3 ms 328 KB Output is correct
17 Correct 2 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 3 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 3 ms 328 KB Output is correct
24 Correct 3 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 2 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 0 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 1 ms 328 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 0 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 3 ms 328 KB Output is correct
46 Correct 3 ms 328 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 3 ms 328 KB Output is correct
50 Correct 3 ms 328 KB Output is correct
51 Correct 4 ms 328 KB Output is correct
52 Correct 4 ms 328 KB Output is correct
53 Correct 3 ms 328 KB Output is correct
54 Correct 4 ms 328 KB Output is correct
55 Correct 3 ms 328 KB Output is correct
56 Correct 3 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 25 ms 712 KB Output is correct
59 Correct 33 ms 840 KB Output is correct
60 Correct 8 ms 456 KB Output is correct
61 Correct 35 ms 840 KB Output is correct
62 Correct 13 ms 328 KB Output is correct
63 Correct 28 ms 840 KB Output is correct
64 Correct 36 ms 1096 KB Output is correct
65 Correct 42 ms 1096 KB Output is correct
66 Correct 42 ms 1096 KB Output is correct
67 Correct 38 ms 840 KB Output is correct
68 Correct 40 ms 1096 KB Output is correct
69 Correct 38 ms 1096 KB Output is correct
70 Correct 30 ms 1096 KB Output is correct
71 Correct 0 ms 328 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 3 ms 456 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 2 ms 328 KB Output is correct
76 Correct 4 ms 328 KB Output is correct
77 Correct 4 ms 328 KB Output is correct
78 Correct 0 ms 328 KB Output is correct
79 Correct 0 ms 328 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 2 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 1 ms 328 KB Output is correct
87 Correct 1 ms 328 KB Output is correct
88 Correct 1 ms 328 KB Output is correct
89 Correct 1 ms 328 KB Output is correct
90 Correct 1 ms 328 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 328 KB Output is correct
93 Correct 1 ms 328 KB Output is correct
94 Correct 6 ms 328 KB Output is correct
95 Correct 33 ms 840 KB Output is correct
96 Correct 41 ms 968 KB Output is correct
97 Correct 28 ms 840 KB Output is correct
98 Correct 42 ms 1096 KB Output is correct
99 Correct 37 ms 1096 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 2 ms 456 KB Output is correct
102 Correct 20 ms 840 KB Output is correct
103 Correct 35 ms 1096 KB Output is correct
104 Correct 23 ms 840 KB Output is correct
105 Correct 37 ms 1096 KB Output is correct
106 Correct 35 ms 1096 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 1 ms 584 KB Output is correct
109 Correct 1 ms 840 KB Output is correct
110 Correct 2 ms 1096 KB Output is correct
111 Correct 2 ms 840 KB Output is correct
112 Correct 2 ms 1096 KB Output is correct
113 Correct 2 ms 1096 KB Output is correct

Subtask #4
12.0 / 12.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 0 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 138 ms 46920 KB Output is correct
6 Correct 176 ms 57136 KB Output is correct
7 Correct 87 ms 29232 KB Output is correct
8 Correct 180 ms 57608 KB Output is correct
9 Correct 20 ms 8836 KB Output is correct
10 Correct 173 ms 56972 KB Output is correct
11 Correct 190 ms 79668 KB Output is correct
12 Correct 184 ms 73476 KB Output is correct
13 Correct 192 ms 72892 KB Output is correct
14 Correct 174 ms 56964 KB Output is correct
15 Correct 230 ms 79252 KB Output is correct
16 Correct 204 ms 79540 KB Output is correct
17 Correct 207 ms 79636 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 2 ms 840 KB Output is correct
28 Correct 2 ms 1096 KB Output is correct
29 Correct 2 ms 924 KB Output is correct
30 Correct 2 ms 1096 KB Output is correct
31 Correct 2 ms 1096 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 183 ms 56740 KB Output is correct
34 Correct 185 ms 57136 KB Output is correct
35 Correct 176 ms 74164 KB Output is correct
36 Correct 171 ms 56880 KB Output is correct
37 Correct 226 ms 79288 KB Output is correct
38 Correct 190 ms 79668 KB Output is correct
39 Correct 0 ms 328 KB Output is correct
40 Correct 101 ms 32748 KB Output is correct
41 Correct 172 ms 56768 KB Output is correct
42 Correct 178 ms 76084 KB Output is correct
43 Correct 174 ms 56768 KB Output is correct
44 Correct 230 ms 79288 KB Output is correct
45 Correct 190 ms 79668 KB Output is correct

Subtask #5
0 / 23.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 0 ms 328 KB Output is correct
4 Correct 697 ms 26288 KB Output is correct
5 Execution timed out 4021 ms 56768 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 21.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 0 ms 328 KB Output is correct
4 Correct 697 ms 26288 KB Output is correct
5 Execution timed out 4021 ms 56768 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 19.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 Execution timed out 4093 ms 64368 KB Time limit exceeded
4 Halted 0 ms 0 KB -