oj.uz

답안 #526874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526874 2022-02-16T13:16:22 Z abc864197532 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 1940 ms 226196 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty()) return o << "{}";
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout); 
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 1e5 + 7, logN = 18, K = 111, M = N * 20;

pii mer(pii a, pii b) {
    return mp(min(a.X, b.X), max(a.Y, b.Y));
}

struct Seg {
    int l, r, m, mn, mx, lzmn, lzmx;
    Seg* ch[2];
    Seg (int _l, int _r) : l(_l), r(_r), m(l + r >> 1), lzmn(-1), lzmx(-1) {
        if (r - l > 1) {
            ch[0] = new Seg(l, m);
            ch[1] = new Seg(m, r);
            pull();
        } else {
            mn = l, mx = l + 1;
        }
    }
    void pull() {
        mn = min(ch[0]->mn, ch[1]->mn);
        mx = max(ch[0]->mx, ch[1]->mx);
    }
    void give_mn(int v) {
        if (lzmn != -1 && lzmn <= v)
            return;
        mn = min(mn, v), lzmn = v;
    }
    void give_mx(int v) {
        if (lzmx != -1 && lzmx >= v)
            return;
        mx = max(mx, v), lzmx = v;
    }
    void push() {
        if (lzmn != -1)
            ch[0]->give_mn(lzmn), ch[1]->give_mn(lzmn);
        if (lzmx != -1)
            ch[0]->give_mx(lzmx), ch[1]->give_mx(lzmx);
        lzmn = lzmx = -1;
    }
    void modify(int a, int b, int mnv, int mxv) {
        if (a <= l && r <= b)
            give_mn(mnv), give_mx(mxv);
        else {
            push();
            if (a < m)
                ch[0]->modify(a, b, mnv, mxv);
            if (m < b)
                ch[1]->modify(a, b, mnv, mxv);
            pull();
        }
    }
    pii query(int a, int b) {
        if (a <= l && r <= b)
            return mp(mn, mx);
        pii ans = mp(1 << 30, -1 << 30);
        push();
        if (a < m)
            ans = mer(ans, ch[0]->query(a, b));
        if (m < b)
            ans = mer(ans, ch[1]->query(a, b));
        return ans;
    }
};

Seg* root[logN];

int main () {
    owo;
    int n, k, m, q;
    cin >> n >> k >> m;
    root[0] = new Seg(0, n);
    for (int i = 0, l, r; i < m; ++i) {
        cin >> l >> r;
        if (l < r)
            --l, root[0]->modify(l, min(l + k, r), 1 << 30, r);
        else
            --r, root[0]->modify(max(l - k, r), l, r, -1 << 30);
    }
    for (int j = 1; j < logN; ++j) {
        root[j] = new Seg(0, n);
        for (int i = 0; i < n; ++i) {
            int l, r; tie(l, r) = root[j - 1]->query(i, i + 1);
            tie(l, r) = root[j - 1]->query(l, r);
            root[j]->modify(i, i + 1, l, r);
        }
    }
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r, --l, --r;
        {
            int curl, curr;
            tie(curl, curr) = root[logN - 1]->query(l, l + 1);
            if (r < curl || curr <= r) {
                cout << -1 << '\n';
                continue;
            }
        }
        int curl = l, curr = l + 1, ans = 0;
        for (int i = logN - 1; ~i; --i) {
            int nxtl, nxtr; tie(nxtl, nxtr) = root[i]->query(curl, curr);
            if (r < nxtl || nxtr <= r) {
                ans |= 1 << i;
                tie(curl, curr) = mp(nxtl, nxtr);
            }
        }
        cout << ans + 1 << '\n';
    }
}

Compilation message

