oj.uz

Submission #534869

# Submission time Handle Problem Language Result Execution time Memory
534869 2022-03-09T05:19:06 Z PixelCat Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 1255 ms 325252 KB 
/*       code by the cute PixelCat owo       */
/*   as cute as nacho neko (aka. my wife)!   */
// #pragma GCC
// optimize("O4,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#define int LL  //__int128
#define double long double
using namespace std;
using LL = long long;
using uLL = unsigned long long;
using pii = pair<int, int>;

#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second
#define L(id) (id * 2 + 1)
#define R(id) (id * 2 + 2)
#define LO(x) (x & (-x))

#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair

// #define MOD (int)(998244353)
#define MOD (int)((LL)1e9 + 7)
#define INF (int)(9000000000000000000ll)  // 9e18
#define EPS (1e-6)

#ifdef NYAOWO
#include "library/debug.hpp"
inline void USACO(const string &s) {
    cerr << "USACO: " << s << "\n";
}

#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

#endif

inline void NYA() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}
inline int gcd(int a, int b) {
    return __gcd(a, b);
}
inline int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}
int fpow(int b, int p, const int &mod) {
    int ans = 1;
    while (p) {
        if (p & 1) ans = ans * b % mod;
        p /= 2;
        b = b * b % mod;
    }
    return ans;
}
int fpow(int b, int p) {
    return fpow(b, p, MOD);
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
    if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
    if (_b > _a) _a = _b;
}
// mt19937_64 rng(
//     chrono::steady_clock::now().time_since_epoch().count());

int n;

struct Sparse{
    int32_t a[100010][20];
    void set(int i,int x){
        a[i][0]=x;
    }
    void build(bool f){
        For(j,0,18) For(i,1,n){
            int i2=i+(1<<j);
            if(i2>n) a[i][j+1]=a[i][j];
            else if(f) a[i][j+1]=max(a[i][j],a[i2][j]);
            else a[i][j+1]=min(a[i][j],a[i2][j]);
        }
    }
    int rmxq(int l,int r){
        int k=__lg(r-l+1);
        return max(a[l][k],a[r-(1<<k)+1][k]);
    }
    int rmnq(int l,int r){
        int k=__lg(r-l+1);
        return min(a[l][k],a[r-(1<<k)+1][k]);
    }
}lsp[20],rsp[20];

// take n trains from s
bool step(int s,int t,int ns){
    int l=s;
    int r=s;
    For(j,0,19) if(ns&(1<<j)){
        int tl=lsp[j].rmnq(l,r);
        int tr=rsp[j].rmxq(l,r);
        if(tl>l) debug(s,t,ns);
        l=tl; r=tr;
    }
    return l<=t && t<=r;
}

