oj.uz

Submission #242376

# Submission time Handle Problem Language Result Execution time Memory
242376 2020-06-27T12:24:35 Z errorgorn Triple Jump (JOI19_jumps) C++14
100 / 100
 990 ms 111420 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;
 
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
 
ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}
 
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
int n,q;
ll arr[500005];
 
vector<int> stk;
 
vector<ii> good;
 
struct Q{
	int l,r;
	int idx;
	
	Q(int a,int b,int c){
		l=a,r=b,idx=c;
	}
};
 
vector<Q> queries;
 
ll ans[500005];
 
struct dat{
	ll ab=-1e18,c=0,abc=0;
};
 
dat merge(dat i,dat j){
	dat res;
	
	res.c=max(i.c,j.c);
	res.ab=max(i.ab,j.ab);
	res.abc=MAX(i.abc,j.abc,i.ab+j.c);
	
	return res;
}
 
struct node{
	int s,e,m;
	dat val;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
			val=merge(l->val,r->val);
		}
		else{
			val.c=arr[s];
		}
	}
	
	void update(int i,ll j){
		if (s==e) val.ab=max(val.ab,j);
		else{
			if (i<=m) l->update(i,j);
			else r->update(i,j);
			
			val=merge(l->val,r->val);
		}
	}
	
	dat query(int i,int j){
		if (s==i && e==j) return val;
		else if (j<=m) return l->query(i,j);
		else if (m<i) return r->query(i,j);
		else return merge(l->query(i,m),r->query(m+1,j));
	}
} *root;
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	rep(x,0,n) cin>>arr[x];
	
	root=new node(0,500005);
	
	rep(x,0,n){
		while (!stk.empty() && arr[stk.back()]<=arr[x]){
			good.push_back({stk.back(),x});
			stk.pop_back();
		}
		
		if (!stk.empty()) good.push_back({stk.back(),x});
		stk.push_back(x);
	}
	
	cin>>q;
	int a,b;
	rep(x,0,q){
		cin>>a>>b;
		a--,b--;
		queries.push_back(Q(a,b,x));
	}
	
	sort(all(good),[](ii i,ii j){
		return i.fi<j.fi;
	});
	
	sort(all(queries),[](Q &i,Q &j){
		return i.l>j.l;
	});
	
	for (auto &it:queries){
		while (!good.empty() && it.l<=good.back().fi){
			int pos=good.back().se*2-good.back().fi-1;
			
			//cout<<pos<<" "<<good.back().fi<<" "<<good.back().se<<endl;
			if (pos<500005) root->update(pos,arr[good.back().fi]+arr[good.back().se]);
			
			good.pop_back();
		}
		
		ans[it.idx]=root->query(0,it.r).abc;
	}
	
	rep(x,0,q) cout<<ans[x]<<endl;
}

Compilation message

jumps.cpp: In constructor 'node::node(int, int)':
jumps.cpp:74:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   s=_s,e=_e,m=s+e>>1;
               ~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 62968 KB Output is correct
