oj.uz

답안 #967182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967182 2024-04-21T12:46:14 Z SzypkiBill Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 669 ms 121024 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pii>
#define siz(x) (int)x.size()
#define pb push_back
#define st first
#define nd second
#define rep(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
const int inf = 1e9, maxn = 1e5+5, mod = 1e9+7;

pii seg[maxn][20];
int base = (1<<17);
int n,k,m;

class segment_tree{
    vi mini;
    vi maxi;
public:
    void init(int p){
        mini.resize(base*2,inf);
        maxi.resize(base*2,-inf);
        rep(i,1,n){
            mini[i+base] = seg[i][p].st;
            maxi[i+base] = seg[i][p].nd;
        }
        for(int i=base-1; i>=1; i--){
            mini[i] = min(mini[i*2],mini[i*2+1]);
            maxi[i] = max(maxi[i*2],maxi[i*2+1]);
        }
    }
    int query_min(int a, int b){
        a+=base-1;b+=base+1;
        int ans = inf;
        while(a/2!=b/2){
            if(!(a&1))ans = min(ans,mini[a+1]);
            if(b&1)ans = min(ans,mini[b-1]);
            a/=2,b/=2;
        }
        return ans;
    }
    int query_max(int a, int b){
        a+=base-1;b+=base+1;
        int ans = -inf;
        while(a/2!=b/2){
            if(!(a&1))ans = max(ans,maxi[a+1]);
            if(b&1)ans = max(ans,maxi[b-1]);
            a/=2,b/=2;
        }
        return ans;
    }
};

class segment_tree_max{
    vi tree;
    public:
    segment_tree_max(){
        tree.resize(2*base,-inf);
    }
    void add(int a, int b, int v){
        a+=base-1;b+=base+1;
        while(a/2!=b/2){
            if(!(a&1))tree[a+1] = max(tree[a+1],v);
            if(b&1)tree[b-1] = max(tree[b-1],v);
            a/=2,b/=2;
        }
    }
    int query(int a){
        int ans = a;
        a+=base;
        while(a){
            ans = max(ans,tree[a]);
            a/=2;
        }
        return ans;
    }
};

