oj.uz

Submission #957893

# Submission time Handle Problem Language Result Execution time Memory
957893 2024-04-04T12:49:40 Z Pring Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 283 ms 63968 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

// #define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 100005, LG = 19;
int n, k, m, q;
pii rng[LG][MXN];

pii operator+(pii a, pii b) {
    return mp(min(a.fs, b.fs), max(a.sc, b.sc));
}

struct SMG {
    pii val[MXN * 2];

    void build(pii *rng) {
        FOR(i, 0, n) val[i + n] = rng[i];
        for (int i = n - 1; i > 0; i--) val[i] = val[i << 1] + val[(i << 1) | 1];
    }

    pii query(int l, int r) {
        pii ans = mp(MXN, -1);
        for (l += n, r += n; l != r; l >>= 1, r >>= 1) {
            if (l & 1) ans = ans + val[l++];
            if (r & 1) ans = ans + val[--r];
        }
        return ans;
    }
} smg[LG];

namespace PPRE {
    vector<int> l[MXN], r[MXN];
    multiset<int> MS;

    void DO() {
        int x, y;
        FOR(i, 0, m) {
            cin >> x >> y;
            x--, y--;
            if (x < y) {
                r[x].push_back(y);
                r[min(y + 1, x + k)].push_back(-y - 1);
            } else {
                l[max(y, x - k + 1)].push_back(y);
                l[x + 1].push_back(-y - 1);
            }
        }
        FOR(i, 0, n) {
            for (auto &j : l[i]) {
                if (j >= 0) MS.insert(j);
                else MS.erase(MS.find(-j - 1));
            }
            rng[0][i].fs = (MS.empty() ? i : *MS.begin());
        }
        MS.clear();
        FOR(i, 0, n) {
            for (auto &j : r[i]) {
                if (j >= 0) MS.insert(j);
                else MS.erase(MS.find(-j - 1));
            }
            rng[0][i].sc = (MS.empty() ? i : *MS.rbegin());
        }
        // FOR(i, 0, n) debug(i, rng[0][i].fs, rng[0][i].sc);
    }
}

void PRE() {
    FOR(w, 1, LG) {
        smg[w - 1].build(rng[w - 1]);
        FOR(i, 0, n) rng[w][i] = smg[w - 1].query(rng[w - 1][i].fs, rng[w - 1][i].sc + 1);
    }
    // FOR(i, 0, n) debug(i, rng[17][i].fs, rng[17][i].sc);
}

int calc(int x, int y) {
    // debug(x, y);
    // debug(rng[LG - 1][x].fs, rng[LG - 1][x].sc);
    if (!(rng[LG - 1][x].fs <= y && y <= rng[LG - 1][x].sc)) return -1;
    pii now = mp(x, x);
    int ans = 0;
    for (int w = LG - 2; w >= 0; w--) {
        // debug(now.fs, now.sc);
        pii nxt = smg[w].query(now.fs, now.sc + 1);
        // debug(w, nxt.fs, nxt.sc);
        if (!(nxt.fs <= y && y <= nxt.sc)) {
            now = nxt;
            ans ^= (1 << w);
        }
    }
    return ans + 1;
}

