oj.uz

Submission #539369

# Submission time Handle Problem Language Result Execution time Memory
539369 2022-03-18T19:02:04 Z 1ne Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 520 ms 262144 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O2")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
using namespace std;
vector<int64_t>extra;
vector<vector<int64_t>>tree;
vector<int64_t>arr;
void 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]));    
    }  
}
int64_t curans = 0;
int64_t maxxy = 0;
void 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)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);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n,m;cin>>n>>m;
arr.resize(n);
for (int64_t i = 0;i<n;++i){
	cin>>arr[i];
}
extra.resize(2 * n - 1,0);
tree.resize(2 * n - 1);
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;
	query(0,0,n-1,l,r);
	//cout<<curans<<" "<<maxxy<<'\n';
	if (curans>k){
		cout<<0<<'\n';
	}
	else cout<<1<<'\n';
}
return 0;}

Compilation message

sortbooks.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O2")
      | 
sortbooks.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 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 340 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 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 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 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1732 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 7 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 5 ms 1748 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 445 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 219 ms 29220 KB Output is correct
2 Correct 176 ms 30320 KB Output is correct
3 Correct 190 ms 30400 KB Output is correct
4 Correct 175 ms 30216 KB Output is correct
5 Correct 181 ms 30428 KB Output is correct
6 Correct 128 ms 30264 KB Output is correct
7 Correct 126 ms 30204 KB Output is correct
8 Correct 171 ms 30148 KB Output is correct
9 Correct 38 ms 1816 KB Output is correct
10 Correct 144 ms 30260 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 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 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 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1732 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 7 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 5 ms 1748 KB Output is correct
19 Correct 520 ms 61592 KB Output is correct
20 Correct 519 ms 61528 KB Output is correct
21 Correct 392 ms 61632 KB Output is correct
22 Correct 423 ms 61592 KB Output is correct
23 Correct 401 ms 61648 KB Output is correct
24 Correct 298 ms 61592 KB Output is correct
25 Correct 339 ms 61548 KB Output is correct
26 Correct 397 ms 61524 KB Output is correct
27 Correct 519 ms 61472 KB Output is correct
28 Correct 425 ms 61492 KB Output is correct
29 Correct 429 ms 61516 KB Output is correct
30 Correct 435 ms 61620 KB Output is correct
31 Correct 426 ms 61584 KB Output is correct
32 Correct 512 ms 61508 KB Output is correct
33 Correct 432 ms 61728 KB Output is correct
34 Correct 290 ms 61500 KB Output is correct
35 Correct 286 ms 61720 KB Output is correct
36 Correct 297 ms 61568 KB Output is correct
37 Correct 323 ms 61496 KB Output is correct
38 Correct 278 ms 61588 KB Output is correct
39 Correct 367 ms 60756 KB Output is correct
40 Correct 258 ms 36272 KB Output is correct
41 Correct 346 ms 60412 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 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 328 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 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 5 ms 1732 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 7 ms 1736 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 5 ms 1748 KB Output is correct
19 Runtime error 445 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -