oj.uz

Submission #827727

# Submission time Handle Problem Language Result Execution time Memory
827727 2023-08-16T16:59:37 Z vjudge1 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 306 ms 297560 KB 
#include <bits/stdc++.h>
using namespace std;

// 123

const int MAXN = 1e5;
int updL[18][MAXN], updR[18][MAXN];
int L[18][MAXN], R[18][MAXN];
int rmqL[18][MAXN], rmqR[18][MAXN];
int ansL[18][18][MAXN], ansR[18][18][MAXN];

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

        int n, k, m;
        cin >> n >> k >> m;
        memset(updL, 0x3f, sizeof updL);
        memset(updR, 0xc3, sizeof updR);
        for (int i = 0; i < m; i++) {
                int a, b;
                cin >> a >> b;
                a--, b--;
                if (a < b) {
                        int c = min(a + k - 1, b - 1);
                        int j = __lg(c - a + 1);
                        c -= (1 << j) - 1;
                        updR[j][a] = max(updR[j][a], b);
                        updR[j][c] = max(updR[j][c], b);
                } else {
                        int c = max(a - k + 1, b + 1);
                        int j = __lg(a - c + 1);
                        a -= (1 << j) - 1;
                        updL[j][a] = min(updL[j][a], b);
                        updL[j][c] = min(updL[j][c], b);
                }
        }
        for (int i = 17; i > 0; i--) {
                for (int j = 0; j + (1 << i) <= n; j++) {
                        updL[i - 1][j] = min(updL[i - 1][j], updL[i][j]);
                        updL[i - 1][j + (1 << (i - 1))] = min(updL[i - 1][j + (1 << (i - 1))], updL[i][j]);
                        updR[i - 1][j] = max(updR[i - 1][j], updR[i][j]);
                        updR[i - 1][j + (1 << (i - 1))] = max(updR[i - 1][j + (1 << (i - 1))], updR[i][j]);
                }
        }
        memset(L, -1, sizeof L);
        memset(R, -1, sizeof R);
        for (int i = 0; i < n; i++) {
                L[0][i] = min(i, updL[0][i]);
                R[0][i] = max(i, updR[0][i]);
        }
        for (int i = 1; i < 18; i++) {
                for (int j = 0; j < n; j++) rmqL[0][j] = L[i - 1][j];
                for (int j = 0; j < n; j++) rmqR[0][j] = R[i - 1][j];
                for (int j = 1; j < 18; j++) {
                        for (int k = 0; k + (1 << j) <= n; k++) {
                                rmqL[j][k] = min(rmqL[j - 1][k], rmqL[j - 1][k + (1 << (j - 1))]);
                                rmqR[j][k] = max(rmqR[j - 1][k], rmqR[j - 1][k + (1 << (j - 1))]);
                        }
                }
                for (int j = 0; j < n; j++) {
                        int l = L[i - 1][j];
                        int r = R[i - 1][j];
                        int k = __lg(r - l + 1);
                        r -= (1 << k) - 1;
                        L[i][j] = min(rmqL[k][l], rmqL[k][r]);
                        R[i][j] = max(rmqR[k][l], rmqR[k][r]);
                }
        }
        memset(ansL, -1, sizeof ansL);
        memset(ansR, -1, sizeof ansR);
        for (int i = 0; i < 18; i++) {
                for (int j = 0; j <= n; j++) ansL[i][0][j] = L[i][j];
                for (int j = 0; j <= n; j++) ansR[i][0][j] = R[i][j];
                for (int j = 1; j < 18; j++) {
                        for (int k = 0; k + (1 << j) <= n; k++) {
                                ansL[i][j][k] = min(ansL[i][j - 1][k], ansL[i][j - 1][k + (1 << (j - 1))]);
                                ansR[i][j][k] = max(ansR[i][j - 1][k], ansR[i][j - 1][k + (1 << (j - 1))]);
                        }
                }
        }
        int q;
        cin >> q;
        while (q--) {
                int u, v;
                cin >> u >> v;
                u--, v--;
                int l = u, r = u;
                int res = 0;
                for (int i = 17; i >= 0; i--) {
                        int j = __lg(r - l + 1);
                        int rr = r - (1 << j) + 1;
                        int nl = min(ansL[i][j][l], ansL[i][j][rr]);
                        int nr = max(ansR[i][j][l], ansR[i][j][rr]);
                        if (nl != -1 && nr != -1 && nl > v || nr < v) l = nl, r = nr, res += (1 << i);
                }
                res++;
                cout << (res == (1 << 18) ? -1 : res) << '\n';
        }
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:95:50: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   95 |                         if (nl != -1 && nr != -1 && nl > v || nr < v) l = nl, r = nr, res += (1 << i);
      |                             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 282120 KB Output is correct
