oj.uz

Submission #959660

# Submission time Handle Problem Language Result Execution time Memory
959660 2024-04-08T16:26:31 Z happy_node Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 1157 ms 64344 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);

        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 6 ms 17244 KB Output is correct
2 Correct 5 ms 17240 KB Output is correct
3 Correct 4 ms 17240 KB Output is correct
4 Correct 5 ms 17244 KB Output is correct
5 Correct 6 ms 17500 KB Output is correct
6 Correct 4 ms 17240 KB Output is correct
7 Correct 6 ms 17244 KB Output is correct
8 Correct 5 ms 17244 KB Output is correct
9 Correct 5 ms 17332 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 5 ms 17244 KB Output is correct
12 Correct 5 ms 17240 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17244 KB Output is correct
2 Correct 5 ms 17240 KB Output is correct
3 Correct 4 ms 17240 KB Output is correct
4 Correct 5 ms 17244 KB Output is correct
5 Correct 6 ms 17500 KB Output is correct
6 Correct 4 ms 17240 KB Output is correct
7 Correct 6 ms 17244 KB Output is correct
8 Correct 5 ms 17244 KB Output is correct
9 Correct 5 ms 17332 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 5 ms 17244 KB Output is correct
12 Correct 5 ms 17240 KB Output is correct
13 Correct 19 ms 17752 KB Output is correct
14 Correct 17 ms 15708 KB Output is correct
15 Correct 11 ms 13656 KB Output is correct
16 Correct 13 ms 13660 KB Output is correct
17 Correct 18 ms 13788 KB Output is correct
18 Correct 12 ms 13656 KB Output is correct
19 Correct 14 ms 13660 KB Output is correct
20 Correct 14 ms 13776 KB Output is correct
21 Correct 9 ms 13968 KB Output is correct
22 Correct 16 ms 13660 KB Output is correct
23 Correct 15 ms 13660 KB Output is correct
24 Correct 21 ms 13616 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 697 ms 59216 KB Output is correct
2 Correct 670 ms 58964 KB Output is correct
3 Correct 684 ms 59980 KB Output is correct
4 Correct 650 ms 58412 KB Output is correct
5 Correct 499 ms 61000 KB Output is correct
6 Correct 677 ms 60752 KB Output is correct
7 Correct 456 ms 63124 KB Output is correct
8 Correct 433 ms 58856 KB Output is correct
9 Correct 450 ms 59272 KB Output is correct
10 Correct 715 ms 59864 KB Output is correct
11 Correct 614 ms 59728 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 880 ms 60472 KB Output is correct
2 Correct 784 ms 61172 KB Output is correct
3 Correct 1063 ms 60600 KB Output is correct
4 Correct 624 ms 63144 KB Output is correct
5 Correct 707 ms 62528 KB Output is correct
6 Correct 691 ms 62308 KB Output is correct
7 Correct 958 ms 60000 KB Output is correct
8 Correct 882 ms 60320 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 899 ms 61920 KB Output is correct
2 Correct 1157 ms 60704 KB Output is correct
3 Correct 1085 ms 57412 KB Output is correct
4 Correct 1022 ms 55456 KB Output is correct
5 Correct 922 ms 54352 KB Output is correct
6 Correct 901 ms 54116 KB Output is correct
7 Correct 767 ms 62396 KB Output is correct
8 Correct 4 ms 13144 KB Output is correct
9 Correct 15 ms 13660 KB Output is correct
10 Correct 670 ms 62800 KB Output is correct
11 Correct 850 ms 64220 KB Output is correct
12 Correct 855 ms 62520 KB Output is correct
13 Correct 836 ms 64344 KB Output is correct
14 Correct 4 ms 13144 KB Output is correct
15 Incorrect 17 ms 13776 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 17244 KB Output is correct
2 Correct 5 ms 17240 KB Output is correct
3 Correct 4 ms 17240 KB Output is correct
4 Correct 5 ms 17244 KB Output is correct
5 Correct 6 ms 17500 KB Output is correct
6 Correct 4 ms 17240 KB Output is correct
7 Correct 6 ms 17244 KB Output is correct
8 Correct 5 ms 17244 KB Output is correct
9 Correct 5 ms 17332 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 5 ms 17244 KB Output is correct
12 Correct 5 ms 17240 KB Output is correct
13 Correct 19 ms 17752 KB Output is correct
14 Correct 17 ms 15708 KB Output is correct
15 Correct 11 ms 13656 KB Output is correct
16 Correct 13 ms 13660 KB Output is correct
17 Correct 18 ms 13788 KB Output is correct
18 Correct 12 ms 13656 KB Output is correct
19 Correct 14 ms 13660 KB Output is correct
20 Correct 14 ms 13776 KB Output is correct
21 Correct 9 ms 13968 KB Output is correct
22 Correct 16 ms 13660 KB Output is correct
23 Correct 15 ms 13660 KB Output is correct
24 Correct 21 ms 13616 KB Output is correct
25 Correct 697 ms 59216 KB Output is correct
26 Correct 670 ms 58964 KB Output is correct
27 Correct 684 ms 59980 KB Output is correct
28 Correct 650 ms 58412 KB Output is correct
29 Correct 499 ms 61000 KB Output is correct
30 Correct 677 ms 60752 KB Output is correct
31 Correct 456 ms 63124 KB Output is correct
32 Correct 433 ms 58856 KB Output is correct
33 Correct 450 ms 59272 KB Output is correct
34 Correct 715 ms 59864 KB Output is correct
35 Correct 614 ms 59728 KB Output is correct
36 Correct 880 ms 60472 KB Output is correct
37 Correct 784 ms 61172 KB Output is correct
38 Correct 1063 ms 60600 KB Output is correct
39 Correct 624 ms 63144 KB Output is correct
40 Correct 707 ms 62528 KB Output is correct
41 Correct 691 ms 62308 KB Output is correct
42 Correct 958 ms 60000 KB Output is correct
43 Correct 882 ms 60320 KB Output is correct
44 Correct 899 ms 61920 KB Output is correct
45 Correct 1157 ms 60704 KB Output is correct
46 Correct 1085 ms 57412 KB Output is correct
47 Correct 1022 ms 55456 KB Output is correct
48 Correct 922 ms 54352 KB Output is correct
49 Correct 901 ms 54116 KB Output is correct
50 Correct 767 ms 62396 KB Output is correct
51 Correct 4 ms 13144 KB Output is correct
52 Correct 15 ms 13660 KB Output is correct
53 Correct 670 ms 62800 KB Output is correct
54 Correct 850 ms 64220 KB Output is correct
55 Correct 855 ms 62520 KB Output is correct
56 Correct 836 ms 64344 KB Output is correct
57 Correct 4 ms 13144 KB Output is correct
58 Incorrect 17 ms 13776 KB Output isn't correct
59 Halted 0 ms 0 KB -