제출 #860760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
860760		browntoad	Two Antennas (JOI19_antennas)	C++14	13 / 100	414 ms	524288 KiB

antennas

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define f first
#define s second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define SZ(x) (int)((x).size())

const ll maxn = 2e5+5;
const ll inf = (1ll<<60);
const ll mod = 1e9+7;

vector<int> seg(4*maxn);

int query(int l, int r, int nl, int nr, int x){
	if (l > nr || r < nl) return -1;
	if (l <= nl && nr <= r) return seg[x];
	int mid = (nl+nr)>>1;
	return max(query(l, r, nl, mid, x+x), query(l, r, mid+1, nr, x+x+1));
}
void modify(int l, int r, int p, int v, int x){
	if (l == r){
		seg[x] = max(seg[x], v);
		return;
	}
	int mid = (l+r)>>1;
	if (l <= p && p <= mid){
		modify(l, mid, p, v, x+x);
	}
	else modify(mid+1, r, p, v, x+x+1);
	seg[x] = max(seg[x+x], seg[x+x+1]);
}

vector<int> ans(maxn);
int n, q;
vector<pip> in;
vector<pip> md, qu;
bool cmp(pip a, pip b){
	return a.s.s < b.s.s;
}
signed main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	fill(ALL(seg), -1);
	cin>>n;
	in.pb({0, {0, 0}});
	REP1(i, n){
		int h, a, b; cin>>h>>a>>b;
		in.pb({h, {a, b}});
		for (int j = i-a; j >= 1; j--){
			if (i-j > b) break;
			if (in[j].s.f <= i-j && in[j].s.s >= i-j){
				md.pb({abs(in[j].f-in[i].f), {j, i}});
			}
		}
	}
	cin>>q;
	REP(i, q){
		int l, r; cin>>l>>r;
		qu.pb({i, {l, r}});
	}

	sort(ALL(md), cmp);
	sort(ALL(qu), cmp);
	int pa = 0;
	REP(i, q){
		while(pa < SZ(md) && md[pa].s.s <= qu[i].s.s){
			modify(1, n, md[pa].s.f, md[pa].f, 1);
			pa++;
		}
		ans[qu[i].f] = query(qu[i].s.f, qu[i].s.s, 1, n, 1);
	}
	REP(i, q) cout<<ans[i]<<endl;
}

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