oj.uz

Submission #126884

# Submission time Handle Problem Language Result Execution time Memory
126884 2019-07-08T14:52:32 Z TadijaSebez Two Antennas (JOI19_antennas) C++11
100 / 100
 1169 ms 49760 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
const int N=200050;
const int M=2*N;
const ll inf=1e18;
int h[N],a[N],b[N];
ll ans[N];
vector<pair<int,int>> Qs[N];
vector<int> add[N],del[N];
int root,tsz,ls[M],rs[M];
ll mx1[M],mx2[M],lzy[M];
void Build(int &c, int ss, int se)
{
	c=++tsz;mx1[c]=mx2[c]=lzy[c]=-inf;
	if(ss==se) return;
	int mid=ss+se>>1;
	Build(ls[c],ss,mid);
	Build(rs[c],mid+1,se);
}
void upd(int c, ll x)
{
	mx2[c]=max(mx2[c],mx1[c]+x);
	lzy[c]=max(lzy[c],x);
}
void push(int c)
{
	if(lzy[c]!=-inf)
	{
		upd(ls[c],lzy[c]);
		upd(rs[c],lzy[c]);
		lzy[c]=-inf;
	}
}
void Add(int c, int ss, int se, int qs, int qe, ll x)
{
	if(qs>qe || qs>se || ss>qe) return;
	if(qs<=ss && qe>=se){ upd(c,x);return;}
	push(c);
	int mid=ss+se>>1;
	Add(ls[c],ss,mid,qs,qe,x);
	Add(rs[c],mid+1,se,qs,qe,x);
	mx2[c]=max(mx2[ls[c]],mx2[rs[c]]);
}
void Set(int c, int ss, int se, int qi, ll x)
{
	if(ss==se){ mx1[c]=x;return;}
	push(c);
	int mid=ss+se>>1;
	if(qi<=mid) Set(ls[c],ss,mid,qi,x);
	else Set(rs[c],mid+1,se,qi,x);
	mx1[c]=max(mx1[ls[c]],mx1[rs[c]]);
}
ll Get(int c, int ss, int se, int qs, int qe)
{
	if(qs>qe || qs>se || ss>qe) return -inf;
	if(qs<=ss && qe>=se) return mx2[c];
	push(c);
	int mid=ss+se>>1;
	return max(Get(ls[c],ss,mid,qs,qe),Get(rs[c],mid+1,se,qs,qe));
}
int n,q;
void Solve()
{
	Build(root,1,n);
	for(int i=1;i<=n;i++)
	{
		int l=i+a[i],r=i+b[i];
		l=min(l,n+1);
		r=min(r,n+1);
		add[l].pb(i);
		del[r].pb(i);
		for(int x:add[i]) Set(root,1,n,x,h[x]);
		Add(root,1,n,i-b[i],i-a[i],-h[i]);
		for(auto t:Qs[i]) ans[t.second]=max(ans[t.second],Get(root,1,n,t.first,i));
		for(int x:del[i]) Set(root,1,n,x,-inf);
		add[i].clear();
		del[i].clear();
	}
	for(int i=1;i<=tsz;i++) ls[i]=rs[i]=0;
	tsz=root=0;
}
int main()
{
	int l,r;
	scanf("%i",&n);
	for(int i=1;i<=n;i++) scanf("%i %i %i",&h[i],&a[i],&b[i]);
	scanf("%i",&q);
	for(int i=1;i<=q;i++) scanf("%i %i",&l,&r),Qs[r].pb({l,i}),ans[i]=-1;
	Solve();
	for(int i=1;i<=n;i++) h[i]=-h[i];
	Solve();
	for(int i=1;i<=q;i++) printf("%lld\n",ans[i]);
	return 0;
}

Compilation message

