oj.uz

답안 #536058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536058 2022-03-12T08:43:03 Z zaneyu Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 1212 ms 61588 KB 
/*input
12 1
5
1 7
10 12
3 5
8 10
5 9
7
2 11
5 8
3 12
4 6
1 9
9 10
1 4
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll sub(ll a,ll b){
    ll x=a-b;
    while(x<0) x+=MOD;
    while(x>MOD) x-=MOD;
    return x;
}
ll mult(ll a,ll b){
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<(V[i])<<((i!=sz(V)-1)?" ":"\n");
    return out;
}
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2; 
pii table[maxn][17];
int L[maxn],R[maxn];
pii arr[maxn];
struct seg{
    int mx[4*maxn],mn[4*maxn];
    void build(int idx,int l,int r){
        if(l==r){
            mn[idx]=arr[l].f,mx[idx]=arr[l].s;
            return;
        }
        int mid=(l+r)/2;
        build(idx*2,l,mid),build(idx*2+1,mid+1,r);
        mx[idx]=max(mx[idx*2],mx[idx*2+1]);
        mn[idx]=min(mn[idx*2],mn[idx*2+1]);
    }
    int qmn(int idx,int l,int r,int ql,int qr){
        if(l>qr or r<ql) return INF;
        if(ql<=l and r<=qr) return mn[idx];
        int mid=(l+r)/2;
        return min(qmn(idx*2,l,mid,ql,qr),qmn(idx*2+1,mid+1,r,ql,qr));
    }
    int qmx(int idx,int l,int r,int ql,int qr){
        if(l>qr or r<ql) return 0;
        if(ql<=l and r<=qr) return mx[idx];
        int mid=(l+r)/2;
        return max(qmx(idx*2,l,mid,ql,qr),qmx(idx*2+1,mid+1,r,ql,qr));
    }
}seg[20];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,k,m,q;
    cin>>n>>k>>m;
    vector<pii> l,r;
    REP(i,m){
        int a,b;
        cin>>a>>b;
        --a,--b;
        if(a<b) r.pb({a,b});
        else l.pb({a,b});
    }
    sort(ALL(r));
    int p=0,p2=0;
    multiset<int> s;
    REP(i,n){
        while(p2<sz(r) and r[p2].f<=i) s.insert(r[p2++].s);
        while(p<sz(r) and r[p].f+k<=i) s.erase(s.find(r[p++].s));
        if(!sz(s)) R[i]=i;
        else R[i]=*prev(s.end());
        MXTO(R[i],i);
    }
    s.clear();
    sort(ALL(l));
    reverse(ALL(l));
    p=p2=0;
    for(int i=n-1;i>=0;i--){
        while(p2<sz(l) and l[p2].f>=i) s.insert(l[p2++].s);
        while(p<sz(l) and l[p].f-k>=i) s.erase(s.find(l[p++].s));
        if(!sz(s)) L[i]=i;
        else L[i]=*s.begin();
        MNTO(L[i],i);
    }
    REP(i,n) table[i][0]={L[i],R[i]};
    REP1(j,16){
        REP(i,n){
            arr[i]=table[i][j-1];
        }
        seg[j-1].build(1,0,n-1);
        REP(i,n){
            table[i][j]={seg[j-1].qmn(1,0,n-1,table[i][j-1].f,table[i][j-1].s),seg[j-1].qmx(1,0,n-1,table[i][j-1].f,table[i][j-1].s)};
            //cout<<table[i][j]<<'\n';
        }
    }
    int j=16;
    REP(i,n){
        arr[i]=table[i][j];
    }
    seg[j].build(1,0,n-1);
    cin>>q;
    while(q--){
        int a,b;
        cin>>a>>b;
        --a,--b;
        pii z={a,a};
        int ans=1;
        for(int j=16;j>=0;j--){
            pii nw={seg[j].qmn(1,0,n-1,z.f,z.s),seg[j].qmx(1,0,n-1,z.f,z.s)};
            if(!(nw.f<=b and b<=nw.s)) ans+=(1<<j),z=nw;
        }
        if(ans==(1<<17)) ans=-1;
        cout<<ans<<'\n';
    }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 1 ms 712 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 13 ms 1540 KB Output is correct
14 Correct 11 ms 1364 KB Output is correct
15 Correct 7 ms 1360 KB Output is correct
16 Correct 5 ms 1488 KB Output is correct
17 Correct 14 ms 1400 KB Output is correct
18 Correct 6 ms 1556 KB Output is correct
19 Correct 8 ms 1492 KB Output is correct
20 Correct 5 ms 1492 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 8 ms 1492 KB Output is correct
23 Correct 10 ms 1500 KB Output is correct
24 Correct 11 ms 1492 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 565 ms 51096 KB Output is correct
2 Correct 540 ms 51180 KB Output is correct
3 Correct 592 ms 51252 KB Output is correct
4 Correct 544 ms 51028 KB Output is correct
5 Correct 185 ms 54104 KB Output is correct
6 Correct 568 ms 51948 KB Output is correct
7 Correct 139 ms 56584 KB Output is correct
8 Correct 130 ms 52528 KB Output is correct
9 Correct 109 ms 53372 KB Output is correct
10 Correct 409 ms 51908 KB Output is correct
11 Correct 477 ms 56500 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 689 ms 53704 KB Output is correct
2 Correct 573 ms 59544 KB Output is correct
3 Correct 974 ms 55188 KB Output is correct
4 Correct 296 ms 59260 KB Output is correct
5 Correct 346 ms 59272 KB Output is correct
6 Correct 286 ms 59344 KB Output is correct
7 Correct 792 ms 59444 KB Output is correct
8 Correct 785 ms 59440 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 737 ms 55196 KB Output is correct
2 Correct 1212 ms 51564 KB Output is correct
3 Correct 1084 ms 51036 KB Output is correct
4 Correct 1057 ms 50820 KB Output is correct
5 Correct 855 ms 50544 KB Output is correct
6 Correct 817 ms 50404 KB Output is correct
7 Correct 505 ms 55772 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 9 ms 1492 KB Output is correct
10 Correct 435 ms 55576 KB Output is correct
11 Correct 598 ms 61360 KB Output is correct
12 Correct 562 ms 55032 KB Output is correct
13 Correct 610 ms 59928 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 13 ms 1480 KB Output is correct
16 Correct 540 ms 51960 KB Output is correct
17 Correct 1018 ms 61588 KB Output is correct
18 Correct 936 ms 52416 KB Output is correct
19 Correct 906 ms 52272 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 1 ms 712 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 13 ms 1540 KB Output is correct
14 Correct 11 ms 1364 KB Output is correct
15 Correct 7 ms 1360 KB Output is correct
16 Correct 5 ms 1488 KB Output is correct
17 Correct 14 ms 1400 KB Output is correct
18 Correct 6 ms 1556 KB Output is correct
19 Correct 8 ms 1492 KB Output is correct
20 Correct 5 ms 1492 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 8 ms 1492 KB Output is correct
23 Correct 10 ms 1500 KB Output is correct
24 Correct 11 ms 1492 KB Output is correct
25 Correct 565 ms 51096 KB Output is correct
26 Correct 540 ms 51180 KB Output is correct
27 Correct 592 ms 51252 KB Output is correct
28 Correct 544 ms 51028 KB Output is correct
29 Correct 185 ms 54104 KB Output is correct
30 Correct 568 ms 51948 KB Output is correct
31 Correct 139 ms 56584 KB Output is correct
32 Correct 130 ms 52528 KB Output is correct
33 Correct 109 ms 53372 KB Output is correct
34 Correct 409 ms 51908 KB Output is correct
35 Correct 477 ms 56500 KB Output is correct
36 Correct 689 ms 53704 KB Output is correct
37 Correct 573 ms 59544 KB Output is correct
38 Correct 974 ms 55188 KB Output is correct
39 Correct 296 ms 59260 KB Output is correct
40 Correct 346 ms 59272 KB Output is correct
41 Correct 286 ms 59344 KB Output is correct
42 Correct 792 ms 59444 KB Output is correct
43 Correct 785 ms 59440 KB Output is correct
44 Correct 737 ms 55196 KB Output is correct
45 Correct 1212 ms 51564 KB Output is correct
46 Correct 1084 ms 51036 KB Output is correct
47 Correct 1057 ms 50820 KB Output is correct
48 Correct 855 ms 50544 KB Output is correct
49 Correct 817 ms 50404 KB Output is correct
50 Correct 505 ms 55772 KB Output is correct
51 Correct 2 ms 724 KB Output is correct
52 Correct 9 ms 1492 KB Output is correct
53 Correct 435 ms 55576 KB Output is correct
54 Correct 598 ms 61360 KB Output is correct
55 Correct 562 ms 55032 KB Output is correct
56 Correct 610 ms 59928 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 13 ms 1480 KB Output is correct
59 Correct 540 ms 51960 KB Output is correct
60 Correct 1018 ms 61588 KB Output is correct
61 Correct 936 ms 52416 KB Output is correct
62 Correct 906 ms 52272 KB Output is correct
63 Correct 979 ms 52816 KB Output is correct
64 Correct 1109 ms 53084 KB Output is correct
65 Correct 997 ms 52648 KB Output is correct
66 Correct 220 ms 59404 KB Output is correct
67 Correct 916 ms 55164 KB Output is correct
68 Correct 589 ms 55152 KB Output is correct
69 Correct 377 ms 58544 KB Output is correct
70 Correct 800 ms 54892 KB Output is correct
71 Correct 908 ms 55068 KB Output is correct