oj.uz

Submission #1096637

# Submission time Handle Problem Language Result Execution time Memory
1096637 2024-10-04T23:11:00 Z rayan_bd Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 560 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;


#define getar(ar,n) for(int i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define aint(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ret return
#define ld long double
#define sza(x) ((int)x.size())

const int mxN = 1e6 + 1;

struct Node{
	vector<int> vec;
	int mx=0,bad_mx=0;
};
Node seg[mxN*2];
int ar[mxN],mx=0;

void build(int node,int start,int end){
	if(start==end){
		seg[node].vec.pb(ar[start]);
		seg[node].mx=ar[start];
		seg[node].bad_mx=0;
		return;
	}
	int mid=start+(end-start)/2;
	build(node*2+1,start,mid);
	build(node*2+2,mid+1,end);

	seg[node].vec.assign(seg[node*2+1].vec.size()+seg[node*2+2].vec.size(),0);
	merge(aint(seg[node*2+1].vec),aint(seg[node*2+2].vec),seg[node].vec.begin());
	seg[node].mx=max(seg[node*2+1].mx,seg[node*2+2].mx);
	int mxx=0;
	for(int i=start;i<=end;++i){
		if(mxx>ar[i]){
			seg[node].bad_mx=max(seg[node].bad_mx,mxx+ar[i]);
		}else{
			mxx=ar[i];
		}
	}
}

bool qry(int nd,int start,int end,int l,int r,int k){
	if(start>r||end<l) return 1;
	if(start>=l&&end<=r){
		bool f=(max(seg[nd].bad_mx,(mx>seg[nd].vec[0]?mx+*--lower_bound(aint(seg[nd].vec),mx):0))<=k);
		mx=max(mx,seg[nd].mx);
		return f;
	}
	int mid=start+(end-start)/2;
	return ((!qry(nd*2+1,start,mid,l,r,k)||!qry(nd*2+2,mid+1,end,l,r,k))?0:1);
}

void solve(){
	int n,l,r,w,q;cin>>n>>q;
	for(int i=0;i<n;++i){
		cin>>ar[i];
	}
	build(0,0,n-1);
	while(q--){
		cin>>l>>r>>w;
		mx=0;
		cout<<(qry(0,0,n-1,l-1,r-1,w))<<nl;
	}
}


signed main() {
    


    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 63068 KB Output is correct
2 Correct 25 ms 62916 KB Output is correct
3 Correct 25 ms 63304 KB Output is correct
4 Correct 25 ms 63064 KB Output is correct
5 Correct 27 ms 63064 KB Output is correct
6 Correct 27 ms 63056 KB Output is correct
7 Correct 25 ms 63068 KB Output is correct
8 Correct 27 ms 63092 KB Output is correct
9 Correct 29 ms 63060 KB Output is correct
10 Correct 27 ms 62980 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 63068 KB Output is correct
2 Correct 25 ms 62916 KB Output is correct
3 Correct 25 ms 63304 KB Output is correct
4 Correct 25 ms 63064 KB Output is correct
5 Correct 27 ms 63064 KB Output is correct
6 Correct 27 ms 63056 KB Output is correct
7 Correct 25 ms 63068 KB Output is correct
8 Correct 27 ms 63092 KB Output is correct
9 Correct 29 ms 63060 KB Output is correct
10 Correct 27 ms 62980 KB Output is correct
11 Correct 31 ms 63056 KB Output is correct
12 Correct 30 ms 63588 KB Output is correct
13 Correct 30 ms 63496 KB Output is correct
14 Correct 32 ms 63692 KB Output is correct
15 Correct 31 ms 63600 KB Output is correct
16 Correct 33 ms 63576 KB Output is correct
17 Correct 31 ms 63572 KB Output is correct
18 Correct 30 ms 63580 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 560 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 76880 KB Output is correct
2 Correct 108 ms 76816 KB Output is correct
3 Correct 103 ms 76884 KB Output is correct
4 Correct 100 ms 76880 KB Output is correct
5 Correct 106 ms 76808 KB Output is correct
6 Correct 75 ms 76884 KB Output is correct
7 Correct 76 ms 76936 KB Output is correct
8 Correct 80 ms 76664 KB Output is correct
9 Correct 50 ms 64592 KB Output is correct
10 Correct 84 ms 76624 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 63068 KB Output is correct
2 Correct 25 ms 62916 KB Output is correct
3 Correct 25 ms 63304 KB Output is correct
4 Correct 25 ms 63064 KB Output is correct
5 Correct 27 ms 63064 KB Output is correct
6 Correct 27 ms 63056 KB Output is correct
7 Correct 25 ms 63068 KB Output is correct
8 Correct 27 ms 63092 KB Output is correct
9 Correct 29 ms 63060 KB Output is correct
10 Correct 27 ms 62980 KB Output is correct
11 Correct 31 ms 63056 KB Output is correct
12 Correct 30 ms 63588 KB Output is correct
13 Correct 30 ms 63496 KB Output is correct
14 Correct 32 ms 63692 KB Output is correct
15 Correct 31 ms 63600 KB Output is correct
16 Correct 33 ms 63576 KB Output is correct
17 Correct 31 ms 63572 KB Output is correct
18 Correct 30 ms 63580 KB Output is correct
19 Correct 226 ms 93524 KB Output is correct
20 Correct 212 ms 93780 KB Output is correct
21 Correct 190 ms 93520 KB Output is correct
22 Correct 207 ms 93524 KB Output is correct
23 Correct 200 ms 93520 KB Output is correct
24 Correct 177 ms 93352 KB Output is correct
25 Correct 184 ms 93264 KB Output is correct
26 Correct 222 ms 93508 KB Output is correct
27 Correct 205 ms 93524 KB Output is correct
28 Correct 237 ms 93568 KB Output is correct
29 Correct 239 ms 93524 KB Output is correct
30 Correct 237 ms 93440 KB Output is correct
31 Correct 246 ms 93464 KB Output is correct
32 Correct 225 ms 93400 KB Output is correct
33 Correct 247 ms 93524 KB Output is correct
34 Correct 165 ms 93384 KB Output is correct
35 Correct 161 ms 93268 KB Output is correct
36 Correct 150 ms 93096 KB Output is correct
37 Correct 150 ms 93044 KB Output is correct
38 Correct 153 ms 93008 KB Output is correct
39 Correct 166 ms 92244 KB Output is correct
40 Correct 143 ms 82852 KB Output is correct
41 Correct 153 ms 91980 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 63068 KB Output is correct
2 Correct 25 ms 62916 KB Output is correct
3 Correct 25 ms 63304 KB Output is correct
4 Correct 25 ms 63064 KB Output is correct
5 Correct 27 ms 63064 KB Output is correct
6 Correct 27 ms 63056 KB Output is correct
7 Correct 25 ms 63068 KB Output is correct
8 Correct 27 ms 63092 KB Output is correct
9 Correct 29 ms 63060 KB Output is correct
10 Correct 27 ms 62980 KB Output is correct
11 Correct 31 ms 63056 KB Output is correct
12 Correct 30 ms 63588 KB Output is correct
13 Correct 30 ms 63496 KB Output is correct
14 Correct 32 ms 63692 KB Output is correct
15 Correct 31 ms 63600 KB Output is correct
16 Correct 33 ms 63576 KB Output is correct
17 Correct 31 ms 63572 KB Output is correct
18 Correct 30 ms 63580 KB Output is correct
19 Runtime error 560 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -