oj.uz

답안 #719063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719063 2023-04-05T09:34:52 Z Kalashnikov Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 1414 ms 76088 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 1e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int L[N][20], R[N][20];

struct DO{
	int mn, mx;
}t[20][4*N];
int n , k;

void build(int j, int u = 1, int ul = 1, int ur = n) {
	if(ul == ur) {
		t[j][u].mx = L[ul][j];
		t[j][u].mn = R[ul][j];
		return;
	}
	int um = ul+ur >> 1;
	build(j, u<<1 ,ul, um);
	build(j, u<<1|1 ,um+1, ur);
	t[j][u].mn = min(t[j][u<<1].mn, t[j][u<<1|1].mn);
	t[j][u].mx = max(t[j][u<<1].mx, t[j][u<<1|1].mx);
}

DO get(int j, int l, int r, int u = 1, int ul = 1, int ur = n) {
	if(l <= ul && ur <= r) {
		return t[j][u];
	}
	if(r < ul || ur < l) {
		return {inf, -inf};
	}
	int um = ul+ur >> 1;
	DO lef = get(j, l , r, u<<1 , ul, um);
	DO rig = get(j, l , r, u<<1|1 , um+1, ur);
	return {min(lef.mn,rig.mn) , max(lef.mx,rig.mx)};
}

vector<int> vecl[N];
vector<int> vecr[N];

