oj.uz

Submission #751379

# Submission time Handle Problem Language Result Execution time Memory
751379 2023-05-31T13:09:49 Z Kihihihi Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 710 ms 119592 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
#include <ctime>
#include <chrono>
#include <cstdio>
#include <random>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <fstream>
#include <functional>
#include <complex>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

short skip_cin = 0;
const long long INF = 1e9, MOD = 1e9 + 7, MOD2 = 998244353, LOG = 18;
const long double EPS = 1e-9, PI = acos(-1);

struct quemin
{
    deque<pair<long long, long long>> d;
    long long l, r;

    quemin()
    {
        l = 0;
        r = -1;
    }

    void push_back(long long val)
    {
        r++;
        while (d.size() && d.back().first >= val)
        {
            d.pop_back();
        }
        d.push_back({ val, r });
    }

    void pop_front()
    {
        if (d.front().second == l)
        {
            d.pop_front();
        }
        l++;
    }

    long long get_min()
    {
        return d.front().first;
    }
};

struct quemax
{
    deque<pair<long long, long long>> d;
    long long l, r;

    quemax()
    {
        l = 0;
        r = -1;
    }

    void push_back(long long val)
    {
        r++;
        while (d.size() && d.back().first <= val)
        {
            d.pop_back();
        }
        d.push_back({ val, r });
    }

    void pop_front()
    {
        if (d.front().second == l)
        {
            d.pop_front();
        }
        l++;
    }

    long long get_max()
    {
        return d.front().first;
    }
};

struct segtree
{
    long long n;
    vector<pair<long long, long long>> t;

    segtree() {}

    segtree(vector<pair<long long, long long>>& in)
    {
        n = in.size();
        t.resize(n * 4);
        build(0, 0, n - 1, in);
    }

    void build(long long v, long long tl, long long tr, vector<pair<long long, long long>>& in)
    {
        if (tl == tr)
        {
            t[v] = in[tl];
            return;
        }

        long long tm = (tl + tr) / 2;
        build(v * 2 + 1, tl, tm, in);
        build(v * 2 + 2, tm + 1, tr, in);
        t[v].first = min(t[v * 2 + 1].first, t[v * 2 + 2].first);
        t[v].second = max(t[v * 2 + 1].second, t[v * 2 + 2].second);
    }

    pair<long long, long long> get_seg(long long v, long long tl, long long tr, long long l, long long r)
    {
        if (tr < l || r < tl)
        {
            return { INF, -INF };
        }
        if (l <= tl && tr <= r)
        {
            return t[v];
        }

        long long tm = (tl + tr) / 2;
        auto [l1, r1] = get_seg(v * 2 + 1, tl, tm, l, r);
        auto [l2, r2] = get_seg(v * 2 + 2, tm + 1, tr, l, r);
        return { min(l1, l2), max(r1, r2) };
    }

    pair<long long, long long> get(long long l, long long r)
    {
        return get_seg(0, 0, n - 1, l, r);
    }
};