antennas.cpp: In function 'void Build(int&, int, int)':
antennas.cpp:18:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
antennas.cpp: In function 'void Add(int, int, int, int, int, long long int)':
antennas.cpp:41:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
antennas.cpp: In function 'void Set(int, int, int, int, long long int)':
antennas.cpp:50:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
antennas.cpp: In function 'long long int Get(int, int, int, int, int)':
antennas.cpp:60:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
antennas.cpp: In function 'int main()':
antennas.cpp:87:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
antennas.cpp:88:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i %i %i",&h[i],&a[i],&b[i]);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&q);
  ~~~~~^~~~~~~~~
antennas.cpp:90:60: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=q;i++) scanf("%i %i",&l,&r),Qs[r].pb({l,i}),ans[i]=-1;
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 15 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14508 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 15 ms 14456 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14584 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14572 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 15 ms 14556 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14440 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 15 ms 14584 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 15 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14508 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 15 ms 14456 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14584 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14572 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 15 ms 14556 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14440 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 15 ms 14584 KB Output is correct
25 Correct 133 ms 19884 KB Output is correct
26 Correct 31 ms 15224 KB Output is correct
27 Correct 193 ms 22108 KB Output is correct
28 Correct 206 ms 22276 KB Output is correct
29 Correct 140 ms 19960 KB Output is correct
30 Correct 142 ms 19760 KB Output is correct
31 Correct 156 ms 21152 KB Output is correct
32 Correct 202 ms 22148 KB Output is correct
33 Correct 181 ms 21624 KB Output is correct
34 Correct 104 ms 18324 KB Output is correct
35 Correct 186 ms 22008 KB Output is correct
36 Correct 199 ms 22140 KB Output is correct
37 Correct 113 ms 18524 KB Output is correct
38 Correct 195 ms 21240 KB Output is correct
39 Correct 41 ms 15608 KB Output is correct
40 Correct 193 ms 21212 KB Output is correct
41 Correct 147 ms 19448 KB Output is correct
42 Correct 195 ms 21240 KB Output is correct
43 Correct 72 ms 16760 KB Output is correct
44 Correct 190 ms 21276 KB Output is correct
45 Correct 46 ms 15740 KB Output is correct
46 Correct 188 ms 21168 KB Output is correct
47 Correct 60 ms 16376 KB Output is correct
48 Correct 192 ms 21268 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 38212 KB Output is correct
2 Correct 597 ms 40312 KB Output is correct
3 Correct 373 ms 32356 KB Output is correct
4 Correct 589 ms 40444 KB Output is correct
5 Correct 217 ms 26348 KB Output is correct
6 Correct 598 ms 40240 KB Output is correct
7 Correct 489 ms 36196 KB Output is correct
8 Correct 615 ms 40268 KB Output is correct
9 Correct 71 ms 18552 KB Output is correct
10 Correct 603 ms 40436 KB Output is correct
11 Correct 316 ms 30156 KB Output is correct
12 Correct 606 ms 40416 KB Output is correct
13 Correct 283 ms 37032 KB Output is correct
14 Correct 271 ms 36852 KB Output is correct
15 Correct 288 ms 36824 KB Output is correct
16 Correct 235 ms 37288 KB Output is correct
17 Correct 281 ms 36880 KB Output is correct
18 Correct 261 ms 37220 KB Output is correct
19 Correct 269 ms 36940 KB Output is correct
20 Correct 265 ms 37044 KB Output is correct
21 Correct 274 ms 36824 KB Output is correct
22 Correct 283 ms 37280 KB Output is correct
23 Correct 272 ms 36804 KB Output is correct
24 Correct 236 ms 36688 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 15 ms 14584 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14508 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 15 ms 14456 KB Output is correct
13 Correct 15 ms 14456 KB Output is correct
14 Correct 15 ms 14456 KB Output is correct
15 Correct 15 ms 14584 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14572 KB Output is correct
18 Correct 15 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 15 ms 14556 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14440 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 15 ms 14584 KB Output is correct
25 Correct 133 ms 19884 KB Output is correct
26 Correct 31 ms 15224 KB Output is correct
27 Correct 193 ms 22108 KB Output is correct
28 Correct 206 ms 22276 KB Output is correct
29 Correct 140 ms 19960 KB Output is correct
30 Correct 142 ms 19760 KB Output is correct
31 Correct 156 ms 21152 KB Output is correct
32 Correct 202 ms 22148 KB Output is correct
33 Correct 181 ms 21624 KB Output is correct
34 Correct 104 ms 18324 KB Output is correct
35 Correct 186 ms 22008 KB Output is correct
36 Correct 199 ms 22140 KB Output is correct
37 Correct 113 ms 18524 KB Output is correct
38 Correct 195 ms 21240 KB Output is correct
39 Correct 41 ms 15608 KB Output is correct
40 Correct 193 ms 21212 KB Output is correct
41 Correct 147 ms 19448 KB Output is correct
42 Correct 195 ms 21240 KB Output is correct
43 Correct 72 ms 16760 KB Output is correct
44 Correct 190 ms 21276 KB Output is correct
45 Correct 46 ms 15740 KB Output is correct
46 Correct 188 ms 21168 KB Output is correct
47 Correct 60 ms 16376 KB Output is correct
48 Correct 192 ms 21268 KB Output is correct
49 Correct 530 ms 38212 KB Output is correct
50 Correct 597 ms 40312 KB Output is correct
51 Correct 373 ms 32356 KB Output is correct
52 Correct 589 ms 40444 KB Output is correct
53 Correct 217 ms 26348 KB Output is correct
54 Correct 598 ms 40240 KB Output is correct
55 Correct 489 ms 36196 KB Output is correct
56 Correct 615 ms 40268 KB Output is correct
57 Correct 71 ms 18552 KB Output is correct
58 Correct 603 ms 40436 KB Output is correct
59 Correct 316 ms 30156 KB Output is correct
60 Correct 606 ms 40416 KB Output is correct
61 Correct 283 ms 37032 KB Output is correct
62 Correct 271 ms 36852 KB Output is correct
63 Correct 288 ms 36824 KB Output is correct
64 Correct 235 ms 37288 KB Output is correct
65 Correct 281 ms 36880 KB Output is correct
66 Correct 261 ms 37220 KB Output is correct
67 Correct 269 ms 36940 KB Output is correct
68 Correct 265 ms 37044 KB Output is correct
69 Correct 274 ms 36824 KB Output is correct
70 Correct 283 ms 37280 KB Output is correct
71 Correct 272 ms 36804 KB Output is correct
72 Correct 236 ms 36688 KB Output is correct
73 Correct 871 ms 44660 KB Output is correct
74 Correct 642 ms 41164 KB Output is correct
75 Correct 837 ms 41732 KB Output is correct
76 Correct 1112 ms 49760 KB Output is correct
77 Correct 534 ms 32728 KB Output is correct
78 Correct 912 ms 46436 KB Output is correct
79 Correct 1051 ms 45880 KB Output is correct
80 Correct 1169 ms 49480 KB Output is correct
81 Correct 364 ms 26612 KB Output is correct
82 Correct 868 ms 44872 KB Output is correct
83 Correct 759 ms 39496 KB Output is correct
84 Correct 1099 ms 49576 KB Output is correct
85 Correct 588 ms 42324 KB Output is correct
86 Correct 815 ms 45456 KB Output is correct
87 Correct 341 ms 38216 KB Output is correct
88 Correct 680 ms 45672 KB Output is correct
89 Correct 601 ms 43304 KB Output is correct
90 Correct 689 ms 45800 KB Output is correct
91 Correct 443 ms 40088 KB Output is correct
92 Correct 703 ms 45644 KB Output is correct
93 Correct 360 ms 38424 KB Output is correct
94 Correct 726 ms 45980 KB Output is correct
95 Correct 399 ms 39608 KB Output is correct
96 Correct 669 ms 45640 KB Output is correct