void solve(int tc) {
	cin >> n >> k;
	int m;
	cin >> m;
	int a[m+1], b[m+1];
	for(int i = 1; i <= m; i ++) {
		cin >> a[i] >> b[i];
		if(a[i] < b[i]) {
			vecl[a[i]].push_back(b[i]);
			vecl[min(a[i]+k, b[i])].push_back(-b[i]);
		}
		else {
			vecr[a[i]].push_back(b[i]);
			vecr[max(a[i]-k, b[i])].push_back(-b[i]);
		}
	}
	
	multiset<int> st;
	for(int i = 1; i <= n; i ++) {
		for(auto x: vecl[i]) {
			if(x > 0) {
				st.insert(x);
			}
			else {
				st.erase(st.find(-x));
			}
		}
		st.insert(i);
		L[i][0] = *(--st.end());
		st.erase(st.find(i));
	}
	for(int i = n; i >= 1; i --) {
		for(auto x: vecr[i]) {
			if(x > 0) {
				st.insert(x);
			}
			else {
				st.erase(st.find(-x));
			}
		}
		st.insert(i);
		R[i][0] = *st.begin();
		st.erase(st.find(i));
	}
	build(0);
	for(int j = 1; j < 20; j ++) {
		for(int i = 1; i <= n; i ++) {
			L[i][j] = get(j-1, R[i][j-1], L[i][j-1]).mx;
			R[i][j] = get(j-1, R[i][j-1], L[i][j-1]).mn;
		}
		build(j);
	}
	
	int q; cin >> q;
	
	while(q --) {
		int s, t;
		cin >> s >> t;
		int ok = 0;
		int curl = s, curr = s;
		int ans = 0;
		for(int i = 19; i >= 0; i --) {
			DO cur = get(i, curl, curr);
			if(cur.mn <= t && t <= cur.mx) {
				ok = 1;
			}
			else {
				curl = cur.mn;
				curr = cur.mx;
				ans += (1 << i);
			}
		}
		if(!ok) {
			cout << "-1\n";
		}
		else {
			cout << ans + 1 << '\n';
		}
	}
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void build(int, int, int, int)':
Main.cpp:28:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |  int um = ul+ur >> 1;
      |           ~~^~~
Main.cpp: In function 'DO get(int, int, int, int, int, int)':
Main.cpp:42:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |  int um = ul+ur >> 1;
      |           ~~^~~
Main.cpp: At global scope:
Main.cpp:133:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  133 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 4 ms 5412 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5416 KB Output is correct
6 Correct 4 ms 5412 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 5 ms 5416 KB Output is correct
10 Correct 3 ms 5152 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 4 ms 5332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 4 ms 5412 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5416 KB Output is correct
6 Correct 4 ms 5412 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 5 ms 5416 KB Output is correct
10 Correct 3 ms 5152 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 4 ms 5332 KB Output is correct
13 Correct 16 ms 6188 KB Output is correct
14 Correct 18 ms 6228 KB Output is correct
15 Correct 13 ms 6228 KB Output is correct
16 Correct 11 ms 6268 KB Output is correct
17 Correct 19 ms 6324 KB Output is correct
18 Correct 9 ms 6228 KB Output is correct
19 Correct 16 ms 6240 KB Output is correct
20 Correct 10 ms 6296 KB Output is correct
21 Correct 6 ms 6228 KB Output is correct
22 Correct 15 ms 6188 KB Output is correct
23 Correct 18 ms 6248 KB Output is correct
24 Correct 19 ms 6196 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 880 ms 66136 KB Output is correct
2 Correct 786 ms 66104 KB Output is correct
3 Correct 866 ms 66432 KB Output is correct
4 Correct 796 ms 65920 KB Output is correct
5 Correct 365 ms 70892 KB Output is correct
6 Correct 806 ms 70404 KB Output is correct
7 Correct 209 ms 75788 KB Output is correct
8 Correct 184 ms 68228 KB Output is correct
9 Correct 179 ms 68684 KB Output is correct
10 Correct 812 ms 69744 KB Output is correct
11 Correct 659 ms 69680 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 958 ms 69080 KB Output is correct
2 Correct 1000 ms 71092 KB Output is correct
3 Correct 1414 ms 66724 KB Output is correct
4 Correct 383 ms 76088 KB Output is correct
5 Correct 467 ms 71896 KB Output is correct
6 Correct 419 ms 72144 KB Output is correct
7 Correct 1103 ms 69944 KB Output is correct
8 Correct 848 ms 70036 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 70796 KB Output is correct
2 Correct 1182 ms 66676 KB Output is correct
3 Correct 1113 ms 64748 KB Output is correct
4 Correct 1165 ms 63840 KB Output is correct
5 Correct 986 ms 63004 KB Output is correct
6 Correct 1092 ms 62540 KB Output is correct
7 Correct 784 ms 71904 KB Output is correct
8 Correct 4 ms 5404 KB Output is correct
9 Correct 16 ms 6228 KB Output is correct
10 Correct 725 ms 71664 KB Output is correct
11 Correct 835 ms 73216 KB Output is correct
12 Correct 869 ms 70996 KB Output is correct
13 Correct 861 ms 73024 KB Output is correct
14 Correct 4 ms 5332 KB Output is correct
15 Correct 20 ms 6244 KB Output is correct
16 Correct 884 ms 68428 KB Output is correct
17 Correct 1101 ms 68536 KB Output is correct
18 Correct 1100 ms 68636 KB Output is correct
19 Correct 1065 ms 68556 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5332 KB Output is correct
2 Correct 4 ms 5412 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5416 KB Output is correct
6 Correct 4 ms 5412 KB Output is correct
7 Correct 4 ms 5332 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 5 ms 5416 KB Output is correct
10 Correct 3 ms 5152 KB Output is correct
11 Correct 4 ms 5332 KB Output is correct
12 Correct 4 ms 5332 KB Output is correct
13 Correct 16 ms 6188 KB Output is correct
14 Correct 18 ms 6228 KB Output is correct
15 Correct 13 ms 6228 KB Output is correct
16 Correct 11 ms 6268 KB Output is correct
17 Correct 19 ms 6324 KB Output is correct
18 Correct 9 ms 6228 KB Output is correct
19 Correct 16 ms 6240 KB Output is correct
20 Correct 10 ms 6296 KB Output is correct
21 Correct 6 ms 6228 KB Output is correct
22 Correct 15 ms 6188 KB Output is correct
23 Correct 18 ms 6248 KB Output is correct
24 Correct 19 ms 6196 KB Output is correct
25 Correct 880 ms 66136 KB Output is correct
26 Correct 786 ms 66104 KB Output is correct
27 Correct 866 ms 66432 KB Output is correct
28 Correct 796 ms 65920 KB Output is correct
29 Correct 365 ms 70892 KB Output is correct
30 Correct 806 ms 70404 KB Output is correct
31 Correct 209 ms 75788 KB Output is correct
32 Correct 184 ms 68228 KB Output is correct
33 Correct 179 ms 68684 KB Output is correct
34 Correct 812 ms 69744 KB Output is correct
35 Correct 659 ms 69680 KB Output is correct
36 Correct 958 ms 69080 KB Output is correct
37 Correct 1000 ms 71092 KB Output is correct
38 Correct 1414 ms 66724 KB Output is correct
39 Correct 383 ms 76088 KB Output is correct
40 Correct 467 ms 71896 KB Output is correct
41 Correct 419 ms 72144 KB Output is correct
42 Correct 1103 ms 69944 KB Output is correct
43 Correct 848 ms 70036 KB Output is correct
44 Correct 962 ms 70796 KB Output is correct
45 Correct 1182 ms 66676 KB Output is correct
46 Correct 1113 ms 64748 KB Output is correct
47 Correct 1165 ms 63840 KB Output is correct
48 Correct 986 ms 63004 KB Output is correct
49 Correct 1092 ms 62540 KB Output is correct
50 Correct 784 ms 71904 KB Output is correct
51 Correct 4 ms 5404 KB Output is correct
52 Correct 16 ms 6228 KB Output is correct
53 Correct 725 ms 71664 KB Output is correct
54 Correct 835 ms 73216 KB Output is correct
55 Correct 869 ms 70996 KB Output is correct
56 Correct 861 ms 73024 KB Output is correct
57 Correct 4 ms 5332 KB Output is correct
58 Correct 20 ms 6244 KB Output is correct
59 Correct 884 ms 68428 KB Output is correct
60 Correct 1101 ms 68536 KB Output is correct
61 Correct 1100 ms 68636 KB Output is correct
62 Correct 1065 ms 68556 KB Output is correct
63 Correct 1043 ms 66144 KB Output is correct
64 Correct 1247 ms 66484 KB Output is correct
65 Correct 1052 ms 66908 KB Output is correct
66 Correct 295 ms 73164 KB Output is correct
67 Correct 1020 ms 72752 KB Output is correct
68 Correct 841 ms 71804 KB Output is correct
69 Correct 421 ms 74044 KB Output is correct
70 Correct 1094 ms 72036 KB Output is correct
71 Correct 1128 ms 71976 KB Output is correct