oj.uz

답안 #404073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404073 2021-05-13T18:16:06 Z keta_tsimakuridze Two Antennas (JOI19_antennas) C++14
100 / 100
 1473 ms 78012 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define remove rem
#define int long long
using namespace std;
const int N=2e5+5,mod=1e9+7,Inf=1e17;
int t,lazy[4*N],l[N],r[N],a[N],b[N],h[N],n,Q,ans[N];
string s;
vector<pair<int,int> >q[N];
vector<int>add[2*N],remove[2*N];
pair<int,int> tree[4*N];
void build(int u,int l,int r){
	tree[u].f=Inf;
	tree[u].s=-Inf;
	lazy[u]=0;
	if(l==r) return;
	int mid=(l+r)/2;
	build(2*u,l,mid);
	build(2*u+1,mid+1,r);
}
void update(int u,int start,int end,int l,int r,int val,int type) {
	if(lazy[u]) {
		tree[u].s = max(tree[u].s,lazy[u]-tree[u].f);
		if(l!=r){
			lazy[2*u]=max(lazy[2*u],lazy[u]);
			lazy[2*u+1]=max(lazy[2*u+1],lazy[u]);
		}
		lazy[u] = 0;
	}
	if(l>end || r<start) return;
	if(start<=l && r<=end)  {
		if(type==0) {
			tree[u].f = val;
			return;
		}
		lazy[u]=val;
		tree[u].s = max(tree[u].s,lazy[u]-tree[u].f);
		if(l!=r){
			lazy[2*u]=max(lazy[2*u],lazy[u]);
			lazy[2*u+1]=max(lazy[2*u+1],lazy[u]);
		}
		lazy[u] = 0;
		return;
	}
	int mid=(l+r)/2;
	update(2*u,start,end,l,mid,val,type);
	update(2*u+1,start,end,mid+1,r,val,type);
	tree[u].f = min(tree[2*u].f,tree[2*u+1].f);
	tree[u].s = max(tree[2*u].s,tree[2*u+1].s);
}
int getans(int u,int start,int end,int l,int r){
	if(lazy[u]) {
		tree[u].s = max(tree[u].s,lazy[u]-tree[u].f);
		if(l!=r){
			lazy[2*u]=max(lazy[2*u],lazy[u]);
			lazy[2*u+1]=max(lazy[2*u+1],lazy[u]);
		}
		lazy[u] = 0;
	}
	if(l>end || r<start) return -Inf;
	if(start<=l && r<=end) return tree[u].s;
	int mid=(l+r)/2;
	return max(getans(2*u,start,end,l,mid),getans(2*u+1,start,end,mid+1,r));
}
void go(){
	for(int i=1;i<=n;i++){
		add[i+a[i]].push_back(i); 
		remove[i+b[i]+1].push_back(i);
		for(int j=0;j<add[i].size();j++) { 
			update(1,add[i][j],add[i][j],1,n,h[add[i][j]],0);
		}
		add[i].clear();
		for(int j=0;j<remove[i].size();j++) { 
			update(1,remove[i][j],remove[i][j],1,n,Inf,0);
		}
		remove[i].clear();
		update(1,max(1ll,i-b[i]),i-a[i],1,n,h[i],1);
		for(int j=0;j<q[i].size();j++) {
			ans[q[i][j].s] = max(ans[q[i][j].s],getans(1,q[i][j].f,i,1,n));
		}
		q[i].clear();
	}
}
 main(){
	// t=1;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>h[i]>>a[i]>>b[i];
	}
	cin>>Q;
	for(int i=1;i<=Q;i++){
		cin>>l[i]>>r[i]; ans[i]=-Inf;
		q[r[i]].push_back({l[i],i});
	}
	build(1,1,n);
	go(); 
	reverse(h+1,h+n+1);
	reverse(a+1,a+n+1);
	reverse(b+1,b+n+1);
	build(1,1,n);
	for(int i=1;i<=Q;i++){
		q[n-l[i]+1].push_back({n-r[i]+1,i});
	}
	go(); 
	for(int i=1;i<=Q;i++) if(ans[i] < 0) cout<<-1<<"\n"; else cout<<ans[i]<<"\n";
}

Compilation message

