oj.uz

Submission #124730

# Submission time Handle Problem Language Result Execution time Memory
124730 2019-07-03T19:42:54 Z MvC Two Antennas (JOI19_antennas) C++11
100 / 100
 771 ms 48512 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,j,rs[nmax],h[nmax],a[nmax],b[nmax],q,x,l[nmax],r[nmax],dmn[4*nmax],dmx[4*nmax],lzmn[4*nmax],lzmx[4*nmax];
vector<int>ad[nmax],re[nmax],qr[nmax];
pair<int,int>st[4*nmax];
void push(int nod,int l,int r)
{
    dmn[nod]=max(dmn[nod],lzmx[nod]-st[nod].sc);
    dmx[nod]=max(dmx[nod],st[nod].fr-lzmn[nod]);
    if(l!=r)
    {
    	lzmn[2*nod]=min(lzmn[2*nod],lzmn[nod]);
    	lzmn[2*nod+1]=min(lzmn[2*nod+1],lzmn[nod]);
    	lzmx[2*nod]=max(lzmx[2*nod],lzmx[nod]);
    	lzmx[2*nod+1]=max(lzmx[2*nod+1],lzmx[nod]);
	}
	lzmn[nod]=inf,lzmx[nod]=-inf;
}
void upd(int nod,int l,int r,int tl,int tr,int v)
{
    push(nod,l,r);
    if(tl<=l && r<=tr)
	{
		lzmn[nod]=v;
        lzmx[nod]=v;
        push(nod,l,r);
        return;
    }
    int mid=(l+r)/2;
    if(tl<=mid)upd(nod*2,l,mid,tl,tr,v);
    if(mid<tr)upd(nod*2+1,mid+1,r,tl,tr,v);
    push(nod*2,l,mid);
	push(nod*2+1,mid+1,r);
    dmn[nod]=max(dmn[2*nod],dmn[2*nod+1]);
    dmx[nod]=max(dmx[2*nod],dmx[2*nod+1]);
}
pair<int,int> merge(pair<int,int>x,pair<int,int>y)
{
	return mkp(max(x.fr,y.fr),min(x.sc,y.sc));
}
void up(int x,int l,int r,int p,int v)
{
	if(l>r)return;
	push(x,l,r);
	if(l==r)
	{
		if(v==-1)st[x]=mkp(-inf,inf);
		else st[x]=mkp(v,v);
		return;
	}
	int mid=(l+r)/2;
	if(p<=mid)up(2*x,l,mid,p,v);
	else up(2*x+1,mid+1,r,p,v);
	push(x*2,l,mid);
	push(x*2+1,mid+1,r);
	st[x]=merge(st[2*x],st[2*x+1]);
	dmn[x]=max(dmn[2*x],dmn[2*x+1]);
    dmx[x]=max(dmx[2*x],dmx[2*x+1]);
}
int qry(int nod,int l,int r,int tl,int tr)
{
    push(nod,l,r);
    if(tl<=l && r<=tr)return max(dmn[nod],dmx[nod]);
    int mid=(l+r)/2,vl=-inf;
    if(tl<=mid)vl=max(vl,qry(nod*2,l,mid,tl,tr));
    if(mid<tr)vl=max(vl,qry(nod*2+1,mid+1,r,tl,tr));
	return vl;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>h[i]>>a[i]>>b[i];
		ad[min(n+1,i+a[i])].pb(i);
		re[min(n+1,i+b[i]+1)].pb(i);
	}
	cin>>q;
	for(i=1;i<=q;i++)
	{
		cin>>l[i]>>r[i];
		qr[r[i]].pb(i);
	}
	for(i=1;i<=4*n;i++)
	{
		st[i]=mkp(-inf,inf);
		lzmn[i]=inf;
		lzmx[i]=-inf;
		dmn[i]=dmx[i]=-inf;
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<ad[i].size();j++)
		{
			up(1,1,n,ad[i][j],h[ad[i][j]]);
		}
		for(j=0;j<re[i].size();j++)
		{
			up(1,1,n,re[i][j],-1);
		}
		if(i-a[i]>=1)
		{
			upd(1,1,n,max(i-b[i],1),max(i-a[i],1),h[i]);
		}
		for(j=0;j<qr[i].size();j++)
		{
			rs[qr[i][j]]=qry(1,1,n,l[qr[i][j]],i);
		}
	}
	for(i=1;i<=q;i++)cout<<max(-1,rs[i])<<'\n';
    return 0;
}