void miku() {
    int x, y;
    cin >> n >> k >> m;
    PPRE::DO();
    PRE();
    cin >> q;
    while (q--) {
        cin >> x >> y;
        cout << calc(--x, --y) << '\n';
    }
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 7 ms 47836 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 6 ms 47708 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 6 ms 47708 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 6 ms 47708 KB Output is correct
9 Correct 6 ms 47704 KB Output is correct
10 Correct 6 ms 47708 KB Output is correct
11 Correct 8 ms 47908 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 7 ms 47836 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 6 ms 47708 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 6 ms 47708 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 6 ms 47708 KB Output is correct
9 Correct 6 ms 47704 KB Output is correct
10 Correct 6 ms 47708 KB Output is correct
11 Correct 8 ms 47908 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct
13 Correct 9 ms 47768 KB Output is correct
14 Correct 9 ms 47964 KB Output is correct
15 Correct 8 ms 47708 KB Output is correct
16 Correct 8 ms 47888 KB Output is correct
17 Correct 8 ms 47964 KB Output is correct
18 Correct 10 ms 47960 KB Output is correct
19 Correct 8 ms 47964 KB Output is correct
20 Correct 8 ms 47964 KB Output is correct
21 Correct 8 ms 48116 KB Output is correct
22 Correct 8 ms 47964 KB Output is correct
23 Correct 8 ms 47964 KB Output is correct
24 Correct 8 ms 47764 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 53436 KB Output is correct
2 Correct 129 ms 53544 KB Output is correct
3 Correct 146 ms 53844 KB Output is correct
4 Correct 115 ms 53336 KB Output is correct
5 Correct 153 ms 58600 KB Output is correct
6 Correct 127 ms 58176 KB Output is correct
7 Correct 161 ms 63332 KB Output is correct
8 Correct 109 ms 55952 KB Output is correct
9 Correct 116 ms 55892 KB Output is correct
10 Correct 176 ms 57428 KB Output is correct
11 Correct 159 ms 57428 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 57360 KB Output is correct
2 Correct 188 ms 59352 KB Output is correct
3 Correct 198 ms 57932 KB Output is correct
4 Correct 149 ms 63968 KB Output is correct
5 Correct 187 ms 60772 KB Output is correct
6 Correct 182 ms 60500 KB Output is correct
7 Correct 179 ms 58196 KB Output is correct
8 Correct 210 ms 58196 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 59216 KB Output is correct
2 Correct 241 ms 54876 KB Output is correct
3 Correct 205 ms 52908 KB Output is correct
4 Correct 199 ms 51284 KB Output is correct
5 Correct 112 ms 50772 KB Output is correct
6 Correct 178 ms 50424 KB Output is correct
7 Correct 185 ms 59848 KB Output is correct
8 Correct 7 ms 47704 KB Output is correct
9 Correct 9 ms 47960 KB Output is correct
10 Correct 243 ms 59476 KB Output is correct
11 Correct 269 ms 61524 KB Output is correct
12 Correct 256 ms 59476 KB Output is correct
13 Correct 265 ms 61264 KB Output is correct
14 Correct 6 ms 47704 KB Output is correct
15 Correct 10 ms 47964 KB Output is correct
16 Correct 168 ms 56176 KB Output is correct
17 Correct 283 ms 57116 KB Output is correct
18 Correct 261 ms 56912 KB Output is correct
19 Correct 249 ms 56892 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 7 ms 47836 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Correct 6 ms 47708 KB Output is correct
5 Correct 7 ms 47708 KB Output is correct
6 Correct 6 ms 47708 KB Output is correct
7 Correct 7 ms 47708 KB Output is correct
8 Correct 6 ms 47708 KB Output is correct
9 Correct 6 ms 47704 KB Output is correct
10 Correct 6 ms 47708 KB Output is correct
11 Correct 8 ms 47908 KB Output is correct
12 Correct 7 ms 47708 KB Output is correct
13 Correct 9 ms 47768 KB Output is correct
14 Correct 9 ms 47964 KB Output is correct
15 Correct 8 ms 47708 KB Output is correct
16 Correct 8 ms 47888 KB Output is correct
17 Correct 8 ms 47964 KB Output is correct
18 Correct 10 ms 47960 KB Output is correct
19 Correct 8 ms 47964 KB Output is correct
20 Correct 8 ms 47964 KB Output is correct
21 Correct 8 ms 48116 KB Output is correct
22 Correct 8 ms 47964 KB Output is correct
23 Correct 8 ms 47964 KB Output is correct
24 Correct 8 ms 47764 KB Output is correct
25 Correct 156 ms 53436 KB Output is correct
26 Correct 129 ms 53544 KB Output is correct
27 Correct 146 ms 53844 KB Output is correct
28 Correct 115 ms 53336 KB Output is correct
29 Correct 153 ms 58600 KB Output is correct
30 Correct 127 ms 58176 KB Output is correct
31 Correct 161 ms 63332 KB Output is correct
32 Correct 109 ms 55952 KB Output is correct
33 Correct 116 ms 55892 KB Output is correct
34 Correct 176 ms 57428 KB Output is correct
35 Correct 159 ms 57428 KB Output is correct
36 Correct 145 ms 57360 KB Output is correct
37 Correct 188 ms 59352 KB Output is correct
38 Correct 198 ms 57932 KB Output is correct
39 Correct 149 ms 63968 KB Output is correct
40 Correct 187 ms 60772 KB Output is correct
41 Correct 182 ms 60500 KB Output is correct
42 Correct 179 ms 58196 KB Output is correct
43 Correct 210 ms 58196 KB Output is correct
44 Correct 238 ms 59216 KB Output is correct
45 Correct 241 ms 54876 KB Output is correct
46 Correct 205 ms 52908 KB Output is correct
47 Correct 199 ms 51284 KB Output is correct
48 Correct 112 ms 50772 KB Output is correct
49 Correct 178 ms 50424 KB Output is correct
50 Correct 185 ms 59848 KB Output is correct
51 Correct 7 ms 47704 KB Output is correct
52 Correct 9 ms 47960 KB Output is correct
53 Correct 243 ms 59476 KB Output is correct
54 Correct 269 ms 61524 KB Output is correct
55 Correct 256 ms 59476 KB Output is correct
56 Correct 265 ms 61264 KB Output is correct
57 Correct 6 ms 47704 KB Output is correct
58 Correct 10 ms 47964 KB Output is correct
59 Correct 168 ms 56176 KB Output is correct
60 Correct 283 ms 57116 KB Output is correct
61 Correct 261 ms 56912 KB Output is correct
62 Correct 249 ms 56892 KB Output is correct
63 Correct 198 ms 54100 KB Output is correct
64 Correct 236 ms 54600 KB Output is correct
65 Correct 208 ms 54512 KB Output is correct
66 Correct 160 ms 59360 KB Output is correct
67 Correct 219 ms 59044 KB Output is correct
68 Correct 185 ms 58628 KB Output is correct
69 Correct 175 ms 60496 KB Output is correct
70 Correct 170 ms 58392 KB Output is correct
71 Correct 228 ms 58652 KB Output is correct