oj.uz

Submission #703944

# Submission time Handle Problem Language Result Execution time Memory
703944 2023-03-01T04:22:52 Z LittleCube Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 652 ms 68700 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

const int P = 18;
int N, K, M, Q;
pii sp[100005][P], seg[P][400005], range[P][100005];

pii merge(pii p1, pii p2)
{
    return pii(min(p1.F, p2.F), max(p1.S, p2.S));
}

void build(int p, int i = 1, int L = 1, int R = N)
{
    if (L == R)
        seg[p][i] = range[p][L];
    else
    {
        int mid = (L + R) / 2;
        build(p, i << 1, L, mid);
        build(p, i << 1 | 1, mid + 1, R);
        seg[p][i] = merge(seg[p][i << 1], seg[p][i << 1 | 1]);
    }
}

pii query(int qL, int qR, int p, int i = 1, int L = 1, int R = N)
{
    if (R < qL || qR < L)
        return pii(N + 1, 0);
    else if (qL <= L && R <= qR)
        return seg[p][i];
    else
    {
        int mid = (L + R) / 2;
        return merge(query(qL, qR, p, i << 1, L, mid),
                     query(qL, qR, p, i << 1 | 1, mid + 1, R));
    }
}

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> N >> K >> M;
    for (int i = 0; i < P; i++)
        for (int j = 1; j <= N; j++)
            sp[j][i] = pii(N + 1, 0);
    for (int i = 1; i <= M; i++)
    {
        int A, B, lg;
        cin >> A >> B;
        lg = __lg(min(abs(B - A) + 1, K));
        if (A < B)
        {
            sp[A][lg].S = max(sp[A][lg].S, B);
            sp[min(B, A + K - 1) - (1 << lg) + 1][lg].S = max(sp[min(B, A + K - 1) - (1 << lg) + 1][lg].S, B);
        }
        else
        {
            sp[A - (1 << lg) + 1][lg].F = min(sp[A - (1 << lg) + 1][lg].F, B);
            sp[max(B, A - K + 1)][lg].F = min(sp[max(B, A - K + 1)][lg].F, B);
        }
    }
    for (int i = P - 1; i > 0; i--)
        for (int j = 1; j + (1 << i) - 1 <= N; j++)
        {
            sp[j][i - 1] = merge(sp[j][i - 1], sp[j][i]);
            int k = j + (1 << (i - 1));
            sp[k][i - 1] = merge(sp[k][i - 1], sp[j][i]);
        }
    for (int j = 1; j <= N; j++)
        range[0][j].F = min(sp[j][0].F, j), range[0][j].S = max(sp[j][0].S, j);
    for (int j = 1; j < P; j++)
    {
        build(j - 1);
        for (int i = 1; i <= N; i++)
            range[j][i] = query(range[j - 1][i].F, range[j - 1][i].S, j - 1);
    }
    build(P - 1);
    cin >> Q;
    for (int i = 1; i <= Q; i++)
    {
        int L, R, T, ans = 0;
        cin >> L >> T;
        R = L;
        for (int j = P - 1; j >= 0; j--)
        {
            pii p = query(L, R, j);
            if (T < p.F || p.S < T)
                tie(L, R) = p, ans += (1 << j);
        }
        cout << (ans > N ? -1 : ans + 1) << '\n';
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 712 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 712 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 9 ms 1748 KB Output is correct
14 Correct 7 ms 1744 KB Output is correct
15 Correct 5 ms 1620 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 8 ms 1740 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 6 ms 1620 KB Output is correct
20 Correct 4 ms 1748 KB Output is correct
21 Correct 2 ms 1620 KB Output is correct
22 Correct 8 ms 1748 KB Output is correct
23 Correct 6 ms 1748 KB Output is correct
24 Correct 7 ms 1748 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 66368 KB Output is correct
2 Correct 316 ms 66360 KB Output is correct
3 Correct 339 ms 66620 KB Output is correct
4 Correct 314 ms 66368 KB Output is correct
5 Correct 113 ms 67820 KB Output is correct
6 Correct 324 ms 67772 KB Output is correct
7 Correct 100 ms 67500 KB Output is correct
8 Correct 90 ms 66460 KB Output is correct
9 Correct 85 ms 66624 KB Output is correct
10 Correct 273 ms 67756 KB Output is correct
11 Correct 261 ms 67764 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 435 ms 67124 KB Output is correct
2 Correct 336 ms 68536 KB Output is correct
3 Correct 576 ms 67444 KB Output is correct
4 Correct 202 ms 68128 KB Output is correct
5 Correct 197 ms 68148 KB Output is correct
6 Correct 191 ms 68364 KB Output is correct
7 Correct 477 ms 68500 KB Output is correct
8 Correct 405 ms 68556 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 68500 KB Output is correct
2 Correct 629 ms 67656 KB Output is correct
3 Correct 589 ms 66892 KB Output is correct
4 Correct 566 ms 66444 KB Output is correct
5 Correct 473 ms 66324 KB Output is correct
6 Correct 480 ms 66196 KB Output is correct
7 Correct 346 ms 67392 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 5 ms 1748 KB Output is correct
10 Correct 247 ms 67764 KB Output is correct
11 Correct 338 ms 68388 KB Output is correct
12 Correct 344 ms 68172 KB Output is correct
13 Correct 352 ms 68424 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 339 ms 67788 KB Output is correct
17 Correct 581 ms 68700 KB Output is correct
18 Correct 546 ms 68532 KB Output is correct
19 Correct 490 ms 68456 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 712 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 720 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 9 ms 1748 KB Output is correct
14 Correct 7 ms 1744 KB Output is correct
15 Correct 5 ms 1620 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 8 ms 1740 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 6 ms 1620 KB Output is correct
20 Correct 4 ms 1748 KB Output is correct
21 Correct 2 ms 1620 KB Output is correct
22 Correct 8 ms 1748 KB Output is correct
23 Correct 6 ms 1748 KB Output is correct
24 Correct 7 ms 1748 KB Output is correct
25 Correct 330 ms 66368 KB Output is correct
26 Correct 316 ms 66360 KB Output is correct
27 Correct 339 ms 66620 KB Output is correct
28 Correct 314 ms 66368 KB Output is correct
29 Correct 113 ms 67820 KB Output is correct
30 Correct 324 ms 67772 KB Output is correct
31 Correct 100 ms 67500 KB Output is correct
32 Correct 90 ms 66460 KB Output is correct
33 Correct 85 ms 66624 KB Output is correct
34 Correct 273 ms 67756 KB Output is correct
35 Correct 261 ms 67764 KB Output is correct
36 Correct 435 ms 67124 KB Output is correct
37 Correct 336 ms 68536 KB Output is correct
38 Correct 576 ms 67444 KB Output is correct
39 Correct 202 ms 68128 KB Output is correct
40 Correct 197 ms 68148 KB Output is correct
41 Correct 191 ms 68364 KB Output is correct
42 Correct 477 ms 68500 KB Output is correct
43 Correct 405 ms 68556 KB Output is correct
44 Correct 423 ms 68500 KB Output is correct
45 Correct 629 ms 67656 KB Output is correct
46 Correct 589 ms 66892 KB Output is correct
47 Correct 566 ms 66444 KB Output is correct
48 Correct 473 ms 66324 KB Output is correct
49 Correct 480 ms 66196 KB Output is correct
50 Correct 346 ms 67392 KB Output is correct
51 Correct 2 ms 724 KB Output is correct
52 Correct 5 ms 1748 KB Output is correct
53 Correct 247 ms 67764 KB Output is correct
54 Correct 338 ms 68388 KB Output is correct
55 Correct 344 ms 68172 KB Output is correct
56 Correct 352 ms 68424 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 7 ms 1748 KB Output is correct
59 Correct 339 ms 67788 KB Output is correct
60 Correct 581 ms 68700 KB Output is correct
61 Correct 546 ms 68532 KB Output is correct
62 Correct 490 ms 68456 KB Output is correct
63 Correct 544 ms 67096 KB Output is correct
64 Correct 652 ms 67388 KB Output is correct
65 Correct 536 ms 67208 KB Output is correct
66 Correct 143 ms 68500 KB Output is correct
67 Correct 509 ms 68536 KB Output is correct
68 Correct 380 ms 68316 KB Output is correct
69 Correct 199 ms 68412 KB Output is correct
70 Correct 483 ms 68532 KB Output is correct
71 Correct 521 ms 68532 KB Output is correct