oj.uz

Submission #959661

# Submission time Handle Problem Language Result Execution time Memory
959661 2024-04-08T16:28:20 Z happy_node Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 1147 ms 147468 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX=2e5+5, MK=20;

int N,K,M,Q;

int L[MX],R[MX], A[MX], B[MX];

struct segtree {
        pair<int,int> t[4 * MX];
        // I define t[v] to be the range within reach from v by using 2^k steps

        pair<int,int> merge(pair<int,int> a, pair<int, int> b) {
                int l=min(a.first,b.first);
                int r=max(a.second,b.second);
                return make_pair(l,r);
        }
 
        void update(int v, int l, int r, int pos, pair<int,int> val) {
                if(l > pos || r < pos) return;
                if(l == r) {
                        t[v] = val;
                        return;
                }
                int mid = (l + r) >> 1;
                update(v * 2 + 0, l, mid + 0, pos, val);
                update(v * 2 + 1, mid + 1, r, pos, val);
                t[v] = merge(t[v * 2 + 0], t[v * 2 + 1]);
        }
 
        pair<int,int> query(int v, int l, int r, int ql, int qr) {
                if(ql > r || qr < l) return make_pair(1e9,0);
                if(ql <= l && qr >= r) return t[v];
                int mid = (l + r) >> 1;
                return merge(query(v * 2 + 0, l, mid + 0, ql, qr), query(v * 2 + 1, mid + 1, r, ql, qr));
        }

        void reset() {
                for(int i=0;i<4*MX;i++)
                        t[i]=make_pair(1e9,0);
        }
} ST[MK];

vector<int> opens[MX], closes[MX];

