제출 #1180205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180205		ByeWorld	Two Antennas (JOI19_antennas)	C++20	0 / 100	3095 ms	13964 KiB

antennas

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
// #define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 2e5+10;
const int MAXA = 1e9;
const int INF = 2e9+100;
const int SQRT = 450;
const int LOG = 19;
const int MOD = 998244353;
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
int sum(int a, int b){ a %= MOD; b %= MOD; return (a+b)%MOD; }
void chsum(int &a, int b){ a %= MOD; b %= MOD; a = (a+b)%MOD; }
void chsub(int &a, int b){ a %= MOD; b %= MOD; a = (a+MOD-b)%MOD; }
int mul(int a, int b){ a %= MOD; b %= MOD; return a*b%MOD;}
void chmul(int &a, int b){ a = a*b%MOD; }
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te, te);
	return (b%2 ? mul(te, a) : te);
}

int n, h[MAXN], a[MAXN], b[MAXN];

struct segtree {
	int st[4*MAXN];
	void bd(int id,int l, int r){
		st[id] = INF;
		if(l==r) return;
		bd(lf,l,md); bd(rg,md+1,r);
	}
	int que(int id,int l, int r,int x,int y){
		if(x<=l && r<=y) return st[id];
		if(r<x || y<l) return INF;
		return min(que(lf,l,md,x,y), que(rg,md+1,r,x,y));
	}
	int upd(int id,int l, int r,int x,int y){
		if(l==r && l==x) return st[id] = y;
		if(r<x || x<l) return st[id];
		return st[id] = min(upd(lf,l,md,x,y), upd(rg,md+1,r,x,y));
	}
} MN;
struct seg {
	int st[4*MAXN];
	void bd(int id,int l, int r){
		st[id] = -INF;
		if(l==r) return;
		bd(lf,l,md); bd(rg,md+1,r);
	}
	int que(int id,int l, int r,int x,int y){
		if(x<=l && r<=y) return st[id];
		if(r<x || y<l) return -INF;
		return max(que(lf,l,md,x,y), que(rg,md+1,r,x,y));
	}
	int upd(int id,int l, int r,int x,int y){
		if(l==r && l==x) return st[id] = y;
		if(r<x || x<l) return st[id];
		return st[id] = max(upd(lf,l,md,x,y), upd(rg,md+1,r,x,y));
	}
} MX;
vector<int>vec[MAXN];
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>h[i]>>a[i]>>b[i];
		if(i+a[i]<=n) vec[i+a[i]].pb(i); 
		if(i+b[i]+1<=n) vec[i+b[i]+1].pb(-i);
	}
	int ANS = -1;
	for(int sta=1; sta<=n; sta+=SQRT){
		MX.bd(1,1,n); MN.bd(1,1,n);
		for(int i=sta; i<=n; i++){
			for(auto id : vec[i]){
				if(id<0){
					id = -id;
					MX.upd(1,1,n,id,-INF); MN.upd(1,1,n,id,INF);
				} else {
					MX.upd(1,1,n,id,h[id]); MN.upd(1,1,n,id,h[id]);
				}
			}

			if(i-a[i] <= 0) continue;
			int le = max(1, i-b[i]);
			int mx = MX.que(1,1,n,le,i-a[i]);
			int mn = MN.que(1,1,n,le,i-a[i]);
			// cout << i << ' ' << mx << ' ' << mn << " mn\n";
			chmx(ANS, max(mx-h[i], h[i]-mn));
		}
	}

	int Q; cin>>Q;
	while(Q--){
		int l, r;cin>>l>>r;
		cout << ANS << '\n';
	}
} 

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