oj.uz

답안 #124726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124726 2019-07-03T19:36:39 Z MvC Two Antennas (JOI19_antennas) C++11
100 / 100
 701 ms 49772 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)
{
	if(lzmx[nod]==-inf || lzmn[nod]==inf)return;
    if(st[nod].sc!=inf)dmn[nod]=max(dmn[nod],lzmx[nod]-st[nod].sc);
    if(st[nod].fr!=-inf)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]=min(lzmn[nod],v);
        lzmx[nod]=max(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:117:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<ad[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:121:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<re[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:129: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

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 16 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 17 ms 14712 KB Output is correct
8 Correct 16 ms 14584 KB Output is correct
9 Correct 16 ms 14588 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 16 ms 14588 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 16 ms 14584 KB Output is correct
15 Correct 16 ms 14584 KB Output is correct
16 Correct 16 ms 14584 KB Output is correct
17 Correct 15 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 15 ms 14584 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 16 ms 14588 KB Output is correct
22 Correct 16 ms 14584 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 15 ms 14512 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 16 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 17 ms 14712 KB Output is correct
8 Correct 16 ms 14584 KB Output is correct
9 Correct 16 ms 14588 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 16 ms 14588 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 16 ms 14584 KB Output is correct
15 Correct 16 ms 14584 KB Output is correct
16 Correct 16 ms 14584 KB Output is correct
17 Correct 15 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 15 ms 14584 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 16 ms 14588 KB Output is correct
22 Correct 16 ms 14584 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 15 ms 14512 KB Output is correct
25 Correct 102 ms 19704 KB Output is correct
26 Correct 27 ms 15304 KB Output is correct
27 Correct 138 ms 21792 KB Output is correct
28 Correct 143 ms 21916 KB Output is correct
29 Correct 100 ms 19576 KB Output is correct
30 Correct 107 ms 19580 KB Output is correct
31 Correct 114 ms 21060 KB Output is correct
32 Correct 146 ms 21920 KB Output is correct
33 Correct 134 ms 21368 KB Output is correct
34 Correct 79 ms 18168 KB Output is correct
35 Correct 152 ms 21752 KB Output is correct
36 Correct 143 ms 21880 KB Output is correct
37 Correct 84 ms 18296 KB Output is correct
38 Correct 137 ms 20896 KB Output is correct
39 Correct 34 ms 15736 KB Output is correct
40 Correct 139 ms 20984 KB Output is correct
41 Correct 104 ms 19320 KB Output is correct
42 Correct 133 ms 20856 KB Output is correct
43 Correct 58 ms 16888 KB Output is correct
44 Correct 141 ms 20984 KB Output is correct
45 Correct 37 ms 15864 KB Output is correct
46 Correct 132 ms 20984 KB Output is correct
47 Correct 47 ms 16380 KB Output is correct
48 Correct 138 ms 21036 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 355 ms 41832 KB Output is correct
2 Correct 386 ms 42660 KB Output is correct
3 Correct 282 ms 34792 KB Output is correct
4 Correct 404 ms 42764 KB Output is correct
5 Correct 160 ms 28528 KB Output is correct
6 Correct 390 ms 42736 KB Output is correct
7 Correct 327 ms 39020 KB Output is correct
8 Correct 398 ms 42608 KB Output is correct
9 Correct 62 ms 19448 KB Output is correct
10 Correct 438 ms 42728 KB Output is correct
11 Correct 231 ms 32880 KB Output is correct
12 Correct 396 ms 42736 KB Output is correct
13 Correct 246 ms 40044 KB Output is correct
14 Correct 234 ms 40280 KB Output is correct
15 Correct 229 ms 40172 KB Output is correct
16 Correct 212 ms 40428 KB Output is correct
17 Correct 249 ms 40112 KB Output is correct
18 Correct 233 ms 40428 KB Output is correct
19 Correct 242 ms 40304 KB Output is correct
20 Correct 229 ms 39976 KB Output is correct
21 Correct 218 ms 40048 KB Output is correct
22 Correct 230 ms 40052 KB Output is correct
23 Correct 232 ms 40044 KB Output is correct
24 Correct 207 ms 40304 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14584 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 16 ms 14584 KB Output is correct
6 Correct 17 ms 14584 KB Output is correct
7 Correct 17 ms 14712 KB Output is correct
8 Correct 16 ms 14584 KB Output is correct
9 Correct 16 ms 14588 KB Output is correct
10 Correct 16 ms 14584 KB Output is correct
11 Correct 16 ms 14588 KB Output is correct
12 Correct 16 ms 14584 KB Output is correct
13 Correct 15 ms 14584 KB Output is correct
14 Correct 16 ms 14584 KB Output is correct
15 Correct 16 ms 14584 KB Output is correct
16 Correct 16 ms 14584 KB Output is correct
17 Correct 15 ms 14584 KB Output is correct
18 Correct 15 ms 14584 KB Output is correct
19 Correct 15 ms 14584 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 16 ms 14588 KB Output is correct
22 Correct 16 ms 14584 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 15 ms 14512 KB Output is correct
25 Correct 102 ms 19704 KB Output is correct
26 Correct 27 ms 15304 KB Output is correct
27 Correct 138 ms 21792 KB Output is correct
28 Correct 143 ms 21916 KB Output is correct
29 Correct 100 ms 19576 KB Output is correct
30 Correct 107 ms 19580 KB Output is correct
31 Correct 114 ms 21060 KB Output is correct
32 Correct 146 ms 21920 KB Output is correct
33 Correct 134 ms 21368 KB Output is correct
34 Correct 79 ms 18168 KB Output is correct
35 Correct 152 ms 21752 KB Output is correct
36 Correct 143 ms 21880 KB Output is correct
37 Correct 84 ms 18296 KB Output is correct
38 Correct 137 ms 20896 KB Output is correct
39 Correct 34 ms 15736 KB Output is correct
40 Correct 139 ms 20984 KB Output is correct
41 Correct 104 ms 19320 KB Output is correct
42 Correct 133 ms 20856 KB Output is correct
43 Correct 58 ms 16888 KB Output is correct
44 Correct 141 ms 20984 KB Output is correct
45 Correct 37 ms 15864 KB Output is correct
46 Correct 132 ms 20984 KB Output is correct
47 Correct 47 ms 16380 KB Output is correct
48 Correct 138 ms 21036 KB Output is correct
49 Correct 355 ms 41832 KB Output is correct
50 Correct 386 ms 42660 KB Output is correct
51 Correct 282 ms 34792 KB Output is correct
52 Correct 404 ms 42764 KB Output is correct
53 Correct 160 ms 28528 KB Output is correct
54 Correct 390 ms 42736 KB Output is correct
55 Correct 327 ms 39020 KB Output is correct
56 Correct 398 ms 42608 KB Output is correct
57 Correct 62 ms 19448 KB Output is correct
58 Correct 438 ms 42728 KB Output is correct
59 Correct 231 ms 32880 KB Output is correct
60 Correct 396 ms 42736 KB Output is correct
61 Correct 246 ms 40044 KB Output is correct
62 Correct 234 ms 40280 KB Output is correct
63 Correct 229 ms 40172 KB Output is correct
64 Correct 212 ms 40428 KB Output is correct
65 Correct 249 ms 40112 KB Output is correct
66 Correct 233 ms 40428 KB Output is correct
67 Correct 242 ms 40304 KB Output is correct
68 Correct 229 ms 39976 KB Output is correct
69 Correct 218 ms 40048 KB Output is correct
70 Correct 230 ms 40052 KB Output is correct
71 Correct 232 ms 40044 KB Output is correct
72 Correct 207 ms 40304 KB Output is correct
73 Correct 569 ms 45548 KB Output is correct
74 Correct 408 ms 43076 KB Output is correct
75 Correct 566 ms 41704 KB Output is correct
76 Correct 690 ms 49772 KB Output is correct
77 Correct 353 ms 33620 KB Output is correct
78 Correct 602 ms 47720 KB Output is correct
79 Correct 637 ms 46188 KB Output is correct
80 Correct 697 ms 49724 KB Output is correct
81 Correct 241 ms 26488 KB Output is correct
82 Correct 555 ms 46312 KB Output is correct
83 Correct 506 ms 39536 KB Output is correct
84 Correct 701 ms 49592 KB Output is correct
85 Correct 398 ms 43628 KB Output is correct
86 Correct 514 ms 45956 KB Output is correct
87 Correct 274 ms 40816 KB Output is correct
88 Correct 473 ms 46444 KB Output is correct
89 Correct 446 ms 44460 KB Output is correct
90 Correct 494 ms 46188 KB Output is correct
91 Correct 327 ms 41872 KB Output is correct
92 Correct 483 ms 45736 KB Output is correct
93 Correct 269 ms 40660 KB Output is correct
94 Correct 512 ms 45788 KB Output is correct
95 Correct 305 ms 41356 KB Output is correct
96 Correct 470 ms 45784 KB Output is correct