제출 #528369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528369		8e7	Railway Trip 2 (JOI22_ho_t4)	C++17	100 / 100	707 ms	67436 KiB

Main

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int inf = 1<<30;
pii ed[200005];
vector<pii> el[maxn], er[maxn];

struct segtree{
	pii seg[4*maxn];
	void pull(int cur) {
		seg[cur] = {min(seg[cur*2].ff, seg[cur*2+1].ff), max(seg[cur*2].ss, seg[cur*2+1].ss)};
	}
	void init(int cur, int l, int r, pii arr[]){
		if (r <= l) return;
		if (r - l == 1) {
			seg[cur] = arr[l]; 
			return;
		}
		int m = (l + r) / 2;
		init(cur*2, l, m, arr), init(cur*2+1, m, r, arr);
		pull(cur);	
	}
	pii query(int cur, int l, int r, int ql, int qr) {
		if (r <= l || ql >= r || qr <= l) return make_pair(inf, 0);
		if (ql <= l && qr >= r) return seg[cur];
		int m = (l + r) / 2;
		pii le = query(cur*2, l, m, ql, qr), ri = query(cur*2+1, m, r, ql, qr);
		return make_pair(min(le.ff, ri.ff), max(le.ss, ri.ss));
	}
} tr[17];
pii ran[17][maxn];
int main() {
	io
	int n, k, m;
	cin >> n >> k >> m;
	for (int i = 0;i < m;i++) {
		cin >> ed[i].ff >> ed[i].ss;
		if (ed[i].ss > ed[i].ff) {
			er[min(ed[i].ss-1, ed[i].ff + k - 1)].push_back({ed[i].ss, 1});
			er[ed[i].ff - 1].push_back({ed[i].ss, -1});
		} else {
			el[max(ed[i].ss+1, ed[i].ff - k + 1)].push_back({ed[i].ss, 1});
			el[ed[i].ff + 1].push_back({ed[i].ss, -1});
		}
	}
	multiset<int> se;
	for (int i = 1;i <= n;i++) {
		for (auto p:el[i]) {
			if (p.ss == 1) se.insert(p.ff);	
			else se.erase(se.find(p.ff));
		}
		ran[0][i].ff = (se.size() ? *se.begin() : i);
	}
	se.clear();
	for (int i = n;i >= 1;i--) {
		for (auto p:er[i]) {
			if (p.ss == 1) se.insert(p.ff);	
			else se.erase(se.find(p.ff));
		}
		ran[0][i].ss = (se.size() ? *prev(se.end()) : i);
	}
	tr[0].init(1, 1, n+1, ran[0]);
	for (int i = 1;i < 17;i++) {
		for (int j = 1;j <= n;j++) {
			ran[i][j] = tr[i-1].query(1, 1, n+1, ran[i-1][j].ff, ran[i-1][j].ss+1);
		}
		tr[i].init(1, 1, n+1, ran[i]);
	}
	int q;
	cin >> q;
	while (q--) {
		int s, t;
		cin >> s >> t;
		int ans = 0;
		pii cur = {s, s};
		for (int i = 16;i >= 0;i--) {
			pii nxt = tr[i].query(1, 1, n+1, cur.ff, cur.ss+1);	
			if (t < nxt.ff || t > nxt.ss) {
				cur = nxt;
				ans += 1<<i;
			}
		}
		pii nxt = tr[0].query(1, 1, n+1, cur.ff, cur.ss+1);
		if (nxt.ff <= t && t <= nxt.ss) {
			cout << ans+1 << "\n";
		} else {
			cout << -1 << "\n";
		}
	}
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 11 / 11
• Subtask 4: 25 / 25
• Subtask 5: 35 / 35
• Subtask 6: 13 / 13