oj.uz

Submission #124025

# Submission time Handle Problem Language Result Execution time Memory
124025 2019-07-02T11:29:14 Z MvC Two Antennas (JOI19_antennas) C++11
22 / 100
 265 ms 27728 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=-1,h[nmax],a[nmax],b[nmax];
vector<int>ad[nmax],re[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);
	}
	for(i=1;i<=4*n;i++)st[i]=mkp(0,inf);
	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]));
		}
	}
	cout<<rs<<endl;
    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:66:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<ad[i].size();j++)
           ~^~~~~~~~~~~~~
antennas.cpp:70:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<re[i].size();j++)
           ~^~~~~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 21868 KB Output is correct
2 Correct 225 ms 27628 KB Output is correct
3 Correct 153 ms 22252 KB Output is correct
4 Correct 225 ms 27600 KB Output is correct
5 Correct 96 ms 17904 KB Output is correct
6 Correct 219 ms 27624 KB Output is correct
7 Correct 196 ms 25068 KB Output is correct
8 Correct 265 ms 27728 KB Output is correct
9 Correct 53 ms 12664 KB Output is correct
10 Correct 230 ms 27724 KB Output is correct
11 Correct 139 ms 20976 KB Output is correct
12 Correct 229 ms 27628 KB Output is correct
13 Correct 160 ms 25068 KB Output is correct
14 Correct 152 ms 25176 KB Output is correct
15 Correct 153 ms 25108 KB Output is correct
16 Correct 145 ms 25324 KB Output is correct
17 Correct 161 ms 25088 KB Output is correct
18 Correct 158 ms 25320 KB Output is correct
19 Correct 154 ms 25212 KB Output is correct
20 Correct 151 ms 24876 KB Output is correct
21 Correct 145 ms 25152 KB Output is correct
22 Correct 151 ms 25060 KB Output is correct
23 Correct 160 ms 25028 KB Output is correct
24 Correct 152 ms 25196 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 9720 KB Output isn't correct
2 Halted 0 ms 0 KB -