void solve()
{
    long long n, k, m;
    vector<long long> tol, tor;
    cin >> n >> k >> m;
    tol.resize(n, INF);
    tor.resize(n, -INF);
    for (long long i = 0; i < m; i++)
    {
        long long a, b;
        cin >> a >> b;
        a--; b--;
        if (a < b)
        {
            tor[a] = max(tor[a], b);
        }
        else
        {
            tol[a] = min(tol[a], b);
        }
    }

    quemax qmx;
    quemin qmn;
    for (long long i = 0; i < k; i++)
    {
        qmn.push_back(tol[i]);
    }
    vector<pair<long long, long long>> sg(n);
    for (long long i = 0; i < n; i++)
    {
        qmx.push_back(tor[i]);
        if (i - k >= 0)
        {
            qmx.pop_front();
        }
        if (i > 0)
        {
            qmn.pop_front();
            if (i + k - 1 < n)
            {
                qmn.push_back(tol[i + k - 1]);
            }
        }

        sg[i].first = min(qmn.get_min(), i);
        sg[i].second = max(qmx.get_max(), i);
    }

    vector<segtree> sgtbin(LOG);
    sgtbin[0] = segtree(sg);
    for (long long i = 1; i < LOG; i++)
    {
        for (long long j = 0; j < n; j++)
        {
            sg[j] = sgtbin[i - 1].get(sg[j].first, sg[j].second);
        }
        sgtbin[i] = segtree(sg);
    }

    long long q;
    cin >> q;
    while (q--)
    {
        long long a, b;
        cin >> a >> b;
        a--; b--;
        if (a == b)
        {
            cout << 0 << "\n";
            continue;
        }

        auto [finl, finr] = sgtbin.back().get(a, a);
        if (b < finl || finr < b)
        {
            cout << -1 << "\n";
            continue;
        }

        long long left = a, right = a;
        long long ans = 1;
        for (long long i = LOG - 1; i > -1; i--)
        {
            auto [cl, cr] = sgtbin[i].get(left, right);
            if (cl <= b && b <= cr)
            {
                continue;
            }

            ans += (1ll << i);
            left = cl; right = cr;
        }
        cout << ans << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(time(NULL));

    int tst = 1;
    //cin >> tst;
    while (tst--)
    {
        solve();
    }

    return 0;
}

/*
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⠤⠖⠚⢉⣩⣭⡭⠛⠓⠲⠦⣄⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢀⡴⠋⠁⠀⠀⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠳⢦⡀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⡴⠃⢀⡴⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⣆⠀⠀⠀
⠀⠀⠀⠀⡾⠁⣠⠋⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢧⠀⠀
⠀⠀⠀⣸⠁⢰⠃⠀⠀⠀⠈⢣⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣇⠀
⠀⠀⠀⡇⠀⡾⡀⠀⠀⠀⠀⣀⣹⣆⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⠀
⠀⠀⢸⠃⢀⣇⡈⠀⠀⠀⠀⠀⠀⢀⡑⢄⡀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⢸⠀⢻⡟⡻⢶⡆⠀⠀⠀⠀⡼⠟⡳⢿⣦⡑⢄⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇
⠀⠀⣸⠀⢸⠃⡇⢀⠇⠀⠀⠀⠀⠀⡼⠀⠀⠈⣿⡗⠂⠀⠀⠀⠀⠀⠀⠀⢸⠁
⠀⠀⡏⠀⣼⠀⢳⠊⠀⠀⠀⠀⠀⠀⠱⣀⣀⠔⣸⠁⠀⠀⠀⠀⠀⠀⠀⢠⡟⠀
⠀⠀⡇⢀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⢸⠃⠀
⠀⢸⠃⠘⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠁⠀⠀⢀⠀⠀⠀⠀⠀⣾⠀⠀
⠀⣸⠀⠀⠹⡄⠀⠀⠈⠁⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠸⠀⠀⠀⠀⠀⡇⠀⠀
⠀⡏⠀⠀⠀⠙⣆⠀⠀⠀⠀⠀⠀⠀⢀⣠⢶⡇⠀⠀⢰⡀⠀⠀⠀⠀⠀⡇⠀⠀
⢰⠇⡄⠀⠀⠀⡿⢣⣀⣀⣀⡤⠴⡞⠉⠀⢸⠀⠀⠀⣿⡇⠀⠀⠀⠀⠀⣧⠀⠀
⣸⠀⡇⠀⠀⠀⠀⠀⠀⠉⠀⠀⠀⢹⠀⠀⢸⠀⠀⢀⣿⠇⠀⠀⠀⠁⠀⢸⠀⠀
⣿⠀⡇⠀⠀⠀⠀⠀⢀⡤⠤⠶⠶⠾⠤⠄⢸⠀⡀⠸⣿⣀⠀⠀⠀⠀⠀⠈⣇⠀
⡇⠀⡇⠀⠀⡀⠀⡴⠋⠀⠀⠀⠀⠀⠀⠀⠸⡌⣵⡀⢳⡇⠀⠀⠀⠀⠀⠀⢹⡀
⡇⠀⠇⠀⠀⡇⡸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⠮⢧⣀⣻⢂⠀⠀⠀⠀⠀⠀⢧
⣇⠀⢠⠀⠀⢳⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⡎⣆⠀⠀⠀⠀⠀⠘
⢻⠀⠈⠰⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠘⢮⣧⡀⠀⠀⠀⠀
⠸⡆⠀⠀⠇⣾⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠆⠀⠀⠀⠀⠀⠀⠀⠙⠳⣄⡀⢢⡀
<3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3 <3
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 9 ms 2680 KB Output is correct
14 Correct 9 ms 2644 KB Output is correct
15 Correct 6 ms 2644 KB Output is correct
16 Correct 6 ms 2644 KB Output is correct
17 Correct 11 ms 2644 KB Output is correct
18 Correct 5 ms 2636 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 5 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 7 ms 2636 KB Output is correct
23 Correct 7 ms 2644 KB Output is correct
24 Correct 8 ms 2644 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 117144 KB Output is correct
2 Correct 341 ms 117044 KB Output is correct
3 Correct 381 ms 117324 KB Output is correct
4 Correct 330 ms 117068 KB Output is correct
5 Correct 107 ms 118488 KB Output is correct
6 Correct 307 ms 118420 KB Output is correct
7 Correct 94 ms 118180 KB Output is correct
8 Correct 79 ms 116168 KB Output is correct
9 Correct 87 ms 117300 KB Output is correct
10 Correct 268 ms 118500 KB Output is correct
11 Correct 261 ms 118812 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 415 ms 118328 KB Output is correct
2 Correct 289 ms 119192 KB Output is correct
3 Correct 568 ms 118932 KB Output is correct
4 Correct 197 ms 118732 KB Output is correct
5 Correct 198 ms 117864 KB Output is correct
6 Correct 195 ms 119128 KB Output is correct
7 Correct 522 ms 119592 KB Output is correct
8 Correct 462 ms 119584 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 119220 KB Output is correct
2 Correct 710 ms 118232 KB Output is correct
3 Correct 640 ms 117660 KB Output is correct
4 Correct 646 ms 117304 KB Output is correct
5 Correct 517 ms 117036 KB Output is correct
6 Correct 507 ms 116972 KB Output is correct
7 Correct 347 ms 117976 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 8 ms 2644 KB Output is correct
10 Correct 246 ms 118480 KB Output is correct
11 Correct 331 ms 119020 KB Output is correct
12 Correct 345 ms 117872 KB Output is correct
13 Correct 347 ms 119076 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 9 ms 2644 KB Output is correct
16 Correct 348 ms 118504 KB Output is correct
17 Correct 589 ms 119212 KB Output is correct
18 Correct 561 ms 119240 KB Output is correct
19 Correct 515 ms 119128 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 9 ms 2680 KB Output is correct
14 Correct 9 ms 2644 KB Output is correct
15 Correct 6 ms 2644 KB Output is correct
16 Correct 6 ms 2644 KB Output is correct
17 Correct 11 ms 2644 KB Output is correct
18 Correct 5 ms 2636 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 5 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 7 ms 2636 KB Output is correct
23 Correct 7 ms 2644 KB Output is correct
24 Correct 8 ms 2644 KB Output is correct
25 Correct 349 ms 117144 KB Output is correct
26 Correct 341 ms 117044 KB Output is correct
27 Correct 381 ms 117324 KB Output is correct
28 Correct 330 ms 117068 KB Output is correct
29 Correct 107 ms 118488 KB Output is correct
30 Correct 307 ms 118420 KB Output is correct
31 Correct 94 ms 118180 KB Output is correct
32 Correct 79 ms 116168 KB Output is correct
33 Correct 87 ms 117300 KB Output is correct
34 Correct 268 ms 118500 KB Output is correct
35 Correct 261 ms 118812 KB Output is correct
36 Correct 415 ms 118328 KB Output is correct
37 Correct 289 ms 119192 KB Output is correct
38 Correct 568 ms 118932 KB Output is correct
39 Correct 197 ms 118732 KB Output is correct
40 Correct 198 ms 117864 KB Output is correct
41 Correct 195 ms 119128 KB Output is correct
42 Correct 522 ms 119592 KB Output is correct
43 Correct 462 ms 119584 KB Output is correct
44 Correct 348 ms 119220 KB Output is correct
45 Correct 710 ms 118232 KB Output is correct
46 Correct 640 ms 117660 KB Output is correct
47 Correct 646 ms 117304 KB Output is correct
48 Correct 517 ms 117036 KB Output is correct
49 Correct 507 ms 116972 KB Output is correct
50 Correct 347 ms 117976 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 8 ms 2644 KB Output is correct
53 Correct 246 ms 118480 KB Output is correct
54 Correct 331 ms 119020 KB Output is correct
55 Correct 345 ms 117872 KB Output is correct
56 Correct 347 ms 119076 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 9 ms 2644 KB Output is correct
59 Correct 348 ms 118504 KB Output is correct
60 Correct 589 ms 119212 KB Output is correct
61 Correct 561 ms 119240 KB Output is correct
62 Correct 515 ms 119128 KB Output is correct
63 Correct 585 ms 117836 KB Output is correct
64 Correct 648 ms 118144 KB Output is correct
65 Correct 612 ms 117892 KB Output is correct
66 Correct 146 ms 119240 KB Output is correct
67 Correct 586 ms 119252 KB Output is correct
68 Correct 371 ms 117908 KB Output is correct
69 Correct 202 ms 119232 KB Output is correct
70 Correct 400 ms 119204 KB Output is correct
71 Correct 613 ms 119276 KB Output is correct