2 Correct 57 ms 62968 KB Output is correct
3 Correct 63 ms 62972 KB Output is correct
4 Correct 62 ms 62968 KB Output is correct
5 Correct 58 ms 62968 KB Output is correct
6 Correct 56 ms 62984 KB Output is correct
7 Correct 59 ms 62968 KB Output is correct
8 Correct 59 ms 62968 KB Output is correct
9 Correct 59 ms 62968 KB Output is correct
10 Correct 67 ms 63088 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 62968 KB Output is correct
2 Correct 57 ms 62968 KB Output is correct
3 Correct 63 ms 62972 KB Output is correct
4 Correct 62 ms 62968 KB Output is correct
5 Correct 58 ms 62968 KB Output is correct
6 Correct 56 ms 62984 KB Output is correct
7 Correct 59 ms 62968 KB Output is correct
8 Correct 59 ms 62968 KB Output is correct
9 Correct 59 ms 62968 KB Output is correct
10 Correct 67 ms 63088 KB Output is correct
11 Correct 317 ms 78168 KB Output is correct
12 Correct 320 ms 77916 KB Output is correct
13 Correct 290 ms 78196 KB Output is correct
14 Correct 299 ms 78168 KB Output is correct
15 Correct 301 ms 78172 KB Output is correct
16 Correct 315 ms 77652 KB Output is correct
17 Correct 299 ms 77400 KB Output is correct
18 Correct 317 ms 77400 KB Output is correct
19 Correct 316 ms 78180 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 72932 KB Output is correct
2 Correct 131 ms 68840 KB Output is correct
3 Correct 135 ms 69740 KB Output is correct
4 Correct 181 ms 72932 KB Output is correct
5 Correct 183 ms 72932 KB Output is correct
6 Correct 166 ms 72932 KB Output is correct
7 Correct 169 ms 72932 KB Output is correct
8 Correct 179 ms 72932 KB Output is correct
9 Correct 165 ms 72932 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 62968 KB Output is correct
2 Correct 57 ms 62968 KB Output is correct
3 Correct 63 ms 62972 KB Output is correct
4 Correct 62 ms 62968 KB Output is correct
5 Correct 58 ms 62968 KB Output is correct
6 Correct 56 ms 62984 KB Output is correct
7 Correct 59 ms 62968 KB Output is correct
8 Correct 59 ms 62968 KB Output is correct
9 Correct 59 ms 62968 KB Output is correct
10 Correct 67 ms 63088 KB Output is correct
11 Correct 317 ms 78168 KB Output is correct
12 Correct 320 ms 77916 KB Output is correct
13 Correct 290 ms 78196 KB Output is correct
14 Correct 299 ms 78168 KB Output is correct
15 Correct 301 ms 78172 KB Output is correct
16 Correct 315 ms 77652 KB Output is correct
17 Correct 299 ms 77400 KB Output is correct
18 Correct 317 ms 77400 KB Output is correct
19 Correct 316 ms 78180 KB Output is correct
20 Correct 181 ms 72932 KB Output is correct
21 Correct 131 ms 68840 KB Output is correct
22 Correct 135 ms 69740 KB Output is correct
23 Correct 181 ms 72932 KB Output is correct
24 Correct 183 ms 72932 KB Output is correct
25 Correct 166 ms 72932 KB Output is correct
26 Correct 169 ms 72932 KB Output is correct
27 Correct 179 ms 72932 KB Output is correct
28 Correct 165 ms 72932 KB Output is correct
29 Correct 990 ms 103740 KB Output is correct
30 Correct 766 ms 102992 KB Output is correct
31 Correct 771 ms 105576 KB Output is correct
32 Correct 938 ms 111180 KB Output is correct
33 Correct 936 ms 111164 KB Output is correct
34 Correct 979 ms 110524 KB Output is correct
35 Correct 976 ms 110396 KB Output is correct
36 Correct 901 ms 110396 KB Output is correct
37 Correct 901 ms 111036 KB Output is correct
38 Correct 644 ms 110972 KB Output is correct
39 Correct 625 ms 110964 KB Output is correct
40 Correct 638 ms 109372 KB Output is correct
41 Correct 616 ms 109116 KB Output is correct
42 Correct 612 ms 109244 KB Output is correct
43 Correct 638 ms 110012 KB Output is correct
44 Correct 675 ms 111164 KB Output is correct
45 Correct 670 ms 111036 KB Output is correct
46 Correct 636 ms 109628 KB Output is correct
47 Correct 651 ms 109500 KB Output is correct
48 Correct 650 ms 109540 KB Output is correct
49 Correct 678 ms 110704 KB Output is correct
50 Correct 703 ms 111420 KB Output is correct
51 Correct 709 ms 111268 KB Output is correct
52 Correct 713 ms 110524 KB Output is correct
53 Correct 671 ms 110396 KB Output is correct
54 Correct 698 ms 110652 KB Output is correct
55 Correct 722 ms 111416 KB Output is correct