oj.uz

Submission #823868

# Submission time Handle Problem Language Result Execution time Memory
823868 2023-08-13T09:02:50 Z Cookie Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 665 ms 45080 KB 
#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int mxn = 2e5, mxr = 25e3, sq = 500, mxv = 1e6 + 5, mxvv = 130;
struct Node{
    int mn, mx;
    Node(){}
    Node(int _mn, int _mx){
        mn = _mn; mx = _mx;
    }
};

struct ST{
    Node st[4 * mxn + 1];
    Node comb(Node a, Node b){
        return(Node(min(a.mn, b.mn), max(a.mx, b.mx)));
    }
    void upd(int nd, int l, int r, int id, Node v){
        if(id < l || id > r)return;
        if(l == r){
            
            st[nd] = v;
            return;
        }
        int mid = (l + r) >> 1;
        upd(nd << 1, l, mid, id, v); upd(nd << 1 | 1, mid + 1, r, id, v);
        st[nd] = comb(st[nd << 1], st[nd << 1 | 1]);
    }
    Node get(int nd, int l, int r, int ql, int qr){
        if(ql <= l && qr >= r)return(st[nd]);
        int mid = (l + r) >> 1;
        if(qr <= mid)return(get(nd << 1, l, mid, ql, qr));
        else if(ql > mid)return(get(nd << 1 | 1, mid + 1, r, ql, qr));
        else return(comb(get(nd << 1, l, mid, ql, qr), get(nd << 1 | 1, mid + 1, r, ql, qr)));
    }

};
int n, k, m;
ST st[21];
int mx[4 * mxn + 1], mn[4 * mxn + 1];
void updmx(int nd, int l, int r, int ql, int qr, int v){
    if(ql > r || qr < l)return;
    if(ql <= l && qr >= r){
        mx[nd] = max(mx[nd], v);
        return;
    }
    int mid = (l + r) >> 1;
    updmx(nd << 1, l, mid, ql, qr, v); updmx(nd << 1 | 1, mid + 1, r, ql, qr, v);
}
int getmx(int nd, int l, int r, int id){
    if(l == r)return(mx[nd]);
    int mid = (l + r) >> 1;
    if(id <= mid){
        return(max(mx[nd], getmx(nd << 1, l, mid, id)));
    }else{
        return(max(mx[nd], getmx(nd << 1 | 1, mid + 1, r, id)));
    }
}
void updmn(int nd, int l, int r, int ql, int qr, int v){
    if(ql > r || qr < l)return;
    if(ql <= l && qr >= r){
        mn[nd] = min(mn[nd], v);
        return;
    }
    int mid = (l + r) >> 1;
    updmn(nd << 1, l, mid, ql, qr, v); updmn(nd << 1 | 1, mid + 1, r, ql, qr, v);
}
int getmn(int nd, int l, int r, int id){
    if(l == r)return(mn[nd]);
    int mid = (l + r) >> 1;
    if(id <= mid){
        return(min(mn[nd], getmn(nd << 1, l, mid, id)));
    }else{
        return(min(mn[nd], getmn(nd << 1 | 1, mid + 1, r, id)));
    }
}
int solve(int l, int r){
    int atl = l, atr = l;
    Node can = st[18].get(1, 1, n, atl, atr);
    if(r >= can.mn && r <= can.mx){
        int ans = 0;
        for(int i = 17; i >= 0; i--){
            Node curr = st[i].get(1, 1, n, atl, atr);
            if(r >= curr.mn && r <= curr.mx){}
            else{
                ans += (1 << i);
                atl = curr.mn; atr = curr.mx;
            }
        }
        return(ans + 1);
    }else{
        return(-1);
    }
}
int main(){
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k >> m;
    for(int i = 1; i <= 4 * n; i++)mn[i] = n;
    for(int i = 0; i < m; i++){
        int l, r; cin >> l >> r;
        if(l < r){
            updmx(1, 1, n, l, min(l + k - 1, r - 1), r);
        }else{
            updmn(1, 1, n, max(l - k + 1, r + 1), l, r);
        }
    }
    for(int i = 1; i <= n; i++){
        st[0].upd(1, 1, n, i, Node(min(getmn(1, 1, n, i), i), max(getmx(1, 1, n, i), i)));
        
    }

    for(int i = 1; i < 19; i++){
        for(int j = 1; j <= n; j++){
            Node curr = st[i - 1].get(1, 1, n, j, j);
            
            Node nw = st[i - 1].get(1, 1, n, curr.mn, curr.mx);
            st[i].upd(1, 1, n, j, nw);
        }
    }

    int q; cin >> q;
    while(q--){
        int l, r; cin >> l >> r;
        cout << solve(l, r) << "\n";
    }

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 576 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 0 ms 456 KB Output is correct
11 Correct 1 ms 580 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 2 ms 596 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 576 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 0 ms 456 KB Output is correct
11 Correct 1 ms 580 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 9 ms 1108 KB Output is correct
14 Correct 9 ms 1100 KB Output is correct
15 Correct 7 ms 1108 KB Output is correct
16 Correct 6 ms 1100 KB Output is correct
17 Correct 9 ms 1108 KB Output is correct
18 Correct 6 ms 1108 KB Output is correct
19 Correct 8 ms 1172 KB Output is correct
20 Correct 6 ms 1108 KB Output is correct
21 Correct 5 ms 1108 KB Output is correct
22 Correct 7 ms 1108 KB Output is correct
23 Correct 8 ms 1108 KB Output is correct
24 Correct 8 ms 1084 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 42176 KB Output is correct
2 Correct 429 ms 42500 KB Output is correct
3 Correct 459 ms 42500 KB Output is correct
4 Correct 422 ms 42372 KB Output is correct
5 Correct 331 ms 44368 KB Output is correct
6 Correct 432 ms 43980 KB Output is correct
7 Correct 313 ms 43980 KB Output is correct
8 Correct 293 ms 43104 KB Output is correct
9 Correct 296 ms 43096 KB Output is correct
10 Correct 419 ms 44336 KB Output is correct
11 Correct 433 ms 44236 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 486 ms 43648 KB Output is correct
2 Correct 434 ms 45024 KB Output is correct
3 Correct 593 ms 43608 KB Output is correct
4 Correct 378 ms 44676 KB Output is correct
5 Correct 376 ms 44844 KB Output is correct
6 Correct 379 ms 45020 KB Output is correct
7 Correct 504 ms 44956 KB Output is correct
8 Correct 501 ms 45056 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 44972 KB Output is correct
2 Correct 665 ms 43768 KB Output is correct
3 Correct 645 ms 43072 KB Output is correct
4 Correct 604 ms 42828 KB Output is correct
5 Correct 509 ms 42700 KB Output is correct
6 Correct 536 ms 42712 KB Output is correct
7 Correct 450 ms 43872 KB Output is correct
8 Correct 1 ms 584 KB Output is correct
9 Correct 7 ms 1080 KB Output is correct
10 Correct 422 ms 44248 KB Output is correct
11 Correct 462 ms 44884 KB Output is correct
12 Correct 470 ms 44880 KB Output is correct
13 Correct 502 ms 45008 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 9 ms 1176 KB Output is correct
16 Correct 455 ms 43984 KB Output is correct
17 Correct 620 ms 45076 KB Output is correct
18 Correct 594 ms 44976 KB Output is correct
19 Correct 574 ms 45056 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 576 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 0 ms 456 KB Output is correct
11 Correct 1 ms 580 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 9 ms 1108 KB Output is correct
14 Correct 9 ms 1100 KB Output is correct
15 Correct 7 ms 1108 KB Output is correct
16 Correct 6 ms 1100 KB Output is correct
17 Correct 9 ms 1108 KB Output is correct
18 Correct 6 ms 1108 KB Output is correct
19 Correct 8 ms 1172 KB Output is correct
20 Correct 6 ms 1108 KB Output is correct
21 Correct 5 ms 1108 KB Output is correct
22 Correct 7 ms 1108 KB Output is correct
23 Correct 8 ms 1108 KB Output is correct
24 Correct 8 ms 1084 KB Output is correct
25 Correct 469 ms 42176 KB Output is correct
26 Correct 429 ms 42500 KB Output is correct
27 Correct 459 ms 42500 KB Output is correct
28 Correct 422 ms 42372 KB Output is correct
29 Correct 331 ms 44368 KB Output is correct
30 Correct 432 ms 43980 KB Output is correct
31 Correct 313 ms 43980 KB Output is correct
32 Correct 293 ms 43104 KB Output is correct
33 Correct 296 ms 43096 KB Output is correct
34 Correct 419 ms 44336 KB Output is correct
35 Correct 433 ms 44236 KB Output is correct
36 Correct 486 ms 43648 KB Output is correct
37 Correct 434 ms 45024 KB Output is correct
38 Correct 593 ms 43608 KB Output is correct
39 Correct 378 ms 44676 KB Output is correct
40 Correct 376 ms 44844 KB Output is correct
41 Correct 379 ms 45020 KB Output is correct
42 Correct 504 ms 44956 KB Output is correct
43 Correct 501 ms 45056 KB Output is correct
44 Correct 439 ms 44972 KB Output is correct
45 Correct 665 ms 43768 KB Output is correct
46 Correct 645 ms 43072 KB Output is correct
47 Correct 604 ms 42828 KB Output is correct
48 Correct 509 ms 42700 KB Output is correct
49 Correct 536 ms 42712 KB Output is correct
50 Correct 450 ms 43872 KB Output is correct
51 Correct 1 ms 584 KB Output is correct
52 Correct 7 ms 1080 KB Output is correct
53 Correct 422 ms 44248 KB Output is correct
54 Correct 462 ms 44884 KB Output is correct
55 Correct 470 ms 44880 KB Output is correct
56 Correct 502 ms 45008 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 9 ms 1176 KB Output is correct
59 Correct 455 ms 43984 KB Output is correct
60 Correct 620 ms 45076 KB Output is correct
61 Correct 594 ms 44976 KB Output is correct
62 Correct 574 ms 45056 KB Output is correct
63 Correct 592 ms 42852 KB Output is correct
64 Correct 656 ms 43196 KB Output is correct
65 Correct 583 ms 42908 KB Output is correct
66 Correct 366 ms 45028 KB Output is correct
67 Correct 596 ms 44816 KB Output is correct
68 Correct 468 ms 44892 KB Output is correct
69 Correct 379 ms 44872 KB Output is correct
70 Correct 476 ms 44804 KB Output is correct
71 Correct 657 ms 45080 KB Output is correct