oj.uz

Submission #908528

# Submission time Handle Problem Language Result Execution time Memory
908528 2024-01-16T13:35:47 Z arashMLG Triple Jump (JOI19_jumps) C++17
100 / 100
 1154 ms 145384 KB 
#include<bits/stdc++.h>
using namespace std;

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

const int N = 5e5 + 23;
const ll inf = 1e18;

#define F                  first
#define S                  second
#define pb	               push_back
#define sz(x)              ((int)x.size())
#define kill(x)            cout<<x , exit(0);
#define all(x)             x.begin(),x.end()
#define lc                 (v<<1)
#define rc                 ((v<<1)|1)
#define debug(x)           cerr<< #x << " : " << x << '\n';
#define int               	ll

struct Seg {
	int t[N<<2];
	int mx[N<<2];
	int lz[N<<2];
	
	Seg() {
		for(int i = 0 ; i<(N<<2); i ++) t[i] = mx[i] = lz[i] = 0;
	}
	
	void shift(int v) {
		if(lz[v] == 0) return;
		lz[lc] = max(lz[lc],lz[v]);
		lz[rc] = max(lz[rc],lz[v]);
		t[lc] = max(t[lc],mx[lc] + lz[lc]);
		t[rc] = max(t[rc],mx[rc] + lz[rc]);
		lz[v] = 0;
	}
	
	// khode a[i] ha
	void set(int pos,int x,int v=1,int tl= 1,int tr= N) {
		if(tr-tl == 1) {
			mx[v] = x;
			return;
		}
		int mid=(tl+tr)/2;
		if(pos < mid)
			set(pos,x,lc,tl,mid);
		else
			set(pos,x,rc,mid,tr);
		mx[v] = max(mx[lc],mx[rc]);
	}
	
	void add(int l,int r,int x,int v=1,int tl = 1,int tr= N) {
		if(l > r) return;
		if(l == tl && r ==tr-1) {
			lz[v] = max(lz[v],x);
			t[v] = max(t[v],mx[v] + lz[v]);
			return;
		}
		shift(v);
		int mid=(tl+tr)/2;
		add(l,min(mid-1,r),x,lc,tl,mid);
		add(max(l,mid),r,x,rc,mid,tr);
		t[v] = max(t[lc],t[rc]);
	}
	
	int get(int l,int r,int v=1,int tl=1,int tr = N) {
		if(l >r) return 0;
		if(l == tl && r == tr-1) return t[v];
		shift(v);
		int mid=(tl+tr)/2;
		return max(get(l,min(mid-1,r),lc,tl,mid), get(max(l,mid),r,rc,mid,tr));
	}
	
}seg;

int n,q;
int a[N];
vector<pair<int,int>> Q[N];
vector<pair<int,int>> here[N];
int ans[N];
vector<int> st;
int L[N],R[N];
vector<pair<int,int> > edges;
int Mx[N];

