oj.uz

Submission #534181

# Submission time Handle Problem Language Result Execution time Memory
534181 2022-03-08T01:53:19 Z balbit Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 477 ms 106936 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define f first
#define s second

#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)

#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back

#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<" "<<#__VA_ARGS__<<" - ", _do(__VA_ARGS__)
template <typename T> void _do( T && x) {cerr<<x<<endl;}
template <typename T, typename ...S> void _do( T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT

const int maxn = 1e5+5;

int L[18][maxn], R[18][maxn];

ll lseg[18][2*maxn], rseg[18][2*maxn];

void modify(int lay, int p, int l, int r) {
    p+=maxn;
    for (lseg[lay][p] = l, rseg[lay][p]=r; p > 1; p >>=1) {
        rseg[lay][p>>1] = max(rseg[lay][p], rseg[lay][p^1]);
        lseg[lay][p>>1] = min(lseg[lay][p], lseg[lay][p^1]);
    }
}

pii query(int lay, int l, int r) {
    pii re = {maxn, -maxn};
    for (l += maxn, r += maxn; l < r; l>>=1, r>>=1) {
        if (l & 1) {
            MN(re.f, lseg[lay][l]);
            MX(re.s, rseg[lay][l]);
            ++l;
        }
        if (r & 1) {
            --r;
            MN(re.f, lseg[lay][r]);
            MX(re.s, rseg[lay][r]);
        }
    }
    return re;
}

int initl[maxn], initr[maxn];
vector<pair<int, bool> > el[maxn], er[maxn]; // event l, event r, {number to add, [1 is add, 0 is delete]}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);

    bug(1,2);

    int n,k; cin>>n>>k;
    int m; cin>>m;
    REP(i,m) {
        int a,b; cin>>a>>b; --a; --b;
        if (a < b) {
            int l = a, r = min(a+k-1, b);
            el[l].pb({b, 1}); if (r+1 < n) el[r+1].pb({b, 0});
        }else{
            int r = a, l = max(a-k+1, b);

            er[r].pb({b, 1});
            if (l-1 >= 0) er[l-1].pb({b, 0});
        }
    }

    {
        multiset<int> hv;
        REP(i, n) {
            // work with el
            for (auto e : el[i]) {
                if (e.s) {
                    hv.insert(e.f);
                }else{
                    hv.erase(hv.find(e.f));
                }
            }
            int to = hv.empty()? i : *hv.rbegin();
            bug(to);
            initl[i] = to;
        }
    }

    {
        multiset<int> hv;
        for (int i = n-1; i>=0; --i) {
            // work with er
            for (auto e : er[i]) {
                if (e.s) {
                    hv.insert(e.f);
                }else{
                    hv.erase(hv.find(e.f));
                }
            }
            int to = hv.empty()? i : *hv.begin();
            bug(i,to);
            initr[i] = to;
        }
    }

    REP(i,n) {
        L[0][i] = initr[i];
        R[0][i] = initl[i];
        modify(0, i, L[0][i], R[0][i]);
        bug(0, L[0][i], R[0][i]);
    }

    for (int j = 1; j<18; ++j) {
        REP(i,n) {
            tie(L[j][i], R[j][i]) = query(j-1, L[j-1][i], R[j-1][i] + 1);
        }
        REP(i,n) {
//            if (j <= 2) {
//                bug(j, L[j][i], R[j][i]);
//            }
            modify(j, i, L[j][i], R[j][i]);
        }
    }

    int q; cin>>q;
    while (q--) {
        int s,t; cin>>s>>t;
        --s; --t;
        int nl = s, nr = s;
        bool pos = 0;
        int re = 0;
        for (int j = 17; j>=0; --j) {
            int tl, tr; tie(tl, tr) = query(j, nl, nr+1);
            if (tl <= t && tr >= t) {
                pos = 1;
            }else{
                re += (1<<j);
                tie(nl, nr) = tie(tl, tr);
            }
        }
        ++re;
        if (pos == 0) re = -1;
        cout<<re<<endl;
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6988 KB Output is correct
2 Correct 4 ms 6860 KB Output is correct
3 Correct 4 ms 6988 KB Output is correct
4 Correct 4 ms 6988 KB Output is correct
5 Correct 4 ms 6988 KB Output is correct
6 Correct 5 ms 6940 KB Output is correct
7 Correct 4 ms 6948 KB Output is correct
8 Correct 4 ms 6860 KB Output is correct
9 Correct 4 ms 6988 KB Output is correct
10 Correct 3 ms 6604 KB Output is correct
11 Correct 4 ms 6988 KB Output is correct
12 Correct 5 ms 6860 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6988 KB Output is correct
2 Correct 4 ms 6860 KB Output is correct
3 Correct 4 ms 6988 KB Output is correct
4 Correct 4 ms 6988 KB Output is correct
5 Correct 4 ms 6988 KB Output is correct
6 Correct 5 ms 6940 KB Output is correct
7 Correct 4 ms 6948 KB Output is correct
8 Correct 4 ms 6860 KB Output is correct
9 Correct 4 ms 6988 KB Output is correct
10 Correct 3 ms 6604 KB Output is correct
11 Correct 4 ms 6988 KB Output is correct
12 Correct 5 ms 6860 KB Output is correct
13 Correct 8 ms 8524 KB Output is correct
14 Correct 8 ms 8484 KB Output is correct
15 Correct 7 ms 8524 KB Output is correct
16 Correct 8 ms 8516 KB Output is correct
17 Correct 7 ms 8524 KB Output is correct
18 Correct 9 ms 8488 KB Output is correct
19 Correct 7 ms 8396 KB Output is correct
20 Correct 11 ms 8492 KB Output is correct
21 Correct 10 ms 8536 KB Output is correct
22 Correct 7 ms 8508 KB Output is correct
23 Correct 8 ms 8496 KB Output is correct
24 Correct 7 ms 8524 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 96336 KB Output is correct
2 Correct 197 ms 96280 KB Output is correct
3 Correct 245 ms 97384 KB Output is correct
4 Correct 193 ms 95964 KB Output is correct
5 Correct 292 ms 104968 KB Output is correct
6 Correct 227 ms 103732 KB Output is correct
7 Correct 227 ms 104004 KB Output is correct
8 Correct 219 ms 98384 KB Output is correct
9 Correct 199 ms 98584 KB Output is correct
10 Correct 252 ms 103708 KB Output is correct
11 Correct 272 ms 103872 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 98884 KB Output is correct
2 Correct 333 ms 105540 KB Output is correct
3 Correct 274 ms 99128 KB Output is correct
4 Correct 259 ms 104488 KB Output is correct
5 Correct 307 ms 106312 KB Output is correct
6 Correct 316 ms 106936 KB Output is correct
7 Correct 310 ms 104384 KB Output is correct
8 Correct 367 ms 104716 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 106152 KB Output is correct
2 Correct 330 ms 98240 KB Output is correct
3 Correct 313 ms 95044 KB Output is correct
4 Correct 282 ms 93096 KB Output is correct
5 Correct 213 ms 92036 KB Output is correct
6 Correct 249 ms 91928 KB Output is correct
7 Correct 245 ms 100636 KB Output is correct
8 Correct 4 ms 6940 KB Output is correct
9 Correct 8 ms 8524 KB Output is correct
10 Correct 364 ms 106032 KB Output is correct
11 Correct 353 ms 105704 KB Output is correct
12 Correct 377 ms 103708 KB Output is correct
13 Correct 375 ms 105668 KB Output is correct
14 Correct 4 ms 6860 KB Output is correct
15 Correct 9 ms 8524 KB Output is correct
16 Correct 277 ms 101680 KB Output is correct
17 Correct 399 ms 101828 KB Output is correct
18 Correct 407 ms 101832 KB Output is correct
19 Correct 410 ms 101840 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6988 KB Output is correct
2 Correct 4 ms 6860 KB Output is correct
3 Correct 4 ms 6988 KB Output is correct
4 Correct 4 ms 6988 KB Output is correct
5 Correct 4 ms 6988 KB Output is correct
6 Correct 5 ms 6940 KB Output is correct
7 Correct 4 ms 6948 KB Output is correct
8 Correct 4 ms 6860 KB Output is correct
9 Correct 4 ms 6988 KB Output is correct
10 Correct 3 ms 6604 KB Output is correct
11 Correct 4 ms 6988 KB Output is correct
12 Correct 5 ms 6860 KB Output is correct
13 Correct 8 ms 8524 KB Output is correct
14 Correct 8 ms 8484 KB Output is correct
15 Correct 7 ms 8524 KB Output is correct
16 Correct 8 ms 8516 KB Output is correct
17 Correct 7 ms 8524 KB Output is correct
18 Correct 9 ms 8488 KB Output is correct
19 Correct 7 ms 8396 KB Output is correct
20 Correct 11 ms 8492 KB Output is correct
21 Correct 10 ms 8536 KB Output is correct
22 Correct 7 ms 8508 KB Output is correct
23 Correct 8 ms 8496 KB Output is correct
24 Correct 7 ms 8524 KB Output is correct
25 Correct 204 ms 96336 KB Output is correct
26 Correct 197 ms 96280 KB Output is correct
27 Correct 245 ms 97384 KB Output is correct
28 Correct 193 ms 95964 KB Output is correct
29 Correct 292 ms 104968 KB Output is correct
30 Correct 227 ms 103732 KB Output is correct
31 Correct 227 ms 104004 KB Output is correct
32 Correct 219 ms 98384 KB Output is correct
33 Correct 199 ms 98584 KB Output is correct
34 Correct 252 ms 103708 KB Output is correct
35 Correct 272 ms 103872 KB Output is correct
36 Correct 262 ms 98884 KB Output is correct
37 Correct 333 ms 105540 KB Output is correct
38 Correct 274 ms 99128 KB Output is correct
39 Correct 259 ms 104488 KB Output is correct
40 Correct 307 ms 106312 KB Output is correct
41 Correct 316 ms 106936 KB Output is correct
42 Correct 310 ms 104384 KB Output is correct
43 Correct 367 ms 104716 KB Output is correct
44 Correct 477 ms 106152 KB Output is correct
45 Correct 330 ms 98240 KB Output is correct
46 Correct 313 ms 95044 KB Output is correct
47 Correct 282 ms 93096 KB Output is correct
48 Correct 213 ms 92036 KB Output is correct
49 Correct 249 ms 91928 KB Output is correct
50 Correct 245 ms 100636 KB Output is correct
51 Correct 4 ms 6940 KB Output is correct
52 Correct 8 ms 8524 KB Output is correct
53 Correct 364 ms 106032 KB Output is correct
54 Correct 353 ms 105704 KB Output is correct
55 Correct 377 ms 103708 KB Output is correct
56 Correct 375 ms 105668 KB Output is correct
57 Correct 4 ms 6860 KB Output is correct
58 Correct 9 ms 8524 KB Output is correct
59 Correct 277 ms 101680 KB Output is correct
60 Correct 399 ms 101828 KB Output is correct
61 Correct 407 ms 101832 KB Output is correct
62 Correct 410 ms 101840 KB Output is correct
63 Correct 321 ms 95172 KB Output is correct
64 Correct 370 ms 96088 KB Output is correct
65 Correct 333 ms 95432 KB Output is correct
66 Correct 329 ms 103352 KB Output is correct
67 Correct 376 ms 101760 KB Output is correct
68 Correct 300 ms 101684 KB Output is correct
69 Correct 324 ms 104072 KB Output is correct
70 Correct 322 ms 101652 KB Output is correct
71 Correct 369 ms 101900 KB Output is correct