int main() {
        cin.tie(0); ios_base::sync_with_stdio(0);

        for(int i=0;i<MK;i++) 
                ST[i].reset();

        cin>>N>>K>>M;
        for(int i=1;i<=M;i++) {
                cin>>A[i]>>B[i];
                if(A[i]<B[i]) {
                        opens[A[i]].push_back(B[i]);
                        closes[min(A[i]+K-1,B[i]-1)].push_back(B[i]);
                } 
        }

        multiset<int> st;
        for(int i=1;i<=N;i++) {
                for(auto j:opens[i]) {
                        st.insert(j);
                }
                if(st.size())
                        R[i]=*st.rbegin();
                else
                        R[i]=i;
                for(auto j:closes[i]) {
                        st.find(st.erase(j));
                }
        }

        for(int i=1;i<=N;i++) {
                opens[i].clear();
                closes[i].clear();
        }

        for(int i=1;i<=M;i++) {
                if(A[i]>B[i]) {
                        opens[A[i]].push_back(B[i]);
                        closes[max(A[i]-K+1,B[i]+1)].push_back(B[i]);
                }
        }

        st.clear();
        for(int i=N;i>=1;i--) {
                for(auto j:opens[i]) {
                        st.insert(j);
                }       
                if(st.size())
                        L[i]=*st.begin();
                else
                        L[i]=i;
                for(auto j:closes[i]) {
                        st.find(st.erase(j));
                }
        }

        for(int i=1;i<=N;i++) {
                ST[0].update(1,1,N,i,make_pair(L[i],R[i]));
        }

        for(int k=1;k<MK;k++) {
                for(int i=1;i<=N;i++) {
                        auto [l,r]=ST[k-1].query(1,1,N,i,i);
                        auto [nxtL,nxtR]=ST[k-1].query(1,1,N,l,r);
                        ST[k].update(1,1,N,i,make_pair(nxtL,nxtR));
                }
        }

        cin>>Q;
        for(int i=1;i<=Q;i++) {
                int s,t;
                cin>>s>>t;

                int curL=s,curR=s,ans=0;
                for(int k=MK-1;k>=0;k--) {
                        int nxtL=ST[k].query(1,1,N,curL,curR).first;
                        int nxtR=ST[k].query(1,1,N,curL,curR).second;

                        if(!(nxtL<=t&&t<=nxtR)) {
                                ans+=1<<k;
                                curL=nxtL;
                                curR=nxtR;
                        }
                }

                auto [nxtL,nxtR]=ST[0].query(1,1,N,curL,curR);

                if(nxtL<=t&&t<=nxtR) {
                        cout<<ans+1<<'\n';
                } else {
                        cout<<-1<<'\n';
                }
        }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 135076 KB Output is correct
2 Correct 56 ms 135092 KB Output is correct
3 Correct 54 ms 134996 KB Output is correct
4 Correct 54 ms 134920 KB Output is correct
5 Correct 54 ms 134932 KB Output is correct
6 Correct 53 ms 134992 KB Output is correct
7 Correct 54 ms 135072 KB Output is correct
8 Correct 57 ms 134992 KB Output is correct
9 Correct 56 ms 135004 KB Output is correct
10 Correct 51 ms 134892 KB Output is correct
11 Correct 53 ms 135100 KB Output is correct
12 Correct 54 ms 134992 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 135076 KB Output is correct
2 Correct 56 ms 135092 KB Output is correct
3 Correct 54 ms 134996 KB Output is correct
4 Correct 54 ms 134920 KB Output is correct
5 Correct 54 ms 134932 KB Output is correct
6 Correct 53 ms 134992 KB Output is correct
7 Correct 54 ms 135072 KB Output is correct
8 Correct 57 ms 134992 KB Output is correct
9 Correct 56 ms 135004 KB Output is correct
10 Correct 51 ms 134892 KB Output is correct
11 Correct 53 ms 135100 KB Output is correct
12 Correct 54 ms 134992 KB Output is correct
13 Correct 65 ms 134992 KB Output is correct
14 Correct 70 ms 135304 KB Output is correct
15 Correct 61 ms 135072 KB Output is correct
16 Correct 64 ms 135108 KB Output is correct
17 Correct 67 ms 134992 KB Output is correct
18 Correct 62 ms 135244 KB Output is correct
19 Correct 63 ms 134996 KB Output is correct
20 Correct 61 ms 135004 KB Output is correct
21 Correct 63 ms 135248 KB Output is correct
22 Correct 63 ms 135140 KB Output is correct
23 Correct 66 ms 134996 KB Output is correct
24 Correct 66 ms 134996 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 716 ms 141612 KB Output is correct
2 Correct 683 ms 141476 KB Output is correct
3 Correct 719 ms 142420 KB Output is correct
4 Correct 668 ms 141112 KB Output is correct
5 Correct 515 ms 143956 KB Output is correct
6 Correct 715 ms 143700 KB Output is correct
7 Correct 495 ms 146120 KB Output is correct
8 Correct 490 ms 141664 KB Output is correct
9 Correct 483 ms 141924 KB Output is correct
10 Correct 658 ms 142808 KB Output is correct
11 Correct 689 ms 142908 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 880 ms 143156 KB Output is correct
2 Correct 807 ms 144372 KB Output is correct
3 Correct 1067 ms 143200 KB Output is correct
4 Correct 671 ms 146448 KB Output is correct
5 Correct 691 ms 145200 KB Output is correct
6 Correct 672 ms 145332 KB Output is correct
7 Correct 919 ms 143200 KB Output is correct
8 Correct 905 ms 142888 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 952 ms 145120 KB Output is correct
2 Correct 1147 ms 143272 KB Output is correct
3 Correct 1087 ms 139660 KB Output is correct
4 Correct 1042 ms 137556 KB Output is correct
5 Correct 939 ms 136372 KB Output is correct
6 Correct 920 ms 136272 KB Output is correct
7 Correct 776 ms 144844 KB Output is correct
8 Correct 53 ms 134992 KB Output is correct
9 Correct 66 ms 135252 KB Output is correct
10 Correct 714 ms 145800 KB Output is correct
11 Correct 859 ms 147264 KB Output is correct
12 Correct 881 ms 145376 KB Output is correct
13 Correct 875 ms 147468 KB Output is correct
14 Correct 53 ms 134992 KB Output is correct
15 Incorrect 67 ms 135160 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 135076 KB Output is correct
2 Correct 56 ms 135092 KB Output is correct
3 Correct 54 ms 134996 KB Output is correct
4 Correct 54 ms 134920 KB Output is correct
5 Correct 54 ms 134932 KB Output is correct
6 Correct 53 ms 134992 KB Output is correct
7 Correct 54 ms 135072 KB Output is correct
8 Correct 57 ms 134992 KB Output is correct
9 Correct 56 ms 135004 KB Output is correct
10 Correct 51 ms 134892 KB Output is correct
11 Correct 53 ms 135100 KB Output is correct
12 Correct 54 ms 134992 KB Output is correct
13 Correct 65 ms 134992 KB Output is correct
14 Correct 70 ms 135304 KB Output is correct
15 Correct 61 ms 135072 KB Output is correct
16 Correct 64 ms 135108 KB Output is correct
17 Correct 67 ms 134992 KB Output is correct
18 Correct 62 ms 135244 KB Output is correct
19 Correct 63 ms 134996 KB Output is correct
20 Correct 61 ms 135004 KB Output is correct
21 Correct 63 ms 135248 KB Output is correct
22 Correct 63 ms 135140 KB Output is correct
23 Correct 66 ms 134996 KB Output is correct
24 Correct 66 ms 134996 KB Output is correct
25 Correct 716 ms 141612 KB Output is correct
26 Correct 683 ms 141476 KB Output is correct
27 Correct 719 ms 142420 KB Output is correct
28 Correct 668 ms 141112 KB Output is correct
29 Correct 515 ms 143956 KB Output is correct
30 Correct 715 ms 143700 KB Output is correct
31 Correct 495 ms 146120 KB Output is correct
32 Correct 490 ms 141664 KB Output is correct
33 Correct 483 ms 141924 KB Output is correct
34 Correct 658 ms 142808 KB Output is correct
35 Correct 689 ms 142908 KB Output is correct
36 Correct 880 ms 143156 KB Output is correct
37 Correct 807 ms 144372 KB Output is correct
38 Correct 1067 ms 143200 KB Output is correct
39 Correct 671 ms 146448 KB Output is correct
40 Correct 691 ms 145200 KB Output is correct
41 Correct 672 ms 145332 KB Output is correct
42 Correct 919 ms 143200 KB Output is correct
43 Correct 905 ms 142888 KB Output is correct
44 Correct 952 ms 145120 KB Output is correct
45 Correct 1147 ms 143272 KB Output is correct
46 Correct 1087 ms 139660 KB Output is correct
47 Correct 1042 ms 137556 KB Output is correct
48 Correct 939 ms 136372 KB Output is correct
49 Correct 920 ms 136272 KB Output is correct
50 Correct 776 ms 144844 KB Output is correct
51 Correct 53 ms 134992 KB Output is correct
52 Correct 66 ms 135252 KB Output is correct
53 Correct 714 ms 145800 KB Output is correct
54 Correct 859 ms 147264 KB Output is correct
55 Correct 881 ms 145376 KB Output is correct
56 Correct 875 ms 147468 KB Output is correct
57 Correct 53 ms 134992 KB Output is correct
58 Incorrect 67 ms 135160 KB Output isn't correct
59 Halted 0 ms 0 KB -