oj.uz

Submission #530313

# Submission time Handle Problem Language Result Execution time Memory
530313 2022-02-25T03:48:41 Z yungyao Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
 2000 ms 3628 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 solve(){
	int n, k, m, q;

	cin >> n >> k >> m;
	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 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 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 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 245 ms 380 KB Output is correct
14 Correct 121 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 56 ms 404 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 320 KB Output is correct
23 Correct 4 ms 320 KB Output is correct
24 Correct 4 ms 328 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 3264 KB Output is correct
2 Correct 24 ms 3200 KB Output is correct
3 Correct 27 ms 3212 KB Output is correct
4 Correct 20 ms 3140 KB Output is correct
5 Correct 33 ms 3340 KB Output is correct
6 Correct 38 ms 3628 KB Output is correct
7 Correct 36 ms 3248 KB Output is correct
8 Correct 19 ms 3128 KB Output is correct
9 Correct 22 ms 3260 KB Output is correct
10 Correct 34 ms 3392 KB Output is correct
11 Correct 35 ms 3412 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2048 ms 3536 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 3280 KB Output is correct
2 Execution timed out 2051 ms 3172 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 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 245 ms 380 KB Output is correct
14 Correct 121 ms 332 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 56 ms 404 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 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 320 KB Output is correct
23 Correct 4 ms 320 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 29 ms 3264 KB Output is correct
26 Correct 24 ms 3200 KB Output is correct
27 Correct 27 ms 3212 KB Output is correct
28 Correct 20 ms 3140 KB Output is correct
29 Correct 33 ms 3340 KB Output is correct
30 Correct 38 ms 3628 KB Output is correct
31 Correct 36 ms 3248 KB Output is correct
32 Correct 19 ms 3128 KB Output is correct
33 Correct 22 ms 3260 KB Output is correct
34 Correct 34 ms 3392 KB Output is correct
35 Correct 35 ms 3412 KB Output is correct
36 Execution timed out 2048 ms 3536 KB Time limit exceeded
37 Halted 0 ms 0 KB -