oj.uz

Submission #613710

# Submission time Handle Problem Language Result Execution time Memory
613710 2022-07-30T09:37:48 Z temporary_juggernaut Two Antennas (JOI19_antennas) C++14
13 / 100
 3000 ms 19748 KB 
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int h[200005];
int a[200005];
int b[200005];
const int inf=1e9;
int ans[200005];
int n;
vector<pair<int,int>>queries;
int q;
int lz[800005];
pair<int,int>tree[800005];
/*void build(int v,int l,int r){
	if(l==r){
		lz[v]=0;
		tree[v]={-inf,0};
		return;
	}
	int mid=(l+r)>>1;
	build(v<<1,l,mid);
	build(v<<1|1,mid+1,r);
	tree[v]=max(tree[v<<1],tree[v<<1|1]);
}
void push(int &v,int &l,int &r){
	if(l^r){
		umax(lz[v<<1],lz[v]);
		umax(lz[v<<1|1],lz[v]);
	}
	lz[v]=0;
}
void st(int v,int l,int r,int pos,int val,int mx=0){
	umax(mx,lz[v]);
	if(l==r){
		tree[v]={mx-val,-mx};
		lz[v]=0;
		return;
	}else{
		umax(lz[v<<1],lz[v]);
		umax(lz[v<<1|1],lz[v]);
	}
	int mid=(l+r)>>1;
	if(pos<=mid)st(v<<1,l,mid,pos,val,mx);
	else st(v<<1|1,mid+1,r,pos,val,mx);
	tree[v]=max(tree[v<<1],tree[v<<1|1]);
}
void chmax(int v,int l,int r,int ql,int qr,int val){
	if(qr<l||r<ql)return;
	if(ql<=l&&r<=qr){
		umax(lz[v],val);
		if(-tree[v].sc<lz[v]){
			int pivot=lz[v]+tree[v].sc;
			tree[v].sc-=pivot;
			tree[v].fr+=pivot;
		}
		return;
	}
	int mid=(l+r)>>1;
	chmax(v<<1,l,mid,ql,qr,val);
	chmax(v<<1|1,mid+1,r,ql,qr,val);
	tree[v]=max(tree[v<<1],tree[v<<1|1]);
}
int get(int v,int l,int r,int ql,int qr){
	if(qr<l||r<ql)return -1;
	if(ql<=l&&r<=qr)return tree[v].fr;
	int mid=(l+r)>>1;
	return max(get(v<<1,l,mid,ql,qr),get(v<<1|1,mid+1,r,ql,qr));
}*/
int x[200005];
int best[200005];
void build(int v,int l,int r){
	for(int i=l;i<=r;i++){
		x[i]=-inf;
		best[i]=-inf;
	}
}
void add(int v,int l,int r,int ql,int qr,int val){
	for(int i=ql;i<=qr;i++){
		x[i]+=val;
		umax(best[i],x[i]);
	}
}
int get(int v,int l,int r,int ql,int qr){
	int ans=-1;
	for(int i=ql;i<=qr;i++)umax(ans,best[i]);
	return ans;
}
void solve(){
	build(1,1,n);
	vector<vector<int>>inc(n+1),exc(n+1),query(n+1);
	for(int i=0;i<q;i++)query[queries[i].fr].push_back(i);
	for(int i=1;i<=n;i++){
		if(i>a[i]){
			exc[max(1,i-b[i])].push_back(i);
			inc[i-a[i]].push_back(i);
		}
	}
	for(int i=n;i;i--){
		for(int idx:inc[i])add(1,1,n,idx,idx,inf-h[idx]);
		if(i+a[i]<=n)
			add(1,1,n,i+a[i],min(i+b[i],n),h[i]);
		if(i+a[i]<=n)
			add(1,1,n,i+a[i],min(i+b[i],n),-h[i]);
		for(int idx:query[i])
			umax(ans[idx],get(1,1,n,i,queries[idx].sc));
		for(int idx:exc[i])add(1,1,n,idx,idx,h[idx]-inf);
	}
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d%d",&h[i],&a[i],&b[i]);
	scanf("%d",&q);
	for(int i=0;i^q;i++){
		int l,r;
		scanf("%d%d",&l,&r);
		queries.emplace_back(l,r);
		ans[i]=-1;
	}
	solve();
	reverse(h+1,h+1+n);
	reverse(a+1,a+1+n);
	reverse(b+1,b+1+n);
	for(auto &to:queries)to=make_pair(n-to.sc+1,n-to.fr+1);
	solve();
	for(int i=0;i<q;i++)printf("%d\n",ans[i]);
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:120:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
antennas.cpp:121:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |  for(int i=1;i<=n;i++)scanf("%d%d%d",&h[i],&a[i],&b[i]);
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:122:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |  scanf("%d",&q);
      |  ~~~~~^~~~~~~~~
antennas.cpp:125:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |   scanf("%d%d",&l,&r);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 125 ms 4308 KB Output is correct
26 Correct 23 ms 844 KB Output is correct
27 Correct 234 ms 5788 KB Output is correct
28 Correct 273 ms 5808 KB Output is correct
29 Correct 112 ms 4468 KB Output is correct
30 Correct 182 ms 4152 KB Output is correct
31 Correct 89 ms 5304 KB Output is correct
32 Correct 273 ms 5760 KB Output is correct
33 Correct 183 ms 5604 KB Output is correct
34 Correct 131 ms 3012 KB Output is correct
35 Correct 230 ms 5972 KB Output is correct
36 Correct 287 ms 5840 KB Output is correct
37 Correct 158 ms 2992 KB Output is correct
38 Correct 270 ms 4908 KB Output is correct
39 Correct 43 ms 1104 KB Output is correct
40 Correct 262 ms 4840 KB Output is correct
41 Correct 193 ms 3816 KB Output is correct
42 Correct 284 ms 4900 KB Output is correct
43 Correct 85 ms 1896 KB Output is correct
44 Correct 271 ms 4920 KB Output is correct
45 Correct 53 ms 1172 KB Output is correct
46 Correct 282 ms 4792 KB Output is correct
47 Correct 70 ms 1604 KB Output is correct
48 Correct 306 ms 4912 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3051 ms 19748 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 125 ms 4308 KB Output is correct
26 Correct 23 ms 844 KB Output is correct
27 Correct 234 ms 5788 KB Output is correct
28 Correct 273 ms 5808 KB Output is correct
29 Correct 112 ms 4468 KB Output is correct
30 Correct 182 ms 4152 KB Output is correct
31 Correct 89 ms 5304 KB Output is correct
32 Correct 273 ms 5760 KB Output is correct
33 Correct 183 ms 5604 KB Output is correct
34 Correct 131 ms 3012 KB Output is correct
35 Correct 230 ms 5972 KB Output is correct
36 Correct 287 ms 5840 KB Output is correct
37 Correct 158 ms 2992 KB Output is correct
38 Correct 270 ms 4908 KB Output is correct
39 Correct 43 ms 1104 KB Output is correct
40 Correct 262 ms 4840 KB Output is correct
41 Correct 193 ms 3816 KB Output is correct
42 Correct 284 ms 4900 KB Output is correct
43 Correct 85 ms 1896 KB Output is correct
44 Correct 271 ms 4920 KB Output is correct
45 Correct 53 ms 1172 KB Output is correct
46 Correct 282 ms 4792 KB Output is correct
47 Correct 70 ms 1604 KB Output is correct
48 Correct 306 ms 4912 KB Output is correct
49 Execution timed out 3051 ms 19748 KB Time limit exceeded
50 Halted 0 ms 0 KB -