Submission #527716

# Submission time Handle Problem Language Result Execution time Memory
527716 2022-02-18T05:11:31 Z 8e7 Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
2000 ms 27464 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), 0}; 
			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);
	//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;
	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";
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:14:19: warning: statement has no effect [-Wunused-value]
   14 | #define pary(...) 0
      |                   ^
Main.cpp:122:2: note: in expansion of macro 'pary'
  122 |  pary(lef + 1, lef + n + 1);
      |  ^~~~
Main.cpp:14:19: warning: statement has no effect [-Wunused-value]
   14 | #define pary(...) 0
      |                   ^
Main.cpp:123:2: note: in expansion of macro 'pary'
  123 |  pary(rig + 1, rig + n + 1);
      |  ^~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 4 ms 7372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 4 ms 7372 KB Output is correct
13 Correct 30 ms 7756 KB Output is correct
14 Correct 25 ms 7728 KB Output is correct
15 Correct 6 ms 7628 KB Output is correct
16 Correct 39 ms 7748 KB Output is correct
17 Correct 13 ms 7756 KB Output is correct
18 Correct 8 ms 7760 KB Output is correct
19 Correct 9 ms 7764 KB Output is correct
20 Correct 9 ms 7780 KB Output is correct
21 Correct 6 ms 7760 KB Output is correct
22 Correct 9 ms 7756 KB Output is correct
23 Correct 21 ms 7764 KB Output is correct
24 Correct 13 ms 7756 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 152 ms 21588 KB Output is correct
2 Correct 157 ms 21612 KB Output is correct
3 Correct 171 ms 21952 KB Output is correct
4 Correct 141 ms 21640 KB Output is correct
5 Correct 277 ms 26852 KB Output is correct
6 Correct 206 ms 25920 KB Output is correct
7 Correct 207 ms 27464 KB Output is correct
8 Correct 194 ms 22988 KB Output is correct
9 Correct 196 ms 23096 KB Output is correct
10 Correct 246 ms 26676 KB Output is correct
11 Correct 232 ms 26740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 2076 ms 23104 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 25796 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 4 ms 7372 KB Output is correct
13 Correct 30 ms 7756 KB Output is correct
14 Correct 25 ms 7728 KB Output is correct
15 Correct 6 ms 7628 KB Output is correct
16 Correct 39 ms 7748 KB Output is correct
17 Correct 13 ms 7756 KB Output is correct
18 Correct 8 ms 7760 KB Output is correct
19 Correct 9 ms 7764 KB Output is correct
20 Correct 9 ms 7780 KB Output is correct
21 Correct 6 ms 7760 KB Output is correct
22 Correct 9 ms 7756 KB Output is correct
23 Correct 21 ms 7764 KB Output is correct
24 Correct 13 ms 7756 KB Output is correct
25 Correct 152 ms 21588 KB Output is correct
26 Correct 157 ms 21612 KB Output is correct
27 Correct 171 ms 21952 KB Output is correct
28 Correct 141 ms 21640 KB Output is correct
29 Correct 277 ms 26852 KB Output is correct
30 Correct 206 ms 25920 KB Output is correct
31 Correct 207 ms 27464 KB Output is correct
32 Correct 194 ms 22988 KB Output is correct
33 Correct 196 ms 23096 KB Output is correct
34 Correct 246 ms 26676 KB Output is correct
35 Correct 232 ms 26740 KB Output is correct
36 Execution timed out 2076 ms 23104 KB Time limit exceeded
37 Halted 0 ms 0 KB -