oj.uz

Submission #530319

# Submission time Handle Problem Language Result Execution time Memory
530319 2022-02-25T04:08:41 Z yungyao Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 2000 ms 14080 KB 
using namespace std;
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>

typedef long long LL;
typedef pair<int,int> pii;
#define pb push_back
#define mkp make_pair
#define F first
#define S second
#define iter(x) x.begin(),x.end()
#define REP(n) for (int __=n;__--;)
#define REP0(i,n) for (int i=0;i<n;++i)
#define REP1(i,n) for (int i=1;i<=n;++i)

const int maxn = 1e5+10, mod = 0;
const LL inf = 0;

int mx[maxn], mn[maxn];
struct segmenttree{
	int val[maxn*4], type;

	int pull(int l, int r){
		return type == 1 ? max(l, r) : min(l, r);
	}
	void maketree(int cur, int LB, int RB){
		if (LB == RB){
			if (type == 1) val[cur] = mx[LB];
			else val[cur] = mn[LB];
		}
		else{
			int m = (LB + RB) / 2;
			maketree(cur*2, LB, m);
			maketree(cur*2+1, m+1, RB);
			val[cur] = pull(val[cur*2], val[cur*2+1]);
		}
	}
	void init(int n, int _type){
		type = _type;
		maketree(1, 1 ,n);
	}
	int query(int l, int r, int cur, int LB, int RB){
		if (l == LB and r == RB) return val[cur];
		int m = (LB + RB) / 2;
		if (r <= m) return query(l, r, cur*2, LB, m);
		else if (l > m) return query(l, r, cur*2+1, m+1, RB);
		else return pull(query(l, m, cur*2, LB, m), query(m+1, r, cur*2+1, m+1, RB));
	}
}seg[2];

void solve2(int n, int m){
	vector <int> mx[17], mn[17];
	REP0(i, 17){mx[i].resize(n+1); mn[i].resize(n+1);}
	REP1(i, n){mx[0][i] = i; mn[0][i] = i;}
	REP(m){
		int a, b;

		cin >> a >> b;
		mx[0][a] = max(mx[0][a], b);
		mn[0][a] = min(mn[0][a], b);
	}
	REP1(i, n) mx[0][i] = max(mx[0][i], mx[0][i-1]);
	for (int i=n-1;i;--i) mn[0][i] = min(mn[0][i], mn[0][i+1]);
	REP1(i, 16) REP1(j, n){
		mx[i][j] = mx[i-1][mx[i-1][j]];
		mn[i][j] = mn[i-1][mn[i-1][j]];
	}
	int q;

	cin >> q;
	REP(q){
		int s, t;

		cin >> s >> t;
		int ans = 0;
		if (s < t){
			for (int i=16;i>=0;--i){
				if (mx[i][s] < t){
					s = mx[i][s];
					ans |= 1 << i;
				}
			}
			if (mx[0][s] < t) ans = -1;
			else ++ans;
		}
		else{
			for (int i=16;i>=0;--i){
				if (mn[i][s] > t){
					s = mn[i][s];
					ans |= 1 << i;
				}
			}
			if (mn[0][s] > t) ans = -1;
			else ++ans;
		}
		cout << ans << '\n';
	}
}

void solve(){
	int n, k, m, q;

	cin >> n >> k >> m;
	if (k == n-1){
		solve2(n, m);
		return;
	}
	REP1(i, n) mn[i] = mx[i] = i;
	REP(m){
		int a, b;

		cin >> a >> b;
		mx[a] = max(mx[a], b);
		mn[a] = min(mn[a], b);
	}
	deque <pii> dq;
	REP1(i, n){
		while (!dq.empty() and mx[i] >= dq.back().F) dq.pop_back();
		dq.push_back(mkp(mx[i], i));
		if (dq.front().S + k <= i) dq.pop_front();
		mx[i] = dq.front().F;
	}
	while (!dq.empty()) dq.pop_back();
	for (int i=n;i;--i){
		while (!dq.empty() and mn[i] <= dq.back().F) dq.pop_back();
		dq.push_back(mkp(mn[i], i));
		if (dq.front().S - k >= i) dq.pop_front();
		mn[i] = dq.front().F;
	}
	seg[0].init(n, 1);
	seg[1].init(n, 2);
	cin >> q;
	REP(q){
		int s, t;

		cin >> s >> t;
		pii r = mkp(s, s);
		int cnt = 0;
		while (t < r.F or t > r.S){
			++cnt;
			pii nr = mkp(seg[1].query(r.F, r.S, 1, 1, n), seg[0].query(r.F, r.S, 1, 1, n));
			if (r == nr){
				cnt = -1;
				break;
			}
			r = nr;
		}
		cout << cnt << '\n';
	}
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	solve();

	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 241 ms 368 KB Output is correct
14 Correct 126 ms 368 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 56 ms 372 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 4 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3152 KB Output is correct
2 Correct 23 ms 3020 KB Output is correct
3 Correct 26 ms 3152 KB Output is correct
4 Correct 17 ms 3148 KB Output is correct
5 Correct 32 ms 3012 KB Output is correct
6 Correct 31 ms 3140 KB Output is correct
7 Correct 36 ms 13644 KB Output is correct
8 Correct 20 ms 3140 KB Output is correct
9 Correct 22 ms 13644 KB Output is correct
10 Correct 33 ms 3012 KB Output is correct
11 Correct 39 ms 13644 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 13856 KB Output is correct
2 Correct 55 ms 14080 KB Output is correct
3 Correct 52 ms 14080 KB Output is correct
4 Correct 60 ms 13972 KB Output is correct
5 Correct 50 ms 13756 KB Output is correct
6 Correct 51 ms 13908 KB Output is correct
7 Correct 56 ms 13956 KB Output is correct
8 Correct 65 ms 13968 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 3220 KB Output is correct
2 Execution timed out 2080 ms 3016 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 241 ms 368 KB Output is correct
14 Correct 126 ms 368 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 56 ms 372 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 4 ms 332 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 24 ms 3152 KB Output is correct
26 Correct 23 ms 3020 KB Output is correct
27 Correct 26 ms 3152 KB Output is correct
28 Correct 17 ms 3148 KB Output is correct
29 Correct 32 ms 3012 KB Output is correct
30 Correct 31 ms 3140 KB Output is correct
31 Correct 36 ms 13644 KB Output is correct
32 Correct 20 ms 3140 KB Output is correct
33 Correct 22 ms 13644 KB Output is correct
34 Correct 33 ms 3012 KB Output is correct
35 Correct 39 ms 13644 KB Output is correct
36 Correct 42 ms 13856 KB Output is correct
37 Correct 55 ms 14080 KB Output is correct
38 Correct 52 ms 14080 KB Output is correct
39 Correct 60 ms 13972 KB Output is correct
40 Correct 50 ms 13756 KB Output is correct
41 Correct 51 ms 13908 KB Output is correct
42 Correct 56 ms 13956 KB Output is correct
43 Correct 65 ms 13968 KB Output is correct
44 Correct 75 ms 3220 KB Output is correct
45 Execution timed out 2080 ms 3016 KB Time limit exceeded
46 Halted 0 ms 0 KB -