oj.uz

Submission #124695

# Submission time Handle Problem Language Result Execution time Memory
124695 2019-07-03T17:34:05 Z MvC Two Antennas (JOI19_antennas) C++11
13 / 100
 3000 ms 22380 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,mx[nmax],x,l[nmax],r[nmax],t,c[nmax],mn;
vector<int>ad[nmax],re[nmax],qr[nmax];
pair<int,int>p,st[4*nmax];
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 upd(int x,int l,int r,int p,int v)
{
	if(l>r)return;
	if(l==r)
	{
		if(v==-1)st[x]=mkp(0,inf);
		else st[x]=mkp(v,v);
		return;
	}
	int mid=(l+r)/2;
	if(p<=mid)upd(2*x,l,mid,p,v);
	else upd(2*x+1,mid+1,r,p,v);
	st[x]=merge(st[2*x],st[2*x+1]);
}
pair<int,int> qry(int x,int l,int r,int tl,int tr)
{
	if(tl>r || tr<l)return mkp(0,inf);
	if(tl<=l && r<=tr)return st[x];
	int mid=(l+r)/2;
	return merge(qry(2*x,l,mid,tl,tr),qry(2*x+1,mid+1,r,tl,tr));
}
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);
		rs[i]=-1;
	}
	//for(i=1;i<=4*n;i++)st[i]=mkp(0,inf);
	for(i=1;i<=n;i++)
	{
		mx[i]=-1;
		c[i]=-1;
	}
	for(i=1;i<=n;i++)
	{
		/*for(j=0;j<ad[i].size();j++)
		{
			upd(1,1,n,ad[i][j],h[ad[i][j]]);
		}
		for(j=0;j<re[i].size();j++)
		{
			upd(1,1,n,re[i][j],-1);
		}
		if(i-a[i]>=1)
		{
			p=qry(1,1,n,max(i-b[i],1),max(i-a[i],1));
			if(!p.fr && p.sc==inf)continue;
			rs=max(rs,abs(p.fr-h[i]));
			rs=max(rs,abs(p.sc-h[i]));
		}*/
		for(j=0;j<ad[i].size();j++)
		{
			c[ad[i][j]]=h[ad[i][j]];
		}
		for(j=0;j<re[i].size();j++)
		{
			//mx[re[i][j]]=-1;
			c[re[i][j]]=-1;
		}
		if(i-a[i]>=1)
		{
			for(j=max(i-b[i],1);j<=max(i-a[i],1);j++)
			{
				if(c[j]==-1)
				{
					//dmn[j]=dmx[j]=-1;
					continue;
				}
				mx[j]=max(mx[j],abs(c[j]-h[i]));
			}
		}
		for(j=0;j<qr[i].size();j++)
		{
			x=l[qr[i][j]];
			mn=-1;
			for(t=x;t<=i;t++)
			{
				if(mx[t]!=-1)mn=max(mn,mx[t]);
			}
			rs[qr[i][j]]=mn;
		}
	}
	for(i=1;i<=q;i++)cout<<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:93:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<ad[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:97:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<re[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:114: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 16 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14456 KB Output is correct
4 Correct 16 ms 14456 KB Output is correct
5 Correct 16 ms 14456 KB Output is correct
6 Correct 19 ms 14456 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 17 ms 14584 KB Output is correct
9 Correct 16 ms 14456 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 16 ms 14456 KB Output is correct
12 Correct 16 ms 14456 KB Output is correct
13 Correct 16 ms 14456 KB Output is correct
14 Correct 16 ms 14484 KB Output is correct
15 Correct 16 ms 14456 KB Output is correct
16 Correct 16 ms 14456 KB Output is correct
17 Correct 16 ms 14456 KB Output is correct
18 Correct 19 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 19 ms 14584 KB Output is correct
22 Correct 16 ms 14456 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 16 ms 14456 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14456 KB Output is correct
4 Correct 16 ms 14456 KB Output is correct
5 Correct 16 ms 14456 KB Output is correct
6 Correct 19 ms 14456 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 17 ms 14584 KB Output is correct
9 Correct 16 ms 14456 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 16 ms 14456 KB Output is correct
12 Correct 16 ms 14456 KB Output is correct
13 Correct 16 ms 14456 KB Output is correct
14 Correct 16 ms 14484 KB Output is correct
15 Correct 16 ms 14456 KB Output is correct
16 Correct 16 ms 14456 KB Output is correct
17 Correct 16 ms 14456 KB Output is correct
18 Correct 19 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 19 ms 14584 KB Output is correct
22 Correct 16 ms 14456 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 16 ms 14456 KB Output is correct
25 Correct 105 ms 19576 KB Output is correct
26 Correct 34 ms 15224 KB Output is correct
27 Correct 192 ms 21624 KB Output is correct
28 Correct 217 ms 21820 KB Output is correct
29 Correct 110 ms 19496 KB Output is correct
30 Correct 158 ms 19320 KB Output is correct
31 Correct 100 ms 21060 KB Output is correct
32 Correct 217 ms 21752 KB Output is correct
33 Correct 156 ms 21240 KB Output is correct
34 Correct 112 ms 18020 KB Output is correct
35 Correct 179 ms 21628 KB Output is correct
36 Correct 217 ms 21752 KB Output is correct
37 Correct 109 ms 18168 KB Output is correct
38 Correct 181 ms 20864 KB Output is correct
39 Correct 43 ms 15480 KB Output is correct
40 Correct 174 ms 20728 KB Output is correct
41 Correct 132 ms 19064 KB Output is correct
42 Correct 176 ms 20756 KB Output is correct
43 Correct 69 ms 16636 KB Output is correct
44 Correct 176 ms 20728 KB Output is correct
45 Correct 44 ms 15608 KB Output is correct
46 Correct 178 ms 20728 KB Output is correct
47 Correct 62 ms 16120 KB Output is correct
48 Correct 176 ms 20700 KB Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 16 ms 14584 KB Output is correct
3 Correct 16 ms 14456 KB Output is correct
4 Correct 16 ms 14456 KB Output is correct
5 Correct 16 ms 14456 KB Output is correct
6 Correct 19 ms 14456 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 17 ms 14584 KB Output is correct
9 Correct 16 ms 14456 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 16 ms 14456 KB Output is correct
12 Correct 16 ms 14456 KB Output is correct
13 Correct 16 ms 14456 KB Output is correct
14 Correct 16 ms 14484 KB Output is correct
15 Correct 16 ms 14456 KB Output is correct
16 Correct 16 ms 14456 KB Output is correct
17 Correct 16 ms 14456 KB Output is correct
18 Correct 19 ms 14456 KB Output is correct
19 Correct 16 ms 14456 KB Output is correct
20 Correct 16 ms 14584 KB Output is correct
21 Correct 19 ms 14584 KB Output is correct
22 Correct 16 ms 14456 KB Output is correct
23 Correct 16 ms 14584 KB Output is correct
24 Correct 16 ms 14456 KB Output is correct
25 Correct 105 ms 19576 KB Output is correct
26 Correct 34 ms 15224 KB Output is correct
27 Correct 192 ms 21624 KB Output is correct
28 Correct 217 ms 21820 KB Output is correct
29 Correct 110 ms 19496 KB Output is correct
30 Correct 158 ms 19320 KB Output is correct
31 Correct 100 ms 21060 KB Output is correct
32 Correct 217 ms 21752 KB Output is correct
33 Correct 156 ms 21240 KB Output is correct
34 Correct 112 ms 18020 KB Output is correct
35 Correct 179 ms 21628 KB Output is correct
36 Correct 217 ms 21752 KB Output is correct
37 Correct 109 ms 18168 KB Output is correct
38 Correct 181 ms 20864 KB Output is correct
39 Correct 43 ms 15480 KB Output is correct
40 Correct 174 ms 20728 KB Output is correct
41 Correct 132 ms 19064 KB Output is correct
42 Correct 176 ms 20756 KB Output is correct
43 Correct 69 ms 16636 KB Output is correct
44 Correct 176 ms 20728 KB Output is correct
45 Correct 44 ms 15608 KB Output is correct
46 Correct 178 ms 20728 KB Output is correct
47 Correct 62 ms 16120 KB Output is correct
48 Correct 176 ms 20700 KB Output is correct
49 Execution timed out 3038 ms 22380 KB Time limit exceeded
50 Halted 0 ms 0 KB -