Main.cpp: In constructor 'Seg::Seg(int, int)':
Main.cpp:55:46: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |     Seg (int _l, int _r) : l(_l), r(_r), m(l + r >> 1), lzmn(-1), lzmx(-1) {
      |                                            ~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 3 ms 972 KB Output is correct
4 Correct 2 ms 972 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 3 ms 972 KB Output is correct
7 Correct 2 ms 844 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 4 ms 972 KB Output is correct
12 Correct 2 ms 988 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 3 ms 972 KB Output is correct
4 Correct 2 ms 972 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 3 ms 972 KB Output is correct
7 Correct 2 ms 844 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 4 ms 972 KB Output is correct
12 Correct 2 ms 988 KB Output is correct
13 Correct 20 ms 4812 KB Output is correct
14 Correct 19 ms 4824 KB Output is correct
15 Correct 17 ms 4736 KB Output is correct
16 Correct 14 ms 4748 KB Output is correct
17 Correct 19 ms 4756 KB Output is correct
18 Correct 14 ms 4812 KB Output is correct
19 Correct 21 ms 4716 KB Output is correct
20 Correct 16 ms 4796 KB Output is correct
21 Correct 12 ms 4704 KB Output is correct
22 Correct 21 ms 4740 KB Output is correct
23 Correct 17 ms 4812 KB Output is correct
24 Correct 16 ms 4724 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1038 ms 225732 KB Output is correct
2 Correct 973 ms 225732 KB Output is correct
3 Correct 1025 ms 225688 KB Output is correct
4 Correct 923 ms 225676 KB Output is correct
5 Correct 839 ms 225680 KB Output is correct
6 Correct 948 ms 225680 KB Output is correct
7 Correct 733 ms 225680 KB Output is correct
8 Correct 705 ms 223376 KB Output is correct
9 Correct 756 ms 225648 KB Output is correct
10 Correct 1018 ms 225720 KB Output is correct
11 Correct 948 ms 225716 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1393 ms 225900 KB Output is correct
2 Correct 1103 ms 225816 KB Output is correct
3 Correct 1576 ms 226016 KB Output is correct
4 Correct 1056 ms 225800 KB Output is correct
5 Correct 1048 ms 223660 KB Output is correct
6 Correct 998 ms 225880 KB Output is correct
7 Correct 1474 ms 225896 KB Output is correct
8 Correct 1477 ms 225956 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1127 ms 225864 KB Output is correct
2 Correct 1930 ms 225916 KB Output is correct
3 Correct 1877 ms 226120 KB Output is correct
4 Correct 1676 ms 226100 KB Output is correct
5 Correct 1384 ms 225916 KB Output is correct
6 Correct 1392 ms 225832 KB Output is correct
7 Correct 1134 ms 225772 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 16 ms 4752 KB Output is correct
10 Correct 1031 ms 225660 KB Output is correct
11 Correct 1206 ms 225812 KB Output is correct
12 Correct 1193 ms 223520 KB Output is correct
13 Correct 1312 ms 225904 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 20 ms 4824 KB Output is correct
16 Correct 1018 ms 225732 KB Output is correct
17 Correct 1785 ms 225980 KB Output is correct
18 Correct 1630 ms 226024 KB Output is correct
19 Correct 1447 ms 226116 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 3 ms 972 KB Output is correct
4 Correct 2 ms 972 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 3 ms 972 KB Output is correct
7 Correct 2 ms 844 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 4 ms 972 KB Output is correct
12 Correct 2 ms 988 KB Output is correct
13 Correct 20 ms 4812 KB Output is correct
14 Correct 19 ms 4824 KB Output is correct
15 Correct 17 ms 4736 KB Output is correct
16 Correct 14 ms 4748 KB Output is correct
17 Correct 19 ms 4756 KB Output is correct
18 Correct 14 ms 4812 KB Output is correct
19 Correct 21 ms 4716 KB Output is correct
20 Correct 16 ms 4796 KB Output is correct
21 Correct 12 ms 4704 KB Output is correct
22 Correct 21 ms 4740 KB Output is correct
23 Correct 17 ms 4812 KB Output is correct
24 Correct 16 ms 4724 KB Output is correct
25 Correct 1038 ms 225732 KB Output is correct
26 Correct 973 ms 225732 KB Output is correct
27 Correct 1025 ms 225688 KB Output is correct
28 Correct 923 ms 225676 KB Output is correct
29 Correct 839 ms 225680 KB Output is correct
30 Correct 948 ms 225680 KB Output is correct
31 Correct 733 ms 225680 KB Output is correct
32 Correct 705 ms 223376 KB Output is correct
33 Correct 756 ms 225648 KB Output is correct
34 Correct 1018 ms 225720 KB Output is correct
35 Correct 948 ms 225716 KB Output is correct
36 Correct 1393 ms 225900 KB Output is correct
37 Correct 1103 ms 225816 KB Output is correct
38 Correct 1576 ms 226016 KB Output is correct
39 Correct 1056 ms 225800 KB Output is correct
40 Correct 1048 ms 223660 KB Output is correct
41 Correct 998 ms 225880 KB Output is correct
42 Correct 1474 ms 225896 KB Output is correct
43 Correct 1477 ms 225956 KB Output is correct
44 Correct 1127 ms 225864 KB Output is correct
45 Correct 1930 ms 225916 KB Output is correct
46 Correct 1877 ms 226120 KB Output is correct
47 Correct 1676 ms 226100 KB Output is correct
48 Correct 1384 ms 225916 KB Output is correct
49 Correct 1392 ms 225832 KB Output is correct
50 Correct 1134 ms 225772 KB Output is correct
51 Correct 2 ms 972 KB Output is correct
52 Correct 16 ms 4752 KB Output is correct
53 Correct 1031 ms 225660 KB Output is correct
54 Correct 1206 ms 225812 KB Output is correct
55 Correct 1193 ms 223520 KB Output is correct
56 Correct 1312 ms 225904 KB Output is correct
57 Correct 3 ms 972 KB Output is correct
58 Correct 20 ms 4824 KB Output is correct
59 Correct 1018 ms 225732 KB Output is correct
60 Correct 1785 ms 225980 KB Output is correct
61 Correct 1630 ms 226024 KB Output is correct
62 Correct 1447 ms 226116 KB Output is correct
63 Correct 1712 ms 226196 KB Output is correct
64 Correct 1940 ms 226084 KB Output is correct
65 Correct 1737 ms 226196 KB Output is correct
66 Correct 879 ms 225808 KB Output is correct
67 Correct 1563 ms 226008 KB Output is correct
68 Correct 1343 ms 223556 KB Output is correct
69 Correct 1077 ms 225916 KB Output is correct
70 Correct 1240 ms 225988 KB Output is correct
71 Correct 1821 ms 225888 KB Output is correct