oj.uz

Submission #489102

# Submission time Handle Problem Language Result Execution time Memory
489102 2021-11-21T07:38:12 Z cfalas Rainforest Jumps (APIO21_jumps) C++14
27 / 100
 1402 ms 89020 KB 
#include "jumps.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

int t, n;
vi a, b;

vi nl, pl;

struct nodemax{
	nodemax* L=NULL, *R=NULL;
	int val=-1;
	int valp=0;

	void update(int x, int v, int l=0, int r=n-1){
		if(l==r && l==x){
			val = v;
			valp = l;
			//cout<<l<<" "<<r<<" "<<val<<endl;
		}
		else if(l==r || l>x || r<x) return;
		else{
			if(!L) L = new nodemax();
			if(!R) R = new nodemax();
			val = -1;
			L->update(x, v, l, MID), val = max(val, L->val);
			R->update(x,v, MID+1,r), val = max(val, R->val);
			if(L->val > R->val) valp = L->valp;
			else valp = R->valp;
			//cout<<l<<" "<<r<<" "<<val<<endl;
		}
	}

	int query(int rl, int rr, int l=0, int r=n-1){
		if(rl<=l && r<=rr) return val;
		else if(rl>r || l>rr) return -1;
		else {
			if(!L) L = new nodemax();
			if(!R) R = new nodemax();
			return max(L->query(rl, rr, l, MID), R->query(rl,rr,MID+1,r));
		}
	}
	ii queryp(int rl, int rr, int l=0, int r=n-1){
		if(rl<=l && r<=rr) return {val, valp};
		else if(rl>r || l>rr) return {-1, 0};
		else {
			if(!L) L = new nodemax();
			if(!R) R = new nodemax();
			return max(L->queryp(rl, rr, l, MID), R->queryp(rl,rr,MID+1,r));
		}
	}
};
struct node{
	node* L=NULL, *R=NULL;
	int val=n;

	void update(int x, int v, int l=0, int r=n-1){
		if(l==r && l==x){
			val = v;
			//cout<<l<<" "<<r<<" "<<val<<endl;
		}
		else if(l==r || l>x || r<x) return;
		else{
			if(!L) L = new node();
			if(!R) R = new node();
			val = n;
			L->update(x, v, l, MID), val = min(val, L->val);
			R->update(x,v, MID+1,r), val = min(val, R->val);
			//cout<<l<<" "<<r<<" "<<val<<endl;
		}
	}

	int query(int rl, int rr, int l=0, int r=n-1){
		if(rl<=l && r<=rr) return val;
		else if(rl>r || l>rr) return n;
		else {
			if(!L) L = new node();
			if(!R) R = new node();
			return min(L->query(rl, rr, l, MID), R->query(rl,rr,MID+1,r));
		}
	}
};

node seg;
nodemax segm;
nodemax all;
int hi[201000][20];
int lo[201000][20];
int le[201000][20];
void init(int N, std::vector<int> H) {
	n = N;
	a.resize(n);
	nl.resize(n+1);
	pl.resize(n+1);
	FOR(i,n) a[i] = H[i], all.update(i, a[i]);
	
	FORi(i,1,n+1){
		nl[n-i] = seg.query(a[n-i], n-1);
		seg.update(a[n-i]-1, n-i);
	}
	nl[n] = n;

	FOR(i,n){
		pl[i] = segm.query(a[i], n-1);
		segm.update(a[i]-1, i);
	}
	pl[n] = n;

	FOR(i,n){
		if(nl[i]!=n && pl[i]!=-1){
			if(a[nl[i]]>a[pl[i]]) hi[i][0] = nl[i], lo[i][0] = pl[i];
			else hi[i][0] = pl[i], lo[i][0] = nl[i];
		}
		else{
			hi[i][0] = n;
			lo[i][0] = n;
			if(nl[i]!=n) lo[i][0] = nl[i];
			else if(pl[i]!=-1) lo[i][0] = pl[i];
		}

		if(hi[i][0] == -1) hi[i][0] = n;
		if(lo[i][0] == -1) lo[i][0] = n;
	}
	lo[n][0] = n;
	hi[n][0] = n;

	//FOR(i,n) cout<<hi[i][0]<<" "; cout<<" | "; FOR(i,n) cout<<lo[i][0]<<" "; cout<<endl;
	FORi(j,1,20){
		FOR(i,n+1){
			hi[i][j] = hi[hi[i][j-1]][j-1];
			lo[i][j] = lo[lo[i][j-1]][j-1];
			le[i][j] = le[le[i][j-1]][j-1];
			//cout<<hi[i][j]<<" ";
		}
		//cout<<endl;
	}
	//cout<<endl;
}

