oj.uz

Submission #577473

# Submission time Handle Problem Language Result Execution time Memory
577473 2022-06-14T19:30:14 Z cheissmart Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 1359 ms 172496 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, N = 1e5 + 7;

vi rig[N], lef[N];
vi ls[20], rs[20];

int n;

struct segtree {
	pi t[N * 4]; // min, max
	vi a;
	void init(vi _a) {
		a = _a;
		assert(SZ(a) == n);
		build();
	}
	void pull(int v) {
		t[v].F = min(t[v * 2].F, t[v * 2 + 1].F);
		t[v].S = max(t[v * 2].S, t[v * 2 + 1].S);
	}
	void build(int v = 1, int tl = 0, int tr = n) {
		if(tr - tl == 1) {
			t[v] = {a[tl], a[tl]};
			return;
		}
		int tm = (tl + tr) / 2;
		build(v * 2, tl, tm);
		build(v * 2 + 1, tm, tr);
		pull(v);
	}
	int qry_min(int l, int r, int v = 1, int tl = 0, int tr = n) {
		if(l <= tl && tr <= r)
			return t[v].F;
		int tm = (tl + tr) / 2, ans = INF;
		if(l < tm) ans = min(ans, qry_min(l, r, v * 2, tl, tm));
		if(r > tm) ans = min(ans, qry_min(l, r, v * 2 + 1, tm, tr));
		return ans;
	}
	int qry_max(int l, int r, int v = 1, int tl = 0, int tr = n) {
		if(l <= tl && tr <= r)
			return t[v].S;
		int tm = (tl + tr) / 2, ans = -INF;
		if(l < tm) ans = max(ans, qry_max(l, r, v * 2, tl, tm));
		if(r > tm) ans = max(ans, qry_max(l, r, v * 2 + 1, tm, tr));
		return ans;
	}
} lt[20], rt[20];

