oj.uz

Submission #539372

# Submission time Handle Problem Language Result Execution time Memory
539372 2022-03-18T19:09:11 Z 1ne Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 587 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n,m;cin>>n>>m;
vector<int64_t>extra(2*n);
vector<vector<int64_t>>tree(2*n);
vector<int64_t>arr(n);
for (int64_t i = 0;i<n;++i){
	cin>>arr[i];
}
int64_t curans = 0;
int64_t maxxy = 0;
function<void(int64_t,int64_t,int64_t)> build = [&](int64_t node,int64_t node_low,int64_t node_high){
    if (node_low==node_high){
        tree[node].push_back(arr[node_low]);
    }
    else {
    	int y = (node_low + node_high) >> 1;
    	int z = node + ((y - node_low + 1) << 1);
        build(node+1,node_low,y);
        build(z,y+1,node_high);
        extra[node] = max(extra[node+1],extra[z]);
	    auto right = lower_bound(tree[z].begin(),tree[z].end(),tree[node+1].back()) - tree[z].begin();
		while(right>=0){
			if (tree[z][right]>=tree[node+1].back() || right>=(int)tree[z].size()){
				--right;
			}
			else break;
		}
		if (right>=0){
			extra[node] = max(extra[node],tree[node+1].back() + tree[z][right]);
		}
        merge(tree[node+1].begin(),tree[node+1].end(),tree[z].begin(),tree[z].end(),back_inserter(tree[node]));    
    }  
};

build(0,0,n-1);
for (int64_t i = 0;i<m;++i){
	int64_t l,r,k;cin>>l>>r>>k;
	--l,--r;
	curans = 0;
	maxxy = 0;
	function<void(int64_t,int64_t,int64_t,int64_t,int64_t)>query =[&](int64_t node,int64_t node_low,int64_t node_high,int64_t query_low,int64_t query_high){
	    if (node_low>node_high||query_high<node_low||query_low>node_high || curans>k)return ;
	    if (query_low<=node_low&&query_high>=node_high){
	    	curans = max(curans,extra[node]);
	    	auto right = lower_bound(tree[node].begin(),tree[node].end(),maxxy) - tree[node].begin();
			while(right>=0){
				if (tree[node][right]>=maxxy || right>=(int)tree[node].size()){
					--right;
				}
				else break;
			}
			if (right>=0){
				curans = max(curans,maxxy + tree[node][right]);
			}
		    maxxy = max(maxxy,tree[node].back());
		    return ;
	    }
	    int y = (node_low + node_high) >> 1;
	    int z = node + ((y - node_low + 1) << 1);
	   	query(node+1,node_low,y,query_low,query_high);
	   	query(z,y+1,node_high,query_low,query_high);
	};
	query(0,0,n-1,l,r);
	//cout<<curans<<" "<<maxxy<<'\n';
	if (curans>k){
		cout<<0<<'\n';
	}
	else cout<<1<<'\n';
}
return 0;}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 4 ms 716 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1748 KB Output is correct
14 Correct 6 ms 1744 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 6 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 7 ms 1748 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 455 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 174 ms 28852 KB Output is correct
2 Correct 153 ms 28760 KB Output is correct
3 Correct 234 ms 28740 KB Output is correct
4 Correct 232 ms 28756 KB Output is correct
5 Correct 270 ms 28920 KB Output is correct
6 Correct 146 ms 28744 KB Output is correct
7 Correct 119 ms 28740 KB Output is correct
8 Correct 146 ms 28740 KB Output is correct
9 Correct 47 ms 952 KB Output is correct
10 Correct 142 ms 28740 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 4 ms 716 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1748 KB Output is correct
14 Correct 6 ms 1744 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 6 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 7 ms 1748 KB Output is correct
19 Correct 383 ms 58888 KB Output is correct
20 Correct 379 ms 58884 KB Output is correct
21 Correct 325 ms 58884 KB Output is correct
22 Correct 357 ms 58940 KB Output is correct
23 Correct 328 ms 58928 KB Output is correct
24 Correct 398 ms 58816 KB Output is correct
25 Correct 377 ms 58936 KB Output is correct
26 Correct 523 ms 59020 KB Output is correct
27 Correct 548 ms 58920 KB Output is correct
28 Correct 539 ms 58912 KB Output is correct
29 Correct 587 ms 58824 KB Output is correct
30 Correct 551 ms 58880 KB Output is correct
31 Correct 577 ms 58856 KB Output is correct
32 Correct 549 ms 58784 KB Output is correct
33 Correct 548 ms 58892 KB Output is correct
34 Correct 328 ms 58880 KB Output is correct
35 Correct 333 ms 58864 KB Output is correct
36 Correct 310 ms 58684 KB Output is correct
37 Correct 313 ms 58724 KB Output is correct
38 Correct 313 ms 58960 KB Output is correct
39 Correct 399 ms 58688 KB Output is correct
40 Correct 364 ms 34604 KB Output is correct
41 Correct 334 ms 58664 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 4 ms 716 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1748 KB Output is correct
14 Correct 6 ms 1744 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 6 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 7 ms 1748 KB Output is correct
19 Runtime error 455 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -