oj.uz

Submission #527724

# Submission time Handle Problem Language Result Execution time Memory
527724 2022-02-18T05:36:05 Z 8e7 Railway Trip 2 (JOI22_ho_t4) C++17
87 / 100
 353 ms 39928 KB 
//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];
int rig[maxn], lef[maxn];
vector<pii> el[maxn], er[maxn];

struct segtree{
	int type = 0;
	pii seg[4*maxn];
	void pull(int cur) {
		if (type) seg[cur] = max(seg[cur*2], seg[cur*2+1]);
		else seg[cur] = min(seg[cur*2], seg[cur*2+1]);
	}
	void init(int cur, int l, int r){
		if (r <= l) return;
		if (r - l == 1) {
			seg[cur] = {(type ? 0 : inf), l}; 
			return;
		}
		int m = (l + r) / 2;
		init(cur*2, l, m), init(cur*2+1, m, r);
		pull(cur);	
	}
	void modify(int cur, int l, int r, int ind, int val) {
		if (r <= l) return;
		if (r - l == 1) {
			seg[cur] = {val, l};
			return;
		}
		int m = (l + r) / 2;
		if (ind < m) modify(cur*2, l, m, ind, val);
		else modify(cur*2+1, m, r, ind, val);
		pull(cur);
	}
	pii query(int cur, int l, int r, int ql, int qr) {
		if (r <= l || ql >= r || qr <= l) return type ? make_pair(0, 0) : 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 type ? max(le, ri) : min(le, ri);
	}
} sl, sr;

int tol[17][maxn], tor[17][maxn];

vector<int> adj[maxn];
int dis[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));
		}
		lef[i] = (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));
		}
		rig[i] = (se.size() ? *prev(se.end()) : i);
	}

	sl.init(1, 1, n+1);
	sr.type = 1;
	sr.init(1, 1, n+1);
	for (int i = 1;i <= n;i++) {
		sl.modify(1, 1, n+1, i, lef[i]);
		sr.modify(1, 1, n+1, i, rig[i]);
	}
	for (int i = 1;i <= n;i++) {
		pii nxt = sr.query(1, 1, n+1, i+1, rig[i]+1);	
		tor[0][i] = nxt.ss;
		adj[i].push_back(nxt.ss);

		nxt = sl.query(1, 1, n+1, i+1, rig[i]+1);	
		adj[i].push_back(nxt.ss);

		nxt = sl.query(1, 1, n+1, lef[i], i);	
		tol[0][i] = nxt.ss;
		adj[i].push_back(nxt.ss);

		nxt = sr.query(1, 1, n+1, lef[i], i);	
		adj[i].push_back(nxt.ss);
	}
	pary(lef + 1, lef + n + 1);	
	pary(rig + 1, rig + n + 1);

	lef[0] = 0;
	rig[0] = n+1;
	pary(tol[0] + 1, tol[0] + n + 1);
	pary(tor[0] + 1, tor[0] + n + 1);

	for (int i = 1;i < 17;i++) {
		for (int j = 1;j <= n;j++) {
			tol[i][j] = tol[i-1][tol[i-1][j]];
			tor[i][j] = tor[i-1][tor[i-1][j]];
		}
	}
	//brute force
	for (int i = 1;i <= n;i++) {
		adj[i].push_back(tol[0][i]);
		adj[i].push_back(tor[0][i]);
	}
	int q;
	cin >> q;
	if (q == 1 || n <= 2000) {
		while (q--) {
			int s, t;
			cin >> s >> t;
			for (int i = 1;i <= n;i++) dis[i] = inf;
			dis[s] = 0;
			queue<int> que;
			que.push(s);	
			int ans = inf;
			while (que.size()) {
				int cur = que.front();que.pop();
				if ((lef[cur] <= t && t <= cur) || (rig[cur] >= t && t > cur)) {
					ans = dis[cur];
					break;
				}
				for (int v:adj[cur]) {
					if (dis[v] > dis[cur] + 1) {
						dis[v] = dis[cur] + 1;
						que.push(v);
					}
				}
			}
			cout << (ans == inf ? -1 : ans+1) << "\n";
		}
	} else {
		while (q--) {
			int s, t;
			cin >> s >> t;
			int ans = 0;
			if (s < t) {
				for (int i = 16;i >= 0;i--) {
					if (rig[tor[i][s]] < t) {
						s = tor[i][s];
						ans += 1<<i;
					}
				}
				//debug(s, rig[s]);
				if (rig[s] >= t) ans++;
				else if (rig[tor[0][s]] >= t && tor[0][s] != 0) ans += 2;
				else ans = -1;
			} else {
				for (int i = 16;i >= 0;i--) {
					if (lef[tol[i][s]] > t) {
						s = tol[i][s];
						ans += 1<<i;
					}
				}
				//debug(s, rig[s]);
				if (lef[s] <= t) ans++;
				else if (lef[tol[0][s]] <= t && tol[0][s] != 0) ans += 2;
				else ans = -1;
			}
			cout << ans << "\n";
			//debug();
		}
	}
	
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:13:19: warning: statement has no effect [-Wunused-value]
   13 | #define pary(...) 0
      |                   ^
Main.cpp:120:2: note: in expansion of macro 'pary'
  120 |  pary(lef + 1, lef + n + 1);
      |  ^~~~
Main.cpp:13:19: warning: statement has no effect [-Wunused-value]
   13 | #define pary(...) 0
      |                   ^
Main.cpp:121:2: note: in expansion of macro 'pary'
  121 |  pary(rig + 1, rig + n + 1);
      |  ^~~~
Main.cpp:13:19: warning: statement has no effect [-Wunused-value]
   13 | #define pary(...) 0
      |                   ^
Main.cpp:125:2: note: in expansion of macro 'pary'
  125 |  pary(tol[0] + 1, tol[0] + n + 1);
      |  ^~~~
Main.cpp:13:19: warning: statement has no effect [-Wunused-value]
   13 | #define pary(...) 0
      |                   ^
Main.cpp:126:2: note: in expansion of macro 'pary'
  126 |  pary(tor[0] + 1, tor[0] + n + 1);
      |  ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7644 KB Output is correct
2 Correct 5 ms 7628 KB Output is correct
3 Correct 5 ms 7628 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 4 ms 7656 KB Output is correct
7 Correct 5 ms 7628 KB Output is correct
8 Correct 4 ms 7628 KB Output is correct
9 Correct 5 ms 7628 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 5 ms 7628 KB Output is correct
12 Correct 6 ms 7628 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7644 KB Output is correct
2 Correct 5 ms 7628 KB Output is correct
3 Correct 5 ms 7628 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 4 ms 7656 KB Output is correct
7 Correct 5 ms 7628 KB Output is correct
8 Correct 4 ms 7628 KB Output is correct
9 Correct 5 ms 7628 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 5 ms 7628 KB Output is correct
12 Correct 6 ms 7628 KB Output is correct
13 Correct 32 ms 8140 KB Output is correct
14 Correct 27 ms 8140 KB Output is correct
15 Correct 7 ms 8140 KB Output is correct
16 Correct 53 ms 8144 KB Output is correct
17 Correct 14 ms 8140 KB Output is correct
18 Correct 8 ms 8140 KB Output is correct
19 Correct 9 ms 8172 KB Output is correct
20 Correct 11 ms 8140 KB Output is correct
21 Correct 7 ms 8140 KB Output is correct
22 Correct 10 ms 8160 KB Output is correct
23 Correct 21 ms 8152 KB Output is correct
24 Correct 14 ms 8140 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 34116 KB Output is correct
2 Correct 158 ms 34148 KB Output is correct
3 Correct 166 ms 34452 KB Output is correct
4 Correct 175 ms 34124 KB Output is correct
5 Correct 312 ms 39176 KB Output is correct
6 Correct 209 ms 38536 KB Output is correct
7 Correct 254 ms 39928 KB Output is correct
8 Correct 193 ms 35572 KB Output is correct
9 Correct 206 ms 35568 KB Output is correct
10 Correct 281 ms 39204 KB Output is correct
11 Correct 240 ms 39204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 35348 KB Output is correct
2 Correct 329 ms 38980 KB Output is correct
3 Correct 192 ms 34492 KB Output is correct
4 Correct 236 ms 39740 KB Output is correct
5 Correct 304 ms 38980 KB Output is correct
6 Correct 336 ms 38852 KB Output is correct
7 Correct 264 ms 39072 KB Output is correct
8 Correct 328 ms 39092 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 38012 KB Output is correct
2 Correct 186 ms 34516 KB Output is correct
3 Correct 183 ms 32452 KB Output is correct
4 Correct 154 ms 31412 KB Output is correct
5 Correct 150 ms 30848 KB Output is correct
6 Correct 166 ms 30636 KB Output is correct
7 Correct 168 ms 35128 KB Output is correct
8 Correct 5 ms 7628 KB Output is correct
9 Correct 9 ms 8140 KB Output is correct
10 Correct 296 ms 38128 KB Output is correct
11 Correct 353 ms 38020 KB Output is correct
12 Correct 305 ms 37956 KB Output is correct
13 Correct 289 ms 37828 KB Output is correct
14 Correct 5 ms 7628 KB Output is correct
15 Correct 27 ms 8156 KB Output is correct
16 Correct 217 ms 38212 KB Output is correct
17 Correct 254 ms 38080 KB Output is correct
18 Correct 247 ms 38092 KB Output is correct
19 Correct 241 ms 38212 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7644 KB Output is correct
2 Correct 5 ms 7628 KB Output is correct
3 Correct 5 ms 7628 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 4 ms 7656 KB Output is correct
7 Correct 5 ms 7628 KB Output is correct
8 Correct 4 ms 7628 KB Output is correct
9 Correct 5 ms 7628 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 5 ms 7628 KB Output is correct
12 Correct 6 ms 7628 KB Output is correct
13 Correct 32 ms 8140 KB Output is correct
14 Correct 27 ms 8140 KB Output is correct
15 Correct 7 ms 8140 KB Output is correct
16 Correct 53 ms 8144 KB Output is correct
17 Correct 14 ms 8140 KB Output is correct
18 Correct 8 ms 8140 KB Output is correct
19 Correct 9 ms 8172 KB Output is correct
20 Correct 11 ms 8140 KB Output is correct
21 Correct 7 ms 8140 KB Output is correct
22 Correct 10 ms 8160 KB Output is correct
23 Correct 21 ms 8152 KB Output is correct
24 Correct 14 ms 8140 KB Output is correct
25 Correct 181 ms 34116 KB Output is correct
26 Correct 158 ms 34148 KB Output is correct
27 Correct 166 ms 34452 KB Output is correct
28 Correct 175 ms 34124 KB Output is correct
29 Correct 312 ms 39176 KB Output is correct
30 Correct 209 ms 38536 KB Output is correct
31 Correct 254 ms 39928 KB Output is correct
32 Correct 193 ms 35572 KB Output is correct
33 Correct 206 ms 35568 KB Output is correct
34 Correct 281 ms 39204 KB Output is correct
35 Correct 240 ms 39204 KB Output is correct
36 Correct 206 ms 35348 KB Output is correct
37 Correct 329 ms 38980 KB Output is correct
38 Correct 192 ms 34492 KB Output is correct
39 Correct 236 ms 39740 KB Output is correct
40 Correct 304 ms 38980 KB Output is correct
41 Correct 336 ms 38852 KB Output is correct
42 Correct 264 ms 39072 KB Output is correct
43 Correct 328 ms 39092 KB Output is correct
44 Correct 296 ms 38012 KB Output is correct
45 Correct 186 ms 34516 KB Output is correct
46 Correct 183 ms 32452 KB Output is correct
47 Correct 154 ms 31412 KB Output is correct
48 Correct 150 ms 30848 KB Output is correct
49 Correct 166 ms 30636 KB Output is correct
50 Correct 168 ms 35128 KB Output is correct
51 Correct 5 ms 7628 KB Output is correct
52 Correct 9 ms 8140 KB Output is correct
53 Correct 296 ms 38128 KB Output is correct
54 Correct 353 ms 38020 KB Output is correct
55 Correct 305 ms 37956 KB Output is correct
56 Correct 289 ms 37828 KB Output is correct
57 Correct 5 ms 7628 KB Output is correct
58 Correct 27 ms 8156 KB Output is correct
59 Correct 217 ms 38212 KB Output is correct
60 Correct 254 ms 38080 KB Output is correct
61 Correct 247 ms 38092 KB Output is correct
62 Correct 241 ms 38212 KB Output is correct
63 Incorrect 163 ms 33732 KB Output isn't correct
64 Halted 0 ms 0 KB -