Submission #259487

#	Time	Username	Problem	Language	Result	Execution time	Memory
259487		dorijanlendvaj	Two Antennas (JOI19_antennas)	C++14	35 / 100	299 ms	29304 KiB

antennas

//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=400010,M=1<<18;
int t,n,q,h[N],a[N],b[N],dp[2010][2010];
int seg1[M*2+10],seg2[M*2+10];
vector<pii> ev[N];

void upd(int i,int x)
{
	i+=M;
	if (x!=-1) seg1[i]=seg2[i]=x;
	else seg1[i]=0,seg2[i]=MOD;
	for (i/=2;i;i/=2) seg1[i]=max(seg1[i*2],seg1[i*2+1]),seg2[i]=min(seg2[i*2],seg2[i*2+1]);
}

int ge1(int l,int r,int lo=0,int hi=M,int i=1)
{
	if (lo>=l && hi<=r) return seg1[i];
	if (lo>=r || hi<=l) return 0;
	int mid=(lo+hi)/2;
	return max(ge1(l,r,lo,mid,i*2),ge1(l,r,mid,hi,i*2+1));
}

int ge2(int l,int r,int lo=0,int hi=M,int i=1)
{
	if (lo>=l && hi<=r) return seg2[i];
	if (lo>=r || hi<=l) return MOD;
	int mid=(lo+hi)/2;
	return min(ge2(l,r,lo,mid,i*2),ge2(l,r,mid,hi,i*2+1));
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)[phone]);
	cin>>n;
	for (int i=0;i<n;++i) cin>>h[i]>>a[i]>>b[i];
	if (n<=2000)
	{
		memset(dp,-1,sizeof(dp));
		for (int i=0;i<n;++i) for (int j=i+1;j<n;++j)
		{
			if (j-i>=a[i] && j-i>=a[j] && j-i<=b[i] && j-i<=b[j]) dp[i][j]=abs(h[i]-h[j]);
		}
		for (int le=1;le<n;++le)
		{
			for (int i=0;i<n-le;++i) dp[i][i+le+1]=max(dp[i][i+le],dp[i][i+le+1]);
			for (int i=1;i<n-le;++i) dp[i-1][i+le]=max(dp[i][i+le],dp[i-1][i+le]);
		}
		cin>>q;
		while (q--)
		{
			int l,r;
			cin>>l>>r;
			--l;
			--r;
			cout<<dp[l][r]<<en;
		}
	}
	else
	{
		memset(seg2,63,sizeof(seg2));
		int re=0;
		for (int i=0;i<n;++i)
		{
			for (auto a: ev[i])
			{
				upd(a.x,a.y);
			}
			int mi=ge2(i-b[i],i-a[i]+1);
			int ma=ge1(i-b[i],i-a[i]+1);
			/*cout<<i-b[i]<<' '<<i-a[i]+1<<' '<<mi<<' '<<h[i]<<' '<<ma<<' '<<re<<' '<<h[i]-mi<<' '<<ma-h[i]<<endl;
			for (int j=0;j<n;++j) cout<<seg1[i+M]<<' ';
			cout<<en<<en;*/
			re=max(re,h[i]-mi);
			re=max(re,ma-h[i]);
			ev[i+a[i]].eb(i,h[i]);
			ev[i+b[i]+1].eb(i,-1);
		}
		cout<<re<<en;
	}
}

• Subtask 1: 2 / 2
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 0 / 65