oj.uz

답안 #573678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573678 2022-06-07T04:58:27 Z eecs Event Hopping (BOI22_events) C++17
100 / 100
 1358 ms 483184 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 100010, SZ = 1200;
int n, q, b[maxn], rmq[17][maxn], bel[maxn], bl[maxn], br[maxn];
int num[maxn / SZ + 5][SZ + 5], tmp[maxn], sz[maxn], rb[maxn];
short pos[maxn][SZ + 5], tr[maxn][SZ + 5];
array<int, 2> a[maxn];

int main() {
    double start = clock();
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> q;
    vector<int> V;
    for (int i = 1; i <= n; i++) {
        cin >> a[i][0] >> a[i][1], V.push_back(a[i][1]);
    }
    sort(V.begin(), V.end());
    V.resize(unique(V.begin(), V.end()) - V.begin());
    fill(b + 1, b + n + 1, n + 1);
    for (int i = 1; i <= n; i++) {
        a[i][0] = lower_bound(V.begin(), V.end(), a[i][0]) - V.begin() + 1;
        a[i][1] = lower_bound(V.begin(), V.end(), a[i][1]) - V.begin() + 1;
        b[a[i][1]] = min(b[a[i][1]], a[i][0]);
    }
    for (int i = 1; i <= n; i++) {
        br[bel[i] = (i - 1) / SZ + 1] = i;
        if (!bl[bel[i]]) bl[bel[i]] = i;
    }
    copy(b + 1, b + n + 1, rmq[0] + 1);
    for (int k = 1; k < 17; k++) {
        memcpy(rmq[k], rmq[k - 1], sizeof(rmq[k]));
        for (int i = (1 << (k - 1)) + 1; i <= n; i++) {
            rmq[k][i] = min(rmq[k][i], rmq[k - 1][i - (1 << (k - 1))]);
        }
    }
    auto qmin = [&](int l, int r) {
        int k = __lg(r - l + 1);
        return min(rmq[k][l + (1 << k) - 1], rmq[k][r]);
    };
    auto go = [&](int s, int r) {
        r = min(r, rb[s]);
        if (b[r] <= s) return r;
        for (int i = __lg(r - s + 1); ~i && r > s; i--) {
            if (rmq[i][r] > s) r -= 1 << i;
        }
        return r <= s ? 0 : r;
    };
    for (int i = 1; i <= n; i++) {
        rb[i] = n, rb[i] = go(i, n);
    }
    for (int k = 1; k <= bel[n]; k++) {
        for (int i = br[k], j = br[k]; i >= bl[k]; i--) {
            for (; j >= max(bl[k], b[i]); j--) num[k][j - bl[k]] = j < i ? i : 0;
        }
    }
    for (int i = 1; i <= n; i++) {
        int k = bel[i], L = bl[k], R = br[k];
        for (int j = num[k][i - L]; j && j <= R; j = num[k][j - L]) {
            tr[i][sz[i]++] = j - L;
        }
        for (int j = 0, k = 0; j <= R - L; j++) {
            while (k < sz[i] && tr[i][k] < j) k++;
            pos[i][j] = k;
        }
    }
    cerr << clock() - start << endl;
    while (q--) {
        int s, t, ans = 0;
        cin >> s >> t;
        if (s == t) { cout << "0\n"; continue; }
        for (s = a[s][1]; s && s < a[t][0]; ans++) {
            if (bel[s] == bel[a[t][0]]) {
                for (int i = a[t][0], j = a[t][0]; i >= s; i--) {
                    int v = max(s, i == a[t][0] ? qmin(i, a[t][1]) : b[i]);
                    for (; j >= v; j--) tmp[j] = j < i ? i : 0;
                }
                for (; s && s < a[t][0]; ans++) s = tmp[s];
                break;
            }
            int nxt = qmin(bl[bel[s] + 1], a[t][1]);
            if (nxt <= s) {
                s = go(s, a[t][1]);
            } else {
                if (!sz[s] || nxt - bl[bel[s]] > tr[s][sz[s] - 1]) { s = 0; break; }
                int i = pos[s][nxt - bl[bel[s]]];
                ans += i, s = bl[bel[s]] + tr[s][i];
                if (s < a[t][0]) s = go(s, a[t][1]), ans++;
            }
        }
        if (a[t][0] <= s && s <= a[t][1]) cout << ans + 1 << "\n";
        else cout << "impossible\n";
    }
    cerr << clock() - start << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 1036 ms 482376 KB Output is correct
3 Correct 964 ms 482420 KB Output is correct
4 Correct 1000 ms 482564 KB Output is correct
5 Correct 1022 ms 482540 KB Output is correct
6 Correct 1039 ms 482476 KB Output is correct
7 Correct 1057 ms 482420 KB Output is correct
8 Correct 231 ms 247680 KB Output is correct
9 Correct 236 ms 246764 KB Output is correct
10 Correct 687 ms 483184 KB Output is correct
11 Correct 757 ms 483024 KB Output is correct
12 Correct 210 ms 246516 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 8 ms 11348 KB Output is correct
4 Correct 7 ms 11348 KB Output is correct
5 Correct 7 ms 11320 KB Output is correct
6 Correct 5 ms 10200 KB Output is correct
7 Correct 7 ms 11380 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 5 ms 8916 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 8 ms 11348 KB Output is correct
4 Correct 7 ms 11348 KB Output is correct
5 Correct 7 ms 11320 KB Output is correct
6 Correct 5 ms 10200 KB Output is correct
7 Correct 7 ms 11380 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 5 ms 8916 KB Output is correct
10 Correct 3 ms 6664 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 9 ms 11388 KB Output is correct
13 Correct 7 ms 11348 KB Output is correct
14 Correct 6 ms 11348 KB Output is correct
15 Correct 6 ms 10196 KB Output is correct
16 Correct 7 ms 11348 KB Output is correct
17 Correct 6 ms 11348 KB Output is correct
18 Correct 5 ms 8928 KB Output is correct
19 Correct 277 ms 30924 KB Output is correct
20 Correct 264 ms 30916 KB Output is correct
21 Correct 187 ms 31120 KB Output is correct
22 Correct 51 ms 25300 KB Output is correct
23 Correct 47 ms 31052 KB Output is correct
24 Correct 38 ms 31008 KB Output is correct
25 Correct 212 ms 30696 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 8 ms 11348 KB Output is correct
4 Correct 7 ms 11348 KB Output is correct
5 Correct 7 ms 11320 KB Output is correct
6 Correct 5 ms 10200 KB Output is correct
7 Correct 7 ms 11380 KB Output is correct
8 Correct 6 ms 11348 KB Output is correct
9 Correct 5 ms 8916 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 8 ms 11348 KB Output is correct
13 Correct 7 ms 11348 KB Output is correct
14 Correct 7 ms 11348 KB Output is correct
15 Correct 5 ms 10196 KB Output is correct
16 Correct 7 ms 11348 KB Output is correct
17 Correct 6 ms 11348 KB Output is correct
18 Correct 5 ms 8916 KB Output is correct
19 Correct 551 ms 481748 KB Output is correct
20 Correct 536 ms 482024 KB Output is correct
21 Correct 288 ms 363120 KB Output is correct
22 Correct 603 ms 481904 KB Output is correct
23 Correct 350 ms 481784 KB Output is correct
24 Correct 370 ms 481816 KB Output is correct
25 Correct 188 ms 245320 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1008 ms 482524 KB Output is correct
2 Correct 944 ms 482600 KB Output is correct
3 Correct 995 ms 482508 KB Output is correct
4 Correct 236 ms 246724 KB Output is correct
5 Correct 681 ms 483076 KB Output is correct
6 Correct 614 ms 483036 KB Output is correct
7 Correct 626 ms 483148 KB Output is correct
8 Correct 571 ms 482820 KB Output is correct
9 Correct 320 ms 481820 KB Output is correct
10 Correct 1358 ms 482212 KB Output is correct
11 Correct 371 ms 481960 KB Output is correct
12 Correct 1014 ms 482272 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 1036 ms 482376 KB Output is correct
3 Correct 964 ms 482420 KB Output is correct
4 Correct 1000 ms 482564 KB Output is correct
5 Correct 1022 ms 482540 KB Output is correct
6 Correct 1039 ms 482476 KB Output is correct
7 Correct 1057 ms 482420 KB Output is correct
8 Correct 231 ms 247680 KB Output is correct
9 Correct 236 ms 246764 KB Output is correct
10 Correct 687 ms 483184 KB Output is correct
11 Correct 757 ms 483024 KB Output is correct
12 Correct 210 ms 246516 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 8 ms 11348 KB Output is correct
16 Correct 7 ms 11348 KB Output is correct
17 Correct 7 ms 11320 KB Output is correct
18 Correct 5 ms 10200 KB Output is correct
19 Correct 7 ms 11380 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 5 ms 8916 KB Output is correct
22 Correct 3 ms 6664 KB Output is correct
23 Correct 3 ms 6612 KB Output is correct
24 Correct 9 ms 11388 KB Output is correct
25 Correct 7 ms 11348 KB Output is correct
26 Correct 6 ms 11348 KB Output is correct
27 Correct 6 ms 10196 KB Output is correct
28 Correct 7 ms 11348 KB Output is correct
29 Correct 6 ms 11348 KB Output is correct
30 Correct 5 ms 8928 KB Output is correct
31 Correct 277 ms 30924 KB Output is correct
32 Correct 264 ms 30916 KB Output is correct
33 Correct 187 ms 31120 KB Output is correct
34 Correct 51 ms 25300 KB Output is correct
35 Correct 47 ms 31052 KB Output is correct
36 Correct 38 ms 31008 KB Output is correct
37 Correct 212 ms 30696 KB Output is correct
38 Correct 3 ms 6612 KB Output is correct
39 Correct 3 ms 6612 KB Output is correct
40 Correct 8 ms 11348 KB Output is correct
41 Correct 7 ms 11348 KB Output is correct
42 Correct 7 ms 11348 KB Output is correct
43 Correct 5 ms 10196 KB Output is correct
44 Correct 7 ms 11348 KB Output is correct
45 Correct 6 ms 11348 KB Output is correct
46 Correct 5 ms 8916 KB Output is correct
47 Correct 551 ms 481748 KB Output is correct
48 Correct 536 ms 482024 KB Output is correct
49 Correct 288 ms 363120 KB Output is correct
50 Correct 603 ms 481904 KB Output is correct
51 Correct 350 ms 481784 KB Output is correct
52 Correct 370 ms 481816 KB Output is correct
53 Correct 188 ms 245320 KB Output is correct
54 Correct 1008 ms 482524 KB Output is correct
55 Correct 944 ms 482600 KB Output is correct
56 Correct 995 ms 482508 KB Output is correct
57 Correct 236 ms 246724 KB Output is correct
58 Correct 681 ms 483076 KB Output is correct
59 Correct 614 ms 483036 KB Output is correct
60 Correct 626 ms 483148 KB Output is correct
61 Correct 571 ms 482820 KB Output is correct
62 Correct 320 ms 481820 KB Output is correct
63 Correct 1358 ms 482212 KB Output is correct
64 Correct 371 ms 481960 KB Output is correct
65 Correct 1014 ms 482272 KB Output is correct
66 Correct 3 ms 6612 KB Output is correct
67 Correct 1006 ms 482316 KB Output is correct
68 Correct 981 ms 482472 KB Output is correct
69 Correct 994 ms 482600 KB Output is correct
70 Correct 993 ms 482540 KB Output is correct
71 Correct 1034 ms 482464 KB Output is correct
72 Correct 1087 ms 482572 KB Output is correct
73 Correct 235 ms 247808 KB Output is correct
74 Correct 232 ms 246764 KB Output is correct
75 Correct 701 ms 483156 KB Output is correct
76 Correct 786 ms 483096 KB Output is correct
77 Correct 207 ms 246492 KB Output is correct
78 Correct 3 ms 6612 KB Output is correct
79 Correct 8 ms 11344 KB Output is correct
80 Correct 7 ms 11360 KB Output is correct
81 Correct 7 ms 11348 KB Output is correct
82 Correct 6 ms 10196 KB Output is correct
83 Correct 6 ms 11348 KB Output is correct
84 Correct 7 ms 11348 KB Output is correct
85 Correct 5 ms 8916 KB Output is correct
86 Correct 274 ms 30824 KB Output is correct
87 Correct 265 ms 30920 KB Output is correct
88 Correct 192 ms 31192 KB Output is correct
89 Correct 51 ms 25292 KB Output is correct
90 Correct 46 ms 31012 KB Output is correct
91 Correct 41 ms 31064 KB Output is correct
92 Correct 213 ms 30796 KB Output is correct
93 Correct 542 ms 481764 KB Output is correct
94 Correct 545 ms 481948 KB Output is correct
95 Correct 281 ms 363084 KB Output is correct
96 Correct 617 ms 481888 KB Output is correct
97 Correct 355 ms 481772 KB Output is correct
98 Correct 396 ms 481720 KB Output is correct
99 Correct 181 ms 245196 KB Output is correct
100 Correct 616 ms 482928 KB Output is correct
101 Correct 629 ms 482852 KB Output is correct
102 Correct 570 ms 482768 KB Output is correct
103 Correct 1333 ms 482272 KB Output is correct
104 Correct 347 ms 481904 KB Output is correct
105 Correct 983 ms 482320 KB Output is correct
106 Correct 683 ms 423688 KB Output is correct
107 Correct 1046 ms 482332 KB Output is correct
108 Correct 310 ms 364108 KB Output is correct
109 Correct 313 ms 364140 KB Output is correct
110 Correct 374 ms 482744 KB Output is correct
111 Correct 395 ms 482636 KB Output is correct