Compilation message

antennas.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
antennas.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
antennas.cpp: In function 'int main()':
antennas.cpp:116:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<ad[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:120:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<re[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:128:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<qr[i].size();j++)
           ~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14456 KB Output is correct
2 Correct 18 ms 14584 KB Output is correct
3 Correct 18 ms 14584 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 19 ms 14624 KB Output is correct
6 Correct 19 ms 14556 KB Output is correct
7 Correct 19 ms 14584 KB Output is correct
8 Correct 16 ms 14584 KB Output is correct
9 Correct 18 ms 14584 KB Output is correct
10 Correct 19 ms 14584 KB Output is correct
11 Correct 17 ms 14584 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 16 ms 14584 KB Output is correct
14 Correct 16 ms 14584 KB Output is correct
15 Correct 19 ms 14584 KB Output is correct
16 Correct 19 ms 14584 KB Output is correct
17 Correct 17 ms 14584 KB Output is correct
18 Correct 19 ms 14584 KB Output is correct
19 Correct 19 ms 14456 KB Output is correct
20 Correct 16 ms 14560 KB Output is correct
21 Correct 17 ms 14584 KB Output is correct
22 Correct 16 ms 14588 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 16 ms 14584 KB Output is correct
25 Correct 110 ms 18936 KB Output is correct
26 Correct 29 ms 15352 KB Output is correct
27 Correct 155 ms 20672 KB Output is correct
28 Correct 162 ms 20728 KB Output is correct
29 Correct 110 ms 18852 KB Output is correct
30 Correct 115 ms 18632 KB Output is correct
31 Correct 125 ms 20092 KB Output is correct
32 Correct 165 ms 20728 KB Output is correct
33 Correct 146 ms 20344 KB Output is correct
34 Correct 91 ms 17704 KB Output is correct
35 Correct 161 ms 20600 KB Output is correct
36 Correct 162 ms 20600 KB Output is correct
37 Correct 99 ms 17664 KB Output is correct
38 Correct 157 ms 19860 KB Output is correct
39 Correct 37 ms 15600 KB Output is correct
40 Correct 157 ms 19804 KB Output is correct
41 Correct 118 ms 18424 KB Output is correct
42 Correct 162 ms 19668 KB Output is correct
43 Correct 63 ms 16376 KB Output is correct
44 Correct 158 ms 19696 KB Output is correct
45 Correct 41 ms 15740 KB Output is correct
46 Correct 157 ms 19832 KB Output is correct
47 Correct 53 ms 16120 KB Output is correct
48 Correct 154 ms 19844 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 38504 KB Output is correct
2 Correct 410 ms 41140 KB Output is correct
3 Correct 273 ms 33260 KB Output is correct
4 Correct 397 ms 41064 KB Output is correct
5 Correct 167 ms 27160 KB Output is correct
6 Correct 399 ms 41104 KB Output is correct
7 Correct 394 ms 37608 KB Output is correct
8 Correct 409 ms 41216 KB Output is correct
9 Correct 63 ms 19064 KB Output is correct
10 Correct 403 ms 41064 KB Output is correct
11 Correct 238 ms 31264 KB Output is correct
12 Correct 405 ms 41196 KB Output is correct
13 Correct 339 ms 38520 KB Output is correct
14 Correct 329 ms 38484 KB Output is correct
15 Correct 317 ms 38768 KB Output is correct
16 Correct 282 ms 38764 KB Output is correct
17 Correct 363 ms 38704 KB Output is correct
18 Correct 312 ms 38892 KB Output is correct
19 Correct 323 ms 38604 KB Output is correct
20 Correct 309 ms 38572 KB Output is correct
21 Correct 296 ms 38728 KB Output is correct
22 Correct 328 ms 38512 KB Output is correct
23 Correct 318 ms 38636 KB Output is correct
24 Correct 276 ms 38900 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14456 KB Output is correct
2 Correct 18 ms 14584 KB Output is correct
3 Correct 18 ms 14584 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 19 ms 14624 KB Output is correct
6 Correct 19 ms 14556 KB Output is correct
7 Correct 19 ms 14584 KB Output is correct
8 Correct 16 ms 14584 KB Output is correct
9 Correct 18 ms 14584 KB Output is correct
10 Correct 19 ms 14584 KB Output is correct
11 Correct 17 ms 14584 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 16 ms 14584 KB Output is correct
14 Correct 16 ms 14584 KB Output is correct
15 Correct 19 ms 14584 KB Output is correct
16 Correct 19 ms 14584 KB Output is correct
17 Correct 17 ms 14584 KB Output is correct
18 Correct 19 ms 14584 KB Output is correct
19 Correct 19 ms 14456 KB Output is correct
20 Correct 16 ms 14560 KB Output is correct
21 Correct 17 ms 14584 KB Output is correct
22 Correct 16 ms 14588 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 16 ms 14584 KB Output is correct
25 Correct 110 ms 18936 KB Output is correct
26 Correct 29 ms 15352 KB Output is correct
27 Correct 155 ms 20672 KB Output is correct
28 Correct 162 ms 20728 KB Output is correct
29 Correct 110 ms 18852 KB Output is correct
30 Correct 115 ms 18632 KB Output is correct
31 Correct 125 ms 20092 KB Output is correct
32 Correct 165 ms 20728 KB Output is correct
33 Correct 146 ms 20344 KB Output is correct
34 Correct 91 ms 17704 KB Output is correct
35 Correct 161 ms 20600 KB Output is correct
36 Correct 162 ms 20600 KB Output is correct
37 Correct 99 ms 17664 KB Output is correct
38 Correct 157 ms 19860 KB Output is correct
39 Correct 37 ms 15600 KB Output is correct
40 Correct 157 ms 19804 KB Output is correct
41 Correct 118 ms 18424 KB Output is correct
42 Correct 162 ms 19668 KB Output is correct
43 Correct 63 ms 16376 KB Output is correct
44 Correct 158 ms 19696 KB Output is correct
45 Correct 41 ms 15740 KB Output is correct
46 Correct 157 ms 19832 KB Output is correct
47 Correct 53 ms 16120 KB Output is correct
48 Correct 154 ms 19844 KB Output is correct
49 Correct 370 ms 38504 KB Output is correct
50 Correct 410 ms 41140 KB Output is correct
51 Correct 273 ms 33260 KB Output is correct
52 Correct 397 ms 41064 KB Output is correct
53 Correct 167 ms 27160 KB Output is correct
54 Correct 399 ms 41104 KB Output is correct
55 Correct 394 ms 37608 KB Output is correct
56 Correct 409 ms 41216 KB Output is correct
57 Correct 63 ms 19064 KB Output is correct
58 Correct 403 ms 41064 KB Output is correct
59 Correct 238 ms 31264 KB Output is correct
60 Correct 405 ms 41196 KB Output is correct
61 Correct 339 ms 38520 KB Output is correct
62 Correct 329 ms 38484 KB Output is correct
63 Correct 317 ms 38768 KB Output is correct
64 Correct 282 ms 38764 KB Output is correct
65 Correct 363 ms 38704 KB Output is correct
66 Correct 312 ms 38892 KB Output is correct
67 Correct 323 ms 38604 KB Output is correct
68 Correct 309 ms 38572 KB Output is correct
69 Correct 296 ms 38728 KB Output is correct
70 Correct 328 ms 38512 KB Output is correct
71 Correct 318 ms 38636 KB Output is correct
72 Correct 276 ms 38900 KB Output is correct
73 Correct 616 ms 44104 KB Output is correct
74 Correct 442 ms 41552 KB Output is correct
75 Correct 559 ms 40408 KB Output is correct
76 Correct 771 ms 48512 KB Output is correct
77 Correct 366 ms 32364 KB Output is correct
78 Correct 674 ms 46316 KB Output is correct
79 Correct 715 ms 44908 KB Output is correct
80 Correct 771 ms 48268 KB Output is correct
81 Correct 306 ms 24592 KB Output is correct
82 Correct 623 ms 44780 KB Output is correct
83 Correct 593 ms 37920 KB Output is correct
84 Correct 747 ms 48008 KB Output is correct
85 Correct 531 ms 41936 KB Output is correct
86 Correct 632 ms 44376 KB Output is correct
87 Correct 378 ms 39148 KB Output is correct
88 Correct 592 ms 44708 KB Output is correct
89 Correct 588 ms 43056 KB Output is correct
90 Correct 679 ms 45032 KB Output is correct
91 Correct 435 ms 40268 KB Output is correct
92 Correct 641 ms 44204 KB Output is correct
93 Correct 361 ms 39120 KB Output is correct
94 Correct 685 ms 44456 KB Output is correct
95 Correct 419 ms 39916 KB Output is correct
96 Correct 618 ms 44272 KB Output is correct