oj.uz

Submission #489066

# Submission time Handle Problem Language Result Execution time Memory
489066 2021-11-21T06:48:17 Z cfalas Rainforest Jumps (APIO21_jumps) C++14
23 / 100
 1223 ms 60688 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;

	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 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);
			//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));
		}
	}
};
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;
int hi[201000][20];
int lo[201000][20];
void init(int N, std::vector<int> H) {
	n = N;
	a.resize(n);
	nl.resize(n+1);
	pl.resize(n);
	FOR(i,n) a[i] = H[i];
	
	FORi(i,1,n+1){
		//cout<<endl;
		nl[n-i] = seg.query(a[n-i], n-1);
		seg.update(a[n-i]-1, n-i);
	}
	nl[n] = n;
	FOR(i,n){
		//cout<<endl;
		pl[i] = segm.query(a[i], n-1);
		segm.update(a[i]-1, i);
	}
	FOR(i,n){
		if(nl[i]!=n && (pl[i]==-1 || a[nl[i]]>a[pl[i]])) hi[i][0] = nl[i];
		else hi[i][0] = pl[i];
		if(nl[i]!=n && (pl[i]==-1 || a[nl[i]]<a[pl[i]])) lo[i][0] = nl[i];
		else 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];
			//cout<<hi[i][j]<<" ";
		}
		//cout<<endl;
	}
	//cout<<endl;
}

int minimum_jumps(int A, int B, int C, int D) {
	int s = A;
	int ans=0;
	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);
		//cout<<s<<" ";
	}
	//cout<<endl;
	//cout<<s<<" "<<ans<<endl;
	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);
		//cout<<s<<" ";
	}
	//cout<<endl;
	//cout<<s<<" "<<ans<<endl;
	if(lo[s][0]>=C && lo[s][0]<=D) return ans+1;
	if(s>=C && s<=D) return ans;
	else return -1;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 220 KB Output is correct
4 Correct 318 ms 27756 KB Output is correct
5 Correct 912 ms 60576 KB Output is correct
6 Correct 698 ms 10156 KB Output is correct
7 Correct 1200 ms 60460 KB Output is correct
8 Correct 610 ms 21052 KB Output is correct
9 Correct 1223 ms 60524 KB Output is correct
10 Correct 1059 ms 60508 KB Output is correct
11 Correct 1056 ms 60468 KB Output is correct
12 Correct 883 ms 60652 KB Output is correct
13 Correct 1046 ms 60488 KB Output is correct
14 Correct 1190 ms 60480 KB Output is correct
15 Correct 1002 ms 60496 KB Output is correct
16 Correct 1125 ms 60688 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 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 0 ms 328 KB Output is correct
26 Correct 1 ms 524 KB Output is correct
27 Correct 22 ms 840 KB Output is correct
28 Correct 9 ms 840 KB Output is correct
29 Correct 16 ms 840 KB Output is correct
30 Correct 20 ms 840 KB Output is correct
31 Correct 23 ms 840 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 160 ms 35100 KB Output is correct
34 Correct 311 ms 60464 KB Output is correct
35 Correct 212 ms 60608 KB Output is correct
36 Correct 264 ms 60480 KB Output is correct
37 Correct 223 ms 60468 KB Output is correct
38 Correct 211 ms 60628 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 220 KB Output is correct
4 Correct 318 ms 27756 KB Output is correct
5 Correct 912 ms 60576 KB Output is correct
6 Correct 698 ms 10156 KB Output is correct
7 Correct 1200 ms 60460 KB Output is correct
8 Correct 610 ms 21052 KB Output is correct
9 Correct 1223 ms 60524 KB Output is correct
10 Correct 1059 ms 60508 KB Output is correct
11 Correct 1056 ms 60468 KB Output is correct
12 Correct 883 ms 60652 KB Output is correct
13 Correct 1046 ms 60488 KB Output is correct
14 Correct 1190 ms 60480 KB Output is correct
15 Correct 1002 ms 60496 KB Output is correct
16 Correct 1125 ms 60688 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 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 0 ms 328 KB Output is correct
26 Correct 1 ms 524 KB Output is correct
27 Correct 22 ms 840 KB Output is correct
28 Correct 9 ms 840 KB Output is correct
29 Correct 16 ms 840 KB Output is correct
30 Correct 20 ms 840 KB Output is correct
31 Correct 23 ms 840 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
33 Correct 160 ms 35100 KB Output is correct
34 Correct 311 ms 60464 KB Output is correct
35 Correct 212 ms 60608 KB Output is correct
36 Correct 264 ms 60480 KB Output is correct
37 Correct 223 ms 60468 KB Output is correct
38 Correct 211 ms 60628 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 308 ms 27780 KB Output is correct
43 Correct 863 ms 60480 KB Output is correct
44 Correct 610 ms 10132 KB Output is correct
45 Correct 1096 ms 60576 KB Output is correct
46 Correct 531 ms 21032 KB Output is correct
47 Correct 1170 ms 60480 KB Output is correct
48 Correct 1182 ms 60480 KB Output is correct
49 Correct 1008 ms 60512 KB Output is correct
50 Correct 1161 ms 60576 KB Output is correct
51 Correct 995 ms 60572 KB Output is correct
52 Correct 1052 ms 60576 KB Output is correct
53 Correct 1174 ms 60492 KB Output is correct
54 Correct 1000 ms 60468 KB Output is correct
55 Correct 0 ms 200 KB Output is correct
56 Incorrect 342 ms 60316 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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