int32_t main() {
    NYA();
    // nyaacho >/////<
    // miku sama bless me >/////<
    cin>>n;
    int k; cin>>k;
    int m; cin>>m;
    {
        vector<pii> vr,vl;
        For(i,1,m){
            int l,r; cin>>l>>r;
            if(l<r) vr.eb(l,r);
            else vl.eb(r,l);
        }

        m=sz(vr);
        sort(all(vr));
        multiset<int> st;
        int itl=0,itr=-1;
        For(r,1,n){
            while(itr<m-1 && vr[itr+1].F==r){
                itr++;
                st.insert(vr[itr].S);
            }
            while(itl<=m-1 && vr[itl].F<=r-k){
                st.erase(st.find(vr[itl].S));
                itl++;
            }
            int res=r;
            if(sz(st)) res=max(res,*st.rbegin());
            rsp[0].set(r,res);
        }

        m=sz(vl);
        sort(all(vl),[](const pii &a,const pii &b){
            return a.S<b.S;
        });
        st.clear();
        itl=m-1;
        itr=m;
        Forr(l,n,1){
            while(itr>0 && vl[itr-1].S==l){
                itr--;
                st.insert(vl[itr].F);
            }
            while(itl>=0 && vl[itl].S>=l+k){
                st.erase(st.find(vl[itl].F));
                itl--;
            }
            int res=l;
            if(sz(st)) res=min(res,*st.begin());
            lsp[0].set(l,res);
        }
    }
    lsp[0].build(false);
    rsp[0].build(true);
    For(j,1,19){
        For(i,1,n){
            int l=lsp[j-1].a[i][0];
            int r=rsp[j-1].a[i][0];
            lsp[j].set(i,lsp[j-1].rmnq(l,r));
            rsp[j].set(i,rsp[j-1].rmxq(l,r));
        }
        lsp[j].build(false);
        rsp[j].build(true);
    }
    int q; cin>>q;
    while(q--){
        int s,t; cin>>s>>t;
        int lo=-1,hi=(1<<20)-1;
        while(hi-lo>1){
            int mi=(hi+lo)/2;
            if(step(s,t,mi)) hi=mi;
            else lo=mi;
        }
        if(hi+1==(1<<20)){
            cout<<"-1\n";
        }else{
            cout<<hi<<"\n";
        }
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 3 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 3 ms 1484 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 2 ms 1600 KB Output is correct
7 Correct 2 ms 1484 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 3 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 3 ms 1484 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 2 ms 1600 KB Output is correct
7 Correct 2 ms 1484 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 12 ms 6896 KB Output is correct
14 Correct 11 ms 6984 KB Output is correct
15 Correct 5 ms 6860 KB Output is correct
16 Correct 15 ms 7020 KB Output is correct
17 Correct 12 ms 6988 KB Output is correct
18 Correct 10 ms 6988 KB Output is correct
19 Correct 11 ms 6656 KB Output is correct
20 Correct 11 ms 6988 KB Output is correct
21 Correct 6 ms 6988 KB Output is correct
22 Correct 11 ms 7028 KB Output is correct
23 Correct 11 ms 6996 KB Output is correct
24 Correct 12 ms 7028 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 688 ms 314580 KB Output is correct
2 Correct 674 ms 314456 KB Output is correct
3 Correct 692 ms 314736 KB Output is correct
4 Correct 669 ms 314432 KB Output is correct
5 Correct 791 ms 317992 KB Output is correct
6 Correct 712 ms 315908 KB Output is correct
7 Correct 723 ms 320040 KB Output is correct
8 Correct 719 ms 313148 KB Output is correct
9 Correct 721 ms 316792 KB Output is correct
10 Correct 745 ms 315872 KB Output is correct
11 Correct 729 ms 320456 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 879 ms 317356 KB Output is correct
2 Correct 1028 ms 321152 KB Output is correct
3 Correct 902 ms 317676 KB Output is correct
4 Correct 860 ms 320624 KB Output is correct
5 Correct 859 ms 317996 KB Output is correct
6 Correct 869 ms 320816 KB Output is correct
7 Correct 914 ms 320904 KB Output is correct
8 Correct 929 ms 321176 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1118 ms 319080 KB Output is correct
2 Correct 1118 ms 315432 KB Output is correct
3 Correct 1082 ms 314880 KB Output is correct
4 Correct 942 ms 314524 KB Output is correct
5 Correct 865 ms 314376 KB Output is correct
6 Correct 805 ms 314084 KB Output is correct
7 Correct 863 ms 319940 KB Output is correct
8 Correct 2 ms 1484 KB Output is correct
9 Correct 11 ms 7064 KB Output is correct
10 Correct 811 ms 319312 KB Output is correct
11 Correct 906 ms 325252 KB Output is correct
12 Correct 924 ms 314980 KB Output is correct
13 Correct 968 ms 321664 KB Output is correct
14 Correct 2 ms 1484 KB Output is correct
15 Correct 13 ms 6976 KB Output is correct
16 Correct 750 ms 313572 KB Output is correct
17 Correct 1080 ms 323112 KB Output is correct
18 Correct 943 ms 313780 KB Output is correct
19 Correct 908 ms 314068 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 3 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 3 ms 1484 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 2 ms 1600 KB Output is correct
7 Correct 2 ms 1484 KB Output is correct
8 Correct 1 ms 1612 KB Output is correct
9 Correct 2 ms 1484 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 2 ms 1484 KB Output is correct
13 Correct 12 ms 6896 KB Output is correct
14 Correct 11 ms 6984 KB Output is correct
15 Correct 5 ms 6860 KB Output is correct
16 Correct 15 ms 7020 KB Output is correct
17 Correct 12 ms 6988 KB Output is correct
18 Correct 10 ms 6988 KB Output is correct
19 Correct 11 ms 6656 KB Output is correct
20 Correct 11 ms 6988 KB Output is correct
21 Correct 6 ms 6988 KB Output is correct
22 Correct 11 ms 7028 KB Output is correct
23 Correct 11 ms 6996 KB Output is correct
24 Correct 12 ms 7028 KB Output is correct
25 Correct 688 ms 314580 KB Output is correct
26 Correct 674 ms 314456 KB Output is correct
27 Correct 692 ms 314736 KB Output is correct
28 Correct 669 ms 314432 KB Output is correct
29 Correct 791 ms 317992 KB Output is correct
30 Correct 712 ms 315908 KB Output is correct
31 Correct 723 ms 320040 KB Output is correct
32 Correct 719 ms 313148 KB Output is correct
33 Correct 721 ms 316792 KB Output is correct
34 Correct 745 ms 315872 KB Output is correct
35 Correct 729 ms 320456 KB Output is correct
36 Correct 879 ms 317356 KB Output is correct
37 Correct 1028 ms 321152 KB Output is correct
38 Correct 902 ms 317676 KB Output is correct
39 Correct 860 ms 320624 KB Output is correct
40 Correct 859 ms 317996 KB Output is correct
41 Correct 869 ms 320816 KB Output is correct
42 Correct 914 ms 320904 KB Output is correct
43 Correct 929 ms 321176 KB Output is correct
44 Correct 1118 ms 319080 KB Output is correct
45 Correct 1118 ms 315432 KB Output is correct
46 Correct 1082 ms 314880 KB Output is correct
47 Correct 942 ms 314524 KB Output is correct
48 Correct 865 ms 314376 KB Output is correct
49 Correct 805 ms 314084 KB Output is correct
50 Correct 863 ms 319940 KB Output is correct
51 Correct 2 ms 1484 KB Output is correct
52 Correct 11 ms 7064 KB Output is correct
53 Correct 811 ms 319312 KB Output is correct
54 Correct 906 ms 325252 KB Output is correct
55 Correct 924 ms 314980 KB Output is correct
56 Correct 968 ms 321664 KB Output is correct
57 Correct 2 ms 1484 KB Output is correct
58 Correct 13 ms 6976 KB Output is correct
59 Correct 750 ms 313572 KB Output is correct
60 Correct 1080 ms 323112 KB Output is correct
61 Correct 943 ms 313780 KB Output is correct
62 Correct 908 ms 314068 KB Output is correct
63 Correct 1134 ms 314532 KB Output is correct
64 Correct 1255 ms 314044 KB Output is correct
65 Correct 1148 ms 313992 KB Output is correct
66 Correct 1022 ms 318768 KB Output is correct
67 Correct 995 ms 313892 KB Output is correct
68 Correct 878 ms 311212 KB Output is correct
69 Correct 894 ms 317188 KB Output is correct
70 Correct 1108 ms 313944 KB Output is correct
71 Correct 1031 ms 313904 KB Output is correct