antennas.cpp: In function 'void go()':
antennas.cpp:70:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for(int j=0;j<add[i].size();j++) {
      |               ~^~~~~~~~~~~~~~
antennas.cpp:74:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int j=0;j<remove[i].size();j++) {
      |               ~^~~~~~~~~~~~~~~~~
antennas.cpp:79:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |   for(int j=0;j<q[i].size();j++) {
      |               ~^~~~~~~~~~~~
antennas.cpp: At global scope:
antennas.cpp:85:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 |  main(){
      |  ^~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23840 KB Output is correct
2 Correct 15 ms 23884 KB Output is correct
3 Correct 15 ms 23884 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 15 ms 23776 KB Output is correct
6 Correct 14 ms 23836 KB Output is correct
7 Correct 15 ms 23792 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 14 ms 23768 KB Output is correct
10 Correct 15 ms 23804 KB Output is correct
11 Correct 14 ms 23856 KB Output is correct
12 Correct 15 ms 23880 KB Output is correct
13 Correct 16 ms 23884 KB Output is correct
14 Correct 17 ms 23824 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 14 ms 23884 KB Output is correct
17 Correct 14 ms 23884 KB Output is correct
18 Correct 14 ms 23852 KB Output is correct
19 Correct 14 ms 23820 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 15 ms 23784 KB Output is correct
22 Correct 14 ms 23780 KB Output is correct
23 Correct 15 ms 23884 KB Output is correct
24 Correct 15 ms 23792 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23840 KB Output is correct
2 Correct 15 ms 23884 KB Output is correct
3 Correct 15 ms 23884 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 15 ms 23776 KB Output is correct
6 Correct 14 ms 23836 KB Output is correct
7 Correct 15 ms 23792 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 14 ms 23768 KB Output is correct
10 Correct 15 ms 23804 KB Output is correct
11 Correct 14 ms 23856 KB Output is correct
12 Correct 15 ms 23880 KB Output is correct
13 Correct 16 ms 23884 KB Output is correct
14 Correct 17 ms 23824 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 14 ms 23884 KB Output is correct
17 Correct 14 ms 23884 KB Output is correct
18 Correct 14 ms 23852 KB Output is correct
19 Correct 14 ms 23820 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 15 ms 23784 KB Output is correct
22 Correct 14 ms 23780 KB Output is correct
23 Correct 15 ms 23884 KB Output is correct
24 Correct 15 ms 23792 KB Output is correct
25 Correct 197 ms 34548 KB Output is correct
26 Correct 37 ms 25196 KB Output is correct
27 Correct 248 ms 38724 KB Output is correct
28 Correct 295 ms 38500 KB Output is correct
29 Correct 177 ms 35060 KB Output is correct
30 Correct 178 ms 34360 KB Output is correct
31 Correct 244 ms 37284 KB Output is correct
32 Correct 257 ms 38468 KB Output is correct
33 Correct 231 ms 38212 KB Output is correct
34 Correct 142 ms 31064 KB Output is correct
35 Correct 252 ms 39420 KB Output is correct
36 Correct 277 ms 38596 KB Output is correct
37 Correct 152 ms 31988 KB Output is correct
38 Correct 251 ms 37528 KB Output is correct
39 Correct 50 ms 25928 KB Output is correct
40 Correct 253 ms 37576 KB Output is correct
41 Correct 189 ms 34408 KB Output is correct
42 Correct 258 ms 37492 KB Output is correct
43 Correct 98 ms 28740 KB Output is correct
44 Correct 255 ms 37456 KB Output is correct
45 Correct 59 ms 26436 KB Output is correct
46 Correct 253 ms 37480 KB Output is correct
47 Correct 78 ms 27524 KB Output is correct
48 Correct 246 ms 37488 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 802 ms 58056 KB Output is correct
2 Correct 882 ms 60544 KB Output is correct
3 Correct 576 ms 53156 KB Output is correct
4 Correct 907 ms 60504 KB Output is correct
5 Correct 361 ms 41120 KB Output is correct
6 Correct 905 ms 60676 KB Output is correct
7 Correct 744 ms 57240 KB Output is correct
8 Correct 924 ms 60588 KB Output is correct
9 Correct 110 ms 29128 KB Output is correct
10 Correct 869 ms 60520 KB Output is correct
11 Correct 523 ms 45152 KB Output is correct
12 Correct 941 ms 60496 KB Output is correct
13 Correct 528 ms 57284 KB Output is correct
14 Correct 498 ms 56824 KB Output is correct
15 Correct 499 ms 56488 KB Output is correct
16 Correct 460 ms 57068 KB Output is correct
17 Correct 521 ms 57116 KB Output is correct
18 Correct 541 ms 56360 KB Output is correct
19 Correct 506 ms 56780 KB Output is correct
20 Correct 517 ms 56840 KB Output is correct
21 Correct 472 ms 57632 KB Output is correct
22 Correct 483 ms 56800 KB Output is correct
23 Correct 488 ms 56852 KB Output is correct
24 Correct 466 ms 55960 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23840 KB Output is correct
2 Correct 15 ms 23884 KB Output is correct
3 Correct 15 ms 23884 KB Output is correct
4 Correct 15 ms 23892 KB Output is correct
5 Correct 15 ms 23776 KB Output is correct
6 Correct 14 ms 23836 KB Output is correct
7 Correct 15 ms 23792 KB Output is correct
8 Correct 14 ms 23872 KB Output is correct
9 Correct 14 ms 23768 KB Output is correct
10 Correct 15 ms 23804 KB Output is correct
11 Correct 14 ms 23856 KB Output is correct
12 Correct 15 ms 23880 KB Output is correct
13 Correct 16 ms 23884 KB Output is correct
14 Correct 17 ms 23824 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 14 ms 23884 KB Output is correct
17 Correct 14 ms 23884 KB Output is correct
18 Correct 14 ms 23852 KB Output is correct
19 Correct 14 ms 23820 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 15 ms 23784 KB Output is correct
22 Correct 14 ms 23780 KB Output is correct
23 Correct 15 ms 23884 KB Output is correct
24 Correct 15 ms 23792 KB Output is correct
25 Correct 197 ms 34548 KB Output is correct
26 Correct 37 ms 25196 KB Output is correct
27 Correct 248 ms 38724 KB Output is correct
28 Correct 295 ms 38500 KB Output is correct
29 Correct 177 ms 35060 KB Output is correct
30 Correct 178 ms 34360 KB Output is correct
31 Correct 244 ms 37284 KB Output is correct
32 Correct 257 ms 38468 KB Output is correct
33 Correct 231 ms 38212 KB Output is correct
34 Correct 142 ms 31064 KB Output is correct
35 Correct 252 ms 39420 KB Output is correct
36 Correct 277 ms 38596 KB Output is correct
37 Correct 152 ms 31988 KB Output is correct
38 Correct 251 ms 37528 KB Output is correct
39 Correct 50 ms 25928 KB Output is correct
40 Correct 253 ms 37576 KB Output is correct
41 Correct 189 ms 34408 KB Output is correct
42 Correct 258 ms 37492 KB Output is correct
43 Correct 98 ms 28740 KB Output is correct
44 Correct 255 ms 37456 KB Output is correct
45 Correct 59 ms 26436 KB Output is correct
46 Correct 253 ms 37480 KB Output is correct
47 Correct 78 ms 27524 KB Output is correct
48 Correct 246 ms 37488 KB Output is correct
49 Correct 802 ms 58056 KB Output is correct
50 Correct 882 ms 60544 KB Output is correct
51 Correct 576 ms 53156 KB Output is correct
52 Correct 907 ms 60504 KB Output is correct
53 Correct 361 ms 41120 KB Output is correct
54 Correct 905 ms 60676 KB Output is correct
55 Correct 744 ms 57240 KB Output is correct
56 Correct 924 ms 60588 KB Output is correct
57 Correct 110 ms 29128 KB Output is correct
58 Correct 869 ms 60520 KB Output is correct
59 Correct 523 ms 45152 KB Output is correct
60 Correct 941 ms 60496 KB Output is correct
61 Correct 528 ms 57284 KB Output is correct
62 Correct 498 ms 56824 KB Output is correct
63 Correct 499 ms 56488 KB Output is correct
64 Correct 460 ms 57068 KB Output is correct
65 Correct 521 ms 57116 KB Output is correct
66 Correct 541 ms 56360 KB Output is correct
67 Correct 506 ms 56780 KB Output is correct
68 Correct 517 ms 56840 KB Output is correct
69 Correct 472 ms 57632 KB Output is correct
70 Correct 483 ms 56800 KB Output is correct
71 Correct 488 ms 56852 KB Output is correct
72 Correct 466 ms 55960 KB Output is correct
73 Correct 1214 ms 71308 KB Output is correct
74 Correct 936 ms 62228 KB Output is correct
75 Correct 1142 ms 70212 KB Output is correct
76 Correct 1473 ms 78000 KB Output is correct
77 Correct 726 ms 53300 KB Output is correct
78 Correct 1274 ms 72648 KB Output is correct
79 Correct 1333 ms 74456 KB Output is correct
80 Correct 1422 ms 78004 KB Output is correct
81 Correct 483 ms 44168 KB Output is correct
82 Correct 1205 ms 69704 KB Output is correct
83 Correct 1016 ms 61768 KB Output is correct
84 Correct 1431 ms 78012 KB Output is correct
85 Correct 808 ms 67184 KB Output is correct
86 Correct 1058 ms 73084 KB Output is correct
87 Correct 572 ms 59148 KB Output is correct
88 Correct 1062 ms 73280 KB Output is correct
89 Correct 940 ms 69412 KB Output is correct
90 Correct 1027 ms 72640 KB Output is correct
91 Correct 712 ms 62608 KB Output is correct
92 Correct 1079 ms 73112 KB Output is correct
93 Correct 577 ms 60736 KB Output is correct
94 Correct 1022 ms 73008 KB Output is correct
95 Correct 637 ms 61660 KB Output is correct
96 Correct 999 ms 72332 KB Output is correct