signed main()
{
	IO_OP;

	int k, m;
	cin >> n >> k >> m;

	for(int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b, a--, b--;
		if(a < b) {
			rig[a].PB(b);
		} else {
			lef[a].PB(b);
		}
	}

	vi l(n), r(n);

	{
		multiset<int> s;
		for(int i = 0; i < n; i++) {
			for(int j:rig[i])
				s.insert(j);
			if(i - k >= 0)  for(int j:rig[i - k])
				s.erase(s.find(j));
			r[i] = i;
			if(s.size()) r[i] = max(r[i], *s.rbegin());
		}
	}
	{
		multiset<int> s;
		for(int i = n - 1; i >= 0; i--) {
			for(int j:lef[i])
				s.insert(j);
			if(i + k < n)  for(int j:lef[i + k])
				s.erase(s.find(j));
			l[i] = i;
			if(s.size()) l[i] = min(l[i], *s.begin());
		}	
	}

	auto go = [&] (int k) {
		ls[k] = l, rs[k] = r;
		lt[k].init(l), rt[k].init(r);
	};
	go(0);

	for(int k = 1; k < 20; k++) {
		l.clear(), r.clear();
		for(int i = 0; i < n; i++) {
			l.PB(lt[k - 1].qry_min(ls[k - 1][i], rs[k - 1][i] + 1));
			r.PB(rt[k - 1].qry_max(ls[k - 1][i], rs[k - 1][i] + 1));
		}
		go(k);
	}

	int q;
	cin >> q;
	while(q--) {
		int s, t;
		cin >> s >> t, s--, t--;
		assert(s != t);
		int l = s, r = s, ans = 0;
		for(int i = 19; i >= 0; i--) {
			int new_l = lt[i].qry_min(l, r + 1);
			int new_r = rt[i].qry_max(l, r + 1);
			if(new_l <= t && t <= new_r) continue;
			ans += 1 << i;
			l = new_l, r = new_r;
		}
		int new_l = lt[0].qry_min(l, r + 1);
		int new_r = rt[0].qry_max(l, r + 1);
		l = new_l, r = new_r;
		ans++;
		
		if(l <= t && t <= r) {
			cout << ans << '\n';
		} else {
			cout << -1 << '\n';
		}
	}

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 130276 KB Output is correct
2 Correct 50 ms 130260 KB Output is correct
3 Correct 49 ms 130260 KB Output is correct
4 Correct 51 ms 130252 KB Output is correct
5 Correct 58 ms 130304 KB Output is correct
6 Correct 53 ms 130356 KB Output is correct
7 Correct 56 ms 130420 KB Output is correct
8 Correct 49 ms 130252 KB Output is correct
9 Correct 50 ms 130284 KB Output is correct
10 Correct 56 ms 130160 KB Output is correct
11 Correct 54 ms 130316 KB Output is correct
12 Correct 58 ms 130348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 130276 KB Output is correct
2 Correct 50 ms 130260 KB Output is correct
3 Correct 49 ms 130260 KB Output is correct
4 Correct 51 ms 130252 KB Output is correct
5 Correct 58 ms 130304 KB Output is correct
6 Correct 53 ms 130356 KB Output is correct
7 Correct 56 ms 130420 KB Output is correct
8 Correct 49 ms 130252 KB Output is correct
9 Correct 50 ms 130284 KB Output is correct
10 Correct 56 ms 130160 KB Output is correct
11 Correct 54 ms 130316 KB Output is correct
12 Correct 58 ms 130348 KB Output is correct
13 Correct 67 ms 130992 KB Output is correct
14 Correct 62 ms 130944 KB Output is correct
15 Correct 57 ms 130920 KB Output is correct
16 Correct 57 ms 131036 KB Output is correct
17 Correct 65 ms 130956 KB Output is correct
18 Correct 55 ms 130996 KB Output is correct
19 Correct 66 ms 130908 KB Output is correct
20 Correct 53 ms 130932 KB Output is correct
21 Correct 55 ms 130964 KB Output is correct
22 Correct 58 ms 130904 KB Output is correct
23 Correct 60 ms 130992 KB Output is correct
24 Correct 63 ms 130948 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 166620 KB Output is correct
2 Correct 586 ms 166540 KB Output is correct
3 Correct 714 ms 167244 KB Output is correct
4 Correct 556 ms 166224 KB Output is correct
5 Correct 272 ms 169676 KB Output is correct
6 Correct 544 ms 171708 KB Output is correct
7 Correct 238 ms 171780 KB Output is correct
8 Correct 164 ms 166868 KB Output is correct
9 Correct 149 ms 166904 KB Output is correct
10 Correct 637 ms 169536 KB Output is correct
11 Correct 547 ms 169948 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 888 ms 167852 KB Output is correct
2 Correct 796 ms 170088 KB Output is correct
3 Correct 1207 ms 168500 KB Output is correct
4 Correct 379 ms 172424 KB Output is correct
5 Correct 362 ms 170320 KB Output is correct
6 Correct 385 ms 170380 KB Output is correct
7 Correct 946 ms 170632 KB Output is correct
8 Correct 795 ms 170668 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 931 ms 170104 KB Output is correct
2 Correct 1336 ms 168316 KB Output is correct
3 Correct 1200 ms 166060 KB Output is correct
4 Correct 1235 ms 164724 KB Output is correct
5 Correct 944 ms 164036 KB Output is correct
6 Correct 974 ms 163964 KB Output is correct
7 Correct 670 ms 168724 KB Output is correct
8 Correct 49 ms 130332 KB Output is correct
9 Correct 58 ms 130900 KB Output is correct
10 Correct 568 ms 168904 KB Output is correct
11 Correct 695 ms 169328 KB Output is correct
12 Correct 709 ms 168768 KB Output is correct
13 Correct 771 ms 169564 KB Output is correct
14 Correct 51 ms 130336 KB Output is correct
15 Correct 65 ms 130912 KB Output is correct
16 Correct 656 ms 168268 KB Output is correct
17 Correct 1154 ms 169604 KB Output is correct
18 Correct 1070 ms 169012 KB Output is correct
19 Correct 1000 ms 168952 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 130276 KB Output is correct
2 Correct 50 ms 130260 KB Output is correct
3 Correct 49 ms 130260 KB Output is correct
4 Correct 51 ms 130252 KB Output is correct
5 Correct 58 ms 130304 KB Output is correct
6 Correct 53 ms 130356 KB Output is correct
7 Correct 56 ms 130420 KB Output is correct
8 Correct 49 ms 130252 KB Output is correct
9 Correct 50 ms 130284 KB Output is correct
10 Correct 56 ms 130160 KB Output is correct
11 Correct 54 ms 130316 KB Output is correct
12 Correct 58 ms 130348 KB Output is correct
13 Correct 67 ms 130992 KB Output is correct
14 Correct 62 ms 130944 KB Output is correct
15 Correct 57 ms 130920 KB Output is correct
16 Correct 57 ms 131036 KB Output is correct
17 Correct 65 ms 130956 KB Output is correct
18 Correct 55 ms 130996 KB Output is correct
19 Correct 66 ms 130908 KB Output is correct
20 Correct 53 ms 130932 KB Output is correct
21 Correct 55 ms 130964 KB Output is correct
22 Correct 58 ms 130904 KB Output is correct
23 Correct 60 ms 130992 KB Output is correct
24 Correct 63 ms 130948 KB Output is correct
25 Correct 633 ms 166620 KB Output is correct
26 Correct 586 ms 166540 KB Output is correct
27 Correct 714 ms 167244 KB Output is correct
28 Correct 556 ms 166224 KB Output is correct
29 Correct 272 ms 169676 KB Output is correct
30 Correct 544 ms 171708 KB Output is correct
31 Correct 238 ms 171780 KB Output is correct
32 Correct 164 ms 166868 KB Output is correct
33 Correct 149 ms 166904 KB Output is correct
34 Correct 637 ms 169536 KB Output is correct
35 Correct 547 ms 169948 KB Output is correct
36 Correct 888 ms 167852 KB Output is correct
37 Correct 796 ms 170088 KB Output is correct
38 Correct 1207 ms 168500 KB Output is correct
39 Correct 379 ms 172424 KB Output is correct
40 Correct 362 ms 170320 KB Output is correct
41 Correct 385 ms 170380 KB Output is correct
42 Correct 946 ms 170632 KB Output is correct
43 Correct 795 ms 170668 KB Output is correct
44 Correct 931 ms 170104 KB Output is correct
45 Correct 1336 ms 168316 KB Output is correct
46 Correct 1200 ms 166060 KB Output is correct
47 Correct 1235 ms 164724 KB Output is correct
48 Correct 944 ms 164036 KB Output is correct
49 Correct 974 ms 163964 KB Output is correct
50 Correct 670 ms 168724 KB Output is correct
51 Correct 49 ms 130332 KB Output is correct
52 Correct 58 ms 130900 KB Output is correct
53 Correct 568 ms 168904 KB Output is correct
54 Correct 695 ms 169328 KB Output is correct
55 Correct 709 ms 168768 KB Output is correct
56 Correct 771 ms 169564 KB Output is correct
57 Correct 51 ms 130336 KB Output is correct
58 Correct 65 ms 130912 KB Output is correct
59 Correct 656 ms 168268 KB Output is correct
60 Correct 1154 ms 169604 KB Output is correct
61 Correct 1070 ms 169012 KB Output is correct
62 Correct 1000 ms 168952 KB Output is correct
63 Correct 1066 ms 167024 KB Output is correct
64 Correct 1359 ms 168068 KB Output is correct
65 Correct 1119 ms 167192 KB Output is correct
66 Correct 253 ms 170640 KB Output is correct
67 Correct 972 ms 172496 KB Output is correct
68 Correct 895 ms 169692 KB Output is correct
69 Correct 410 ms 170964 KB Output is correct
70 Correct 963 ms 170164 KB Output is correct
71 Correct 1096 ms 170160 KB Output is correct