2 Correct 106 ms 282308 KB Output is correct
3 Correct 90 ms 282108 KB Output is correct
4 Correct 90 ms 282104 KB Output is correct
5 Correct 93 ms 282136 KB Output is correct
6 Correct 90 ms 282116 KB Output is correct
7 Correct 94 ms 282184 KB Output is correct
8 Correct 90 ms 282212 KB Output is correct
9 Correct 90 ms 282096 KB Output is correct
10 Correct 92 ms 282336 KB Output is correct
11 Correct 92 ms 282136 KB Output is correct
12 Correct 95 ms 282128 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 282120 KB Output is correct
2 Correct 106 ms 282308 KB Output is correct
3 Correct 90 ms 282108 KB Output is correct
4 Correct 90 ms 282104 KB Output is correct
5 Correct 93 ms 282136 KB Output is correct
6 Correct 90 ms 282116 KB Output is correct
7 Correct 94 ms 282184 KB Output is correct
8 Correct 90 ms 282212 KB Output is correct
9 Correct 90 ms 282096 KB Output is correct
10 Correct 92 ms 282336 KB Output is correct
11 Correct 92 ms 282136 KB Output is correct
12 Correct 95 ms 282128 KB Output is correct
13 Correct 91 ms 282316 KB Output is correct
14 Correct 95 ms 282316 KB Output is correct
15 Correct 92 ms 282316 KB Output is correct
16 Correct 93 ms 282328 KB Output is correct
17 Correct 91 ms 282408 KB Output is correct
18 Correct 100 ms 282344 KB Output is correct
19 Correct 90 ms 282344 KB Output is correct
20 Correct 91 ms 282320 KB Output is correct
21 Correct 91 ms 282356 KB Output is correct
22 Correct 92 ms 282312 KB Output is correct
23 Correct 92 ms 282408 KB Output is correct
24 Correct 90 ms 282400 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 295380 KB Output is correct
2 Correct 186 ms 295320 KB Output is correct
3 Correct 182 ms 295560 KB Output is correct
4 Correct 193 ms 295316 KB Output is correct
5 Correct 201 ms 296672 KB Output is correct
6 Correct 196 ms 296652 KB Output is correct
7 Correct 193 ms 296448 KB Output is correct
8 Correct 190 ms 295504 KB Output is correct
9 Correct 186 ms 295600 KB Output is correct
10 Correct 200 ms 296764 KB Output is correct
11 Correct 207 ms 296764 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 296096 KB Output is correct
2 Correct 232 ms 297472 KB Output is correct
3 Correct 210 ms 296332 KB Output is correct
4 Correct 217 ms 297016 KB Output is correct
5 Correct 220 ms 297268 KB Output is correct
6 Correct 210 ms 297292 KB Output is correct
7 Correct 223 ms 297324 KB Output is correct
8 Correct 232 ms 297388 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 297560 KB Output is correct
2 Correct 279 ms 296360 KB Output is correct
3 Correct 250 ms 295740 KB Output is correct
4 Correct 238 ms 295444 KB Output is correct
5 Correct 213 ms 295156 KB Output is correct
6 Correct 208 ms 295280 KB Output is correct
7 Correct 213 ms 296244 KB Output is correct
8 Correct 89 ms 282188 KB Output is correct
9 Correct 91 ms 282404 KB Output is correct
10 Correct 208 ms 296760 KB Output is correct
11 Correct 210 ms 297292 KB Output is correct
12 Correct 203 ms 297280 KB Output is correct
13 Correct 211 ms 297284 KB Output is correct
14 Correct 89 ms 282112 KB Output is correct
15 Correct 91 ms 282372 KB Output is correct
16 Correct 191 ms 296652 KB Output is correct
17 Correct 250 ms 297468 KB Output is correct
18 Correct 252 ms 297380 KB Output is correct
19 Correct 221 ms 297404 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 282120 KB Output is correct
2 Correct 106 ms 282308 KB Output is correct
3 Correct 90 ms 282108 KB Output is correct
4 Correct 90 ms 282104 KB Output is correct
5 Correct 93 ms 282136 KB Output is correct
6 Correct 90 ms 282116 KB Output is correct
7 Correct 94 ms 282184 KB Output is correct
8 Correct 90 ms 282212 KB Output is correct
9 Correct 90 ms 282096 KB Output is correct
10 Correct 92 ms 282336 KB Output is correct
11 Correct 92 ms 282136 KB Output is correct
12 Correct 95 ms 282128 KB Output is correct
13 Correct 91 ms 282316 KB Output is correct
14 Correct 95 ms 282316 KB Output is correct
15 Correct 92 ms 282316 KB Output is correct
16 Correct 93 ms 282328 KB Output is correct
17 Correct 91 ms 282408 KB Output is correct
18 Correct 100 ms 282344 KB Output is correct
19 Correct 90 ms 282344 KB Output is correct
20 Correct 91 ms 282320 KB Output is correct
21 Correct 91 ms 282356 KB Output is correct
22 Correct 92 ms 282312 KB Output is correct
23 Correct 92 ms 282408 KB Output is correct
24 Correct 90 ms 282400 KB Output is correct
25 Correct 306 ms 295380 KB Output is correct
26 Correct 186 ms 295320 KB Output is correct
27 Correct 182 ms 295560 KB Output is correct
28 Correct 193 ms 295316 KB Output is correct
29 Correct 201 ms 296672 KB Output is correct
30 Correct 196 ms 296652 KB Output is correct
31 Correct 193 ms 296448 KB Output is correct
32 Correct 190 ms 295504 KB Output is correct
33 Correct 186 ms 295600 KB Output is correct
34 Correct 200 ms 296764 KB Output is correct
35 Correct 207 ms 296764 KB Output is correct
36 Correct 223 ms 296096 KB Output is correct
37 Correct 232 ms 297472 KB Output is correct
38 Correct 210 ms 296332 KB Output is correct
39 Correct 217 ms 297016 KB Output is correct
40 Correct 220 ms 297268 KB Output is correct
41 Correct 210 ms 297292 KB Output is correct
42 Correct 223 ms 297324 KB Output is correct
43 Correct 232 ms 297388 KB Output is correct
44 Correct 239 ms 297560 KB Output is correct
45 Correct 279 ms 296360 KB Output is correct
46 Correct 250 ms 295740 KB Output is correct
47 Correct 238 ms 295444 KB Output is correct
48 Correct 213 ms 295156 KB Output is correct
49 Correct 208 ms 295280 KB Output is correct
50 Correct 213 ms 296244 KB Output is correct
51 Correct 89 ms 282188 KB Output is correct
52 Correct 91 ms 282404 KB Output is correct
53 Correct 208 ms 296760 KB Output is correct
54 Correct 210 ms 297292 KB Output is correct
55 Correct 203 ms 297280 KB Output is correct
56 Correct 211 ms 297284 KB Output is correct
57 Correct 89 ms 282112 KB Output is correct
58 Correct 91 ms 282372 KB Output is correct
59 Correct 191 ms 296652 KB Output is correct
60 Correct 250 ms 297468 KB Output is correct
61 Correct 252 ms 297380 KB Output is correct
62 Correct 221 ms 297404 KB Output is correct
63 Correct 245 ms 296176 KB Output is correct
64 Correct 222 ms 296248 KB Output is correct
65 Correct 229 ms 296056 KB Output is correct
66 Correct 228 ms 297420 KB Output is correct
67 Correct 239 ms 297532 KB Output is correct
68 Correct 207 ms 297280 KB Output is correct
69 Correct 205 ms 297292 KB Output is correct
70 Correct 227 ms 297400 KB Output is correct
71 Correct 255 ms 297420 KB Output is correct