class segment_tree_min{
    vi tree;
    public:
    segment_tree_min(){
        tree.resize(2*base,inf);
    }
    void add(int a, int b, int v){
        a+=base-1;b+=base+1;
        while(a/2!=b/2){
            if(!(a&1))tree[a+1] = min(tree[a+1],v);
            if(b&1)tree[b-1] = min(tree[b-1],v);
            a/=2,b/=2;
        }
    }
    int query(int a){
        int ans = a;
        a+=base;
        while(a){
            ans = min(ans,tree[a]);
            a/=2;
        }
        return ans;
    }
};

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k>>m;
    vii linie;
    rep(i,1,m){
        int a,b;cin>>a>>b;
        linie.pb({a,b});
    }

    segment_tree_max MX;
    for(auto [a,b] : linie){
        if(a<b)
            MX.add(a,min(a+k-1,n),b);
    }
    rep(i,1,n)seg[i][0].nd = MX.query(i);
    segment_tree_min MN;
    for(auto [a,b] : linie){
        if(a>b)
            MN.add(max(1ll,a-k+1),a,b);
    }
    rep(i,1,n)seg[i][0].st = MN.query(i);


    segment_tree tree[20];

    rep(i,1,19){
        tree[i-1].init(i-1);
        rep(j,1,n){
            seg[j][i].st = tree[i-1].query_min(seg[j][i-1].st,seg[j][i-1].nd);
            seg[j][i].nd = tree[i-1].query_max(seg[j][i-1].st,seg[j][i-1].nd);
        }
    }
  /*  rep(i,1,n)cout<<seg[i][2].st<<','<<seg[i][2].nd<<' ';cout<<'\n';
    rep(i,1,n)cout<<seg[i][3].st<<','<<seg[i][3].nd<<' ';cout<<'\n';
    return 0;
*/
    int q;cin>>q;
    rep(i,1,q){
        int a,b;cin>>a>>b;
        int ans = 0;
        pii naj = {a,a};
        for(int j=18; j>=0; j--){
            pii akt;
            akt.st = tree[j].query_min(naj.st,naj.nd);
            akt.nd = tree[j].query_max(naj.st,naj.nd);
            if(b<akt.st || b>akt.nd){
                ans+=(1<<j);
                naj = akt;
            }
        }
        ans++;
        naj.st = tree[0].query_min(naj.st,naj.nd);
        naj.nd = tree[0].query_max(naj.st,naj.nd);
        if(naj.st<=b && naj.nd>=b)cout<<ans<<'\n';
        else cout<<"-1\n";
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 82768 KB Output is correct
2 Correct 33 ms 82588 KB Output is correct
3 Correct 36 ms 82760 KB Output is correct
4 Correct 34 ms 82792 KB Output is correct
5 Correct 37 ms 82780 KB Output is correct
6 Correct 42 ms 82748 KB Output is correct
7 Correct 34 ms 82768 KB Output is correct
8 Correct 36 ms 82604 KB Output is correct
9 Correct 33 ms 82768 KB Output is correct
10 Correct 34 ms 82524 KB Output is correct
11 Correct 34 ms 82780 KB Output is correct
12 Correct 34 ms 82772 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 82768 KB Output is correct
2 Correct 33 ms 82588 KB Output is correct
3 Correct 36 ms 82760 KB Output is correct
4 Correct 34 ms 82792 KB Output is correct
5 Correct 37 ms 82780 KB Output is correct
6 Correct 42 ms 82748 KB Output is correct
7 Correct 34 ms 82768 KB Output is correct
8 Correct 36 ms 82604 KB Output is correct
9 Correct 33 ms 82768 KB Output is correct
10 Correct 34 ms 82524 KB Output is correct
11 Correct 34 ms 82780 KB Output is correct
12 Correct 34 ms 82772 KB Output is correct
13 Correct 40 ms 84816 KB Output is correct
14 Correct 39 ms 85004 KB Output is correct
15 Correct 36 ms 84816 KB Output is correct
16 Correct 37 ms 84816 KB Output is correct
17 Correct 36 ms 84816 KB Output is correct
18 Correct 44 ms 84820 KB Output is correct
19 Correct 36 ms 84908 KB Output is correct
20 Correct 36 ms 84968 KB Output is correct
21 Correct 35 ms 84816 KB Output is correct
22 Correct 37 ms 84980 KB Output is correct
23 Correct 36 ms 84828 KB Output is correct
24 Correct 47 ms 84820 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 115396 KB Output is correct
2 Correct 262 ms 115140 KB Output is correct
3 Correct 301 ms 115684 KB Output is correct
4 Correct 242 ms 115148 KB Output is correct
5 Correct 188 ms 116896 KB Output is correct
6 Correct 232 ms 119208 KB Output is correct
7 Correct 194 ms 118872 KB Output is correct
8 Correct 174 ms 116544 KB Output is correct
9 Correct 176 ms 116928 KB Output is correct
10 Correct 202 ms 119324 KB Output is correct
11 Correct 216 ms 119316 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 115908 KB Output is correct
2 Correct 352 ms 120056 KB Output is correct
3 Correct 388 ms 117500 KB Output is correct
4 Correct 237 ms 119572 KB Output is correct
5 Correct 232 ms 120136 KB Output is correct
6 Correct 210 ms 120096 KB Output is correct
7 Correct 276 ms 119932 KB Output is correct
8 Correct 395 ms 120252 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 669 ms 117496 KB Output is correct
2 Correct 520 ms 117644 KB Output is correct
3 Correct 511 ms 116268 KB Output is correct
4 Correct 490 ms 115648 KB Output is correct
5 Correct 325 ms 114760 KB Output is correct
6 Correct 397 ms 114804 KB Output is correct
7 Correct 364 ms 117508 KB Output is correct
8 Correct 36 ms 82772 KB Output is correct
9 Correct 37 ms 84972 KB Output is correct
10 Correct 346 ms 119228 KB Output is correct
11 Correct 384 ms 119752 KB Output is correct
12 Correct 384 ms 119488 KB Output is correct
13 Correct 375 ms 120064 KB Output is correct
14 Correct 33 ms 82776 KB Output is correct
15 Correct 41 ms 84820 KB Output is correct
16 Correct 300 ms 119744 KB Output is correct
17 Correct 550 ms 120044 KB Output is correct
18 Correct 505 ms 119944 KB Output is correct
19 Correct 458 ms 120512 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 82768 KB Output is correct
2 Correct 33 ms 82588 KB Output is correct
3 Correct 36 ms 82760 KB Output is correct
4 Correct 34 ms 82792 KB Output is correct
5 Correct 37 ms 82780 KB Output is correct
6 Correct 42 ms 82748 KB Output is correct
7 Correct 34 ms 82768 KB Output is correct
8 Correct 36 ms 82604 KB Output is correct
9 Correct 33 ms 82768 KB Output is correct
10 Correct 34 ms 82524 KB Output is correct
11 Correct 34 ms 82780 KB Output is correct
12 Correct 34 ms 82772 KB Output is correct
13 Correct 40 ms 84816 KB Output is correct
14 Correct 39 ms 85004 KB Output is correct
15 Correct 36 ms 84816 KB Output is correct
16 Correct 37 ms 84816 KB Output is correct
17 Correct 36 ms 84816 KB Output is correct
18 Correct 44 ms 84820 KB Output is correct
19 Correct 36 ms 84908 KB Output is correct
20 Correct 36 ms 84968 KB Output is correct
21 Correct 35 ms 84816 KB Output is correct
22 Correct 37 ms 84980 KB Output is correct
23 Correct 36 ms 84828 KB Output is correct
24 Correct 47 ms 84820 KB Output is correct
25 Correct 276 ms 115396 KB Output is correct
26 Correct 262 ms 115140 KB Output is correct
27 Correct 301 ms 115684 KB Output is correct
28 Correct 242 ms 115148 KB Output is correct
29 Correct 188 ms 116896 KB Output is correct
30 Correct 232 ms 119208 KB Output is correct
31 Correct 194 ms 118872 KB Output is correct
32 Correct 174 ms 116544 KB Output is correct
33 Correct 176 ms 116928 KB Output is correct
34 Correct 202 ms 119324 KB Output is correct
35 Correct 216 ms 119316 KB Output is correct
36 Correct 333 ms 115908 KB Output is correct
37 Correct 352 ms 120056 KB Output is correct
38 Correct 388 ms 117500 KB Output is correct
39 Correct 237 ms 119572 KB Output is correct
40 Correct 232 ms 120136 KB Output is correct
41 Correct 210 ms 120096 KB Output is correct
42 Correct 276 ms 119932 KB Output is correct
43 Correct 395 ms 120252 KB Output is correct
44 Correct 669 ms 117496 KB Output is correct
45 Correct 520 ms 117644 KB Output is correct
46 Correct 511 ms 116268 KB Output is correct
47 Correct 490 ms 115648 KB Output is correct
48 Correct 325 ms 114760 KB Output is correct
49 Correct 397 ms 114804 KB Output is correct
50 Correct 364 ms 117508 KB Output is correct
51 Correct 36 ms 82772 KB Output is correct
52 Correct 37 ms 84972 KB Output is correct
53 Correct 346 ms 119228 KB Output is correct
54 Correct 384 ms 119752 KB Output is correct
55 Correct 384 ms 119488 KB Output is correct
56 Correct 375 ms 120064 KB Output is correct
57 Correct 33 ms 82776 KB Output is correct
58 Correct 41 ms 84820 KB Output is correct
59 Correct 300 ms 119744 KB Output is correct
60 Correct 550 ms 120044 KB Output is correct
61 Correct 505 ms 119944 KB Output is correct
62 Correct 458 ms 120512 KB Output is correct
63 Correct 474 ms 116780 KB Output is correct
64 Correct 584 ms 117312 KB Output is correct
65 Correct 478 ms 117160 KB Output is correct
66 Correct 328 ms 120000 KB Output is correct
67 Correct 509 ms 120400 KB Output is correct
68 Correct 240 ms 119484 KB Output is correct
69 Correct 308 ms 119808 KB Output is correct
70 Correct 373 ms 119900 KB Output is correct
71 Correct 418 ms 121024 KB Output is correct