int32_t main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n;
	for(int i = 1; i<= n ; i ++) {
		cin>>a[i];
		seg.set(i,a[i]);
	}
	cin>>q;
	for(int i = 0 ; i< q; i ++) {
		int l,r; cin>>l>>r;
		Q[l].pb({r,i});	
	}
	st.pb(0);
	for(int i = 1; i<= n ; i++) {
		while(st.back() && a[st.back()] < a[i]) st.pop_back();
		if(sz(st) > 1) {
			L[i] = st.back();
		}
		st.pb(i);
	} st.clear();
	st.pb(0);
	for(int i = n ; i >= 1;i --) {
		while(st.back() && a[st.back()] < a[i]) st.pop_back();
		if(sz(st) > 1) {
			R[i]=  st.back();
		}
		st.pb(i);
	}
	for(int i= 1; i <= n ; i ++) {
		if(R[i] != 0 && R[i] - i + R[i] <= n) {
			//Mx[R[i]-i+R[i]] = max(Mx[R[i]-i +R[i]], a[i] + a[R[i]]);
			here[i].pb({R[i]-i+R[i],a[i] + a[R[i]]});
		}
		if(L[i] != 0 && i-L[i] + i <= n) {
			//Mx[i-L[i]+i] = max(Mx[i-L[i]+i],a[i] + a[L[i]]);
			here[L[i]].pb({i-L[i]+i,a[i] + a[L[i]]});
		}
	}
	for(int i = n; i >= 1; i --) {
		for(auto [l,val] : here[i]) seg.add(l,n,val);
		for(auto [r,id]  : Q[i])    ans[id] = seg.get(i,r);		
	}
	for(int i = 0 ; i< q;i ++) {
		cout<<ans[i] << '\n';
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 79964 KB Output is correct
2 Correct 17 ms 79964 KB Output is correct
3 Correct 16 ms 77916 KB Output is correct
4 Correct 18 ms 80216 KB Output is correct
5 Correct 17 ms 79960 KB Output is correct
6 Correct 17 ms 79964 KB Output is correct
7 Correct 17 ms 79964 KB Output is correct
8 Correct 17 ms 79960 KB Output is correct
9 Correct 18 ms 79960 KB Output is correct
10 Correct 17 ms 79964 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 79964 KB Output is correct
2 Correct 17 ms 79964 KB Output is correct
3 Correct 16 ms 77916 KB Output is correct
4 Correct 18 ms 80216 KB Output is correct
5 Correct 17 ms 79960 KB Output is correct
6 Correct 17 ms 79964 KB Output is correct
7 Correct 17 ms 79964 KB Output is correct
8 Correct 17 ms 79960 KB Output is correct
9 Correct 18 ms 79960 KB Output is correct
10 Correct 17 ms 79964 KB Output is correct
11 Correct 237 ms 107076 KB Output is correct
12 Correct 232 ms 105296 KB Output is correct
13 Correct 237 ms 107304 KB Output is correct
14 Correct 237 ms 107108 KB Output is correct
15 Correct 239 ms 107252 KB Output is correct
16 Correct 253 ms 106624 KB Output is correct
17 Correct 231 ms 106580 KB Output is correct
18 Correct 237 ms 106388 KB Output is correct
19 Correct 237 ms 107092 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 98132 KB Output is correct
2 Correct 117 ms 95692 KB Output is correct
3 Correct 113 ms 95692 KB Output is correct
4 Correct 191 ms 98212 KB Output is correct
5 Correct 201 ms 98200 KB Output is correct
6 Correct 220 ms 97576 KB Output is correct
7 Correct 192 ms 97360 KB Output is correct
8 Correct 191 ms 97444 KB Output is correct
9 Correct 208 ms 97776 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 79964 KB Output is correct
2 Correct 17 ms 79964 KB Output is correct
3 Correct 16 ms 77916 KB Output is correct
4 Correct 18 ms 80216 KB Output is correct
5 Correct 17 ms 79960 KB Output is correct
6 Correct 17 ms 79964 KB Output is correct
7 Correct 17 ms 79964 KB Output is correct
8 Correct 17 ms 79960 KB Output is correct
9 Correct 18 ms 79960 KB Output is correct
10 Correct 17 ms 79964 KB Output is correct
11 Correct 237 ms 107076 KB Output is correct
12 Correct 232 ms 105296 KB Output is correct
13 Correct 237 ms 107304 KB Output is correct
14 Correct 237 ms 107108 KB Output is correct
15 Correct 239 ms 107252 KB Output is correct
16 Correct 253 ms 106624 KB Output is correct
17 Correct 231 ms 106580 KB Output is correct
18 Correct 237 ms 106388 KB Output is correct
19 Correct 237 ms 107092 KB Output is correct
20 Correct 193 ms 98132 KB Output is correct
21 Correct 117 ms 95692 KB Output is correct
22 Correct 113 ms 95692 KB Output is correct
23 Correct 191 ms 98212 KB Output is correct
24 Correct 201 ms 98200 KB Output is correct
25 Correct 220 ms 97576 KB Output is correct
26 Correct 192 ms 97360 KB Output is correct
27 Correct 191 ms 97444 KB Output is correct
28 Correct 208 ms 97776 KB Output is correct
29 Correct 1154 ms 142820 KB Output is correct
30 Correct 898 ms 136736 KB Output is correct
31 Correct 844 ms 136896 KB Output is correct
32 Correct 1146 ms 142816 KB Output is correct
33 Correct 1128 ms 142728 KB Output is correct
34 Correct 1072 ms 140684 KB Output is correct
35 Correct 1108 ms 140168 KB Output is correct
36 Correct 1097 ms 140144 KB Output is correct
37 Correct 1080 ms 141936 KB Output is correct
38 Correct 780 ms 145384 KB Output is correct
39 Correct 777 ms 145116 KB Output is correct
40 Correct 758 ms 142200 KB Output is correct
41 Correct 793 ms 141688 KB Output is correct
42 Correct 752 ms 141936 KB Output is correct
43 Correct 763 ms 143292 KB Output is correct
44 Correct 794 ms 145092 KB Output is correct
45 Correct 832 ms 145360 KB Output is correct
46 Correct 796 ms 141920 KB Output is correct
47 Correct 806 ms 141596 KB Output is correct
48 Correct 844 ms 141596 KB Output is correct
49 Correct 777 ms 143520 KB Output is correct
50 Correct 971 ms 144356 KB Output is correct
51 Correct 936 ms 144336 KB Output is correct
52 Correct 916 ms 141952 KB Output is correct
53 Correct 911 ms 141840 KB Output is correct
54 Correct 905 ms 141688 KB Output is correct
55 Correct 964 ms 143196 KB Output is correct