int minimum_jumps(int A, int B, int C, int D) {
	int ans=0;
	int s = all.queryp(A,B).S;

	for(int i=18;i>=0;i--){
		if(hi[s][i]!=n && a[hi[s][i]]<=a[C]) s = hi[s][i], ans+=(1<<i);
	}

	for(int i=18;i>=0;i--){
		if(lo[s][i]!=n && a[lo[s][i]]<=a[C]) s = lo[s][i], ans+=(1<<i);
	}
	if(s>=C && s<=D) return ans;
	else return -1;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 413 ms 70604 KB Output is correct
4 Correct 1267 ms 88728 KB Output is correct
5 Correct 1215 ms 44852 KB Output is correct
6 Correct 1382 ms 88764 KB Output is correct
7 Correct 1158 ms 60716 KB Output is correct
8 Correct 1375 ms 88764 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 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 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 389 ms 40720 KB Output is correct
5 Correct 1238 ms 88672 KB Output is correct
6 Correct 631 ms 14792 KB Output is correct
7 Correct 1314 ms 88768 KB Output is correct
8 Correct 614 ms 30668 KB Output is correct
9 Correct 874 ms 88768 KB Output is correct
10 Correct 1342 ms 88696 KB Output is correct
11 Correct 1233 ms 88736 KB Output is correct
12 Correct 1236 ms 88760 KB Output is correct
13 Correct 1370 ms 88764 KB Output is correct
14 Correct 1189 ms 88732 KB Output is correct
15 Correct 911 ms 88640 KB Output is correct
16 Correct 1125 ms 88868 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 3 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 2 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 23 ms 1096 KB Output is correct
28 Correct 19 ms 1096 KB Output is correct
29 Correct 18 ms 1096 KB Output is correct
30 Correct 18 ms 1096 KB Output is correct
31 Correct 21 ms 1096 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 195 ms 51640 KB Output is correct
34 Correct 375 ms 88700 KB Output is correct
35 Correct 271 ms 88732 KB Output is correct
36 Correct 355 ms 88788 KB Output is correct
37 Correct 295 ms 88732 KB Output is correct
38 Correct 298 ms 88860 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 389 ms 40720 KB Output is correct
5 Correct 1238 ms 88672 KB Output is correct
6 Correct 631 ms 14792 KB Output is correct
7 Correct 1314 ms 88768 KB Output is correct
8 Correct 614 ms 30668 KB Output is correct
9 Correct 874 ms 88768 KB Output is correct
10 Correct 1342 ms 88696 KB Output is correct
11 Correct 1233 ms 88736 KB Output is correct
12 Correct 1236 ms 88760 KB Output is correct
13 Correct 1370 ms 88764 KB Output is correct
14 Correct 1189 ms 88732 KB Output is correct
15 Correct 911 ms 88640 KB Output is correct
16 Correct 1125 ms 88868 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 3 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 2 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 23 ms 1096 KB Output is correct
28 Correct 19 ms 1096 KB Output is correct
29 Correct 18 ms 1096 KB Output is correct
30 Correct 18 ms 1096 KB Output is correct
31 Correct 21 ms 1096 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 195 ms 51640 KB Output is correct
34 Correct 375 ms 88700 KB Output is correct
35 Correct 271 ms 88732 KB Output is correct
36 Correct 355 ms 88788 KB Output is correct
37 Correct 295 ms 88732 KB Output is correct
38 Correct 298 ms 88860 KB Output is correct
39 Correct 0 ms 200 KB Output is correct
40 Correct 0 ms 200 KB Output is correct
41 Correct 0 ms 200 KB Output is correct
42 Correct 375 ms 40664 KB Output is correct
43 Correct 1402 ms 88720 KB Output is correct
44 Correct 645 ms 14884 KB Output is correct
45 Correct 1190 ms 88736 KB Output is correct
46 Correct 524 ms 30656 KB Output is correct
47 Correct 1398 ms 88768 KB Output is correct
48 Correct 1317 ms 88760 KB Output is correct
49 Correct 1263 ms 88720 KB Output is correct
50 Correct 1299 ms 88736 KB Output is correct
51 Correct 1316 ms 89020 KB Output is correct
52 Correct 1125 ms 88764 KB Output is correct
53 Correct 1047 ms 88736 KB Output is correct
54 Correct 1245 ms 88648 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Incorrect 426 ms 88480 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 413 ms 70604 KB Output is correct
4 Correct 1267 ms 88728 KB Output is correct
5 Correct 1215 ms 44852 KB Output is correct
6 Correct 1382 ms 88764 KB Output is correct
7 Correct 1158 ms 60716 KB Output is correct
8 Correct 1375 ms 88764 KB Output is correct
9 Incorrect 0 ms 200 KB Output isn't correct
10 Halted 0 ms 0 KB -