oj.uz

답안 #959659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959659 2024-04-08T16:25:28 Z happy_node Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 1106 ms 64668 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

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

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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 19584 KB Output is correct
2 Correct 9 ms 19292 KB Output is correct
3 Correct 5 ms 17244 KB Output is correct
4 Correct 4 ms 17244 KB Output is correct
5 Correct 6 ms 17240 KB Output is correct
6 Correct 4 ms 15192 KB Output is correct
7 Correct 5 ms 17244 KB Output is correct
8 Correct 4 ms 17084 KB Output is correct
9 Correct 4 ms 17244 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 4 ms 17244 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 19584 KB Output is correct
2 Correct 9 ms 19292 KB Output is correct
3 Correct 5 ms 17244 KB Output is correct
4 Correct 4 ms 17244 KB Output is correct
5 Correct 6 ms 17240 KB Output is correct
6 Correct 4 ms 15192 KB Output is correct
7 Correct 5 ms 17244 KB Output is correct
8 Correct 4 ms 17084 KB Output is correct
9 Correct 4 ms 17244 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 4 ms 17244 KB Output is correct
13 Correct 20 ms 17752 KB Output is correct
14 Correct 17 ms 17756 KB Output is correct
15 Correct 11 ms 17756 KB Output is correct
16 Correct 12 ms 17756 KB Output is correct
17 Correct 16 ms 17756 KB Output is correct
18 Correct 12 ms 17780 KB Output is correct
19 Correct 13 ms 15704 KB Output is correct
20 Correct 12 ms 13756 KB Output is correct
21 Correct 8 ms 13756 KB Output is correct
22 Correct 14 ms 13660 KB Output is correct
23 Correct 14 ms 13540 KB Output is correct
24 Correct 15 ms 13752 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 55736 KB Output is correct
2 Correct 630 ms 55616 KB Output is correct
3 Correct 674 ms 56908 KB Output is correct
4 Correct 616 ms 55208 KB Output is correct
5 Correct 452 ms 60056 KB Output is correct
6 Correct 629 ms 60472 KB Output is correct
7 Correct 420 ms 62856 KB Output is correct
8 Correct 417 ms 57804 KB Output is correct
9 Correct 410 ms 57972 KB Output is correct
10 Correct 610 ms 59700 KB Output is correct
11 Correct 597 ms 59692 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 779 ms 59764 KB Output is correct
2 Correct 763 ms 60620 KB Output is correct
3 Correct 953 ms 58004 KB Output is correct
4 Correct 621 ms 61680 KB Output is correct
5 Correct 603 ms 61072 KB Output is correct
6 Correct 597 ms 60824 KB Output is correct
7 Correct 862 ms 58380 KB Output is correct
8 Correct 793 ms 58592 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 852 ms 60408 KB Output is correct
2 Correct 1106 ms 57968 KB Output is correct
3 Correct 1054 ms 54264 KB Output is correct
4 Correct 966 ms 51852 KB Output is correct
5 Correct 852 ms 50724 KB Output is correct
6 Correct 833 ms 51476 KB Output is correct
7 Correct 698 ms 61676 KB Output is correct
8 Correct 5 ms 17244 KB Output is correct
9 Correct 14 ms 17752 KB Output is correct
10 Correct 598 ms 62548 KB Output is correct
11 Correct 747 ms 64668 KB Output is correct
12 Correct 780 ms 62852 KB Output is correct
13 Correct 770 ms 64668 KB Output is correct
14 Correct 5 ms 17240 KB Output is correct
15 Incorrect 18 ms 17756 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 19584 KB Output is correct
2 Correct 9 ms 19292 KB Output is correct
3 Correct 5 ms 17244 KB Output is correct
4 Correct 4 ms 17244 KB Output is correct
5 Correct 6 ms 17240 KB Output is correct
6 Correct 4 ms 15192 KB Output is correct
7 Correct 5 ms 17244 KB Output is correct
8 Correct 4 ms 17084 KB Output is correct
9 Correct 4 ms 17244 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 4 ms 17244 KB Output is correct
12 Correct 4 ms 17244 KB Output is correct
13 Correct 20 ms 17752 KB Output is correct
14 Correct 17 ms 17756 KB Output is correct
15 Correct 11 ms 17756 KB Output is correct
16 Correct 12 ms 17756 KB Output is correct
17 Correct 16 ms 17756 KB Output is correct
18 Correct 12 ms 17780 KB Output is correct
19 Correct 13 ms 15704 KB Output is correct
20 Correct 12 ms 13756 KB Output is correct
21 Correct 8 ms 13756 KB Output is correct
22 Correct 14 ms 13660 KB Output is correct
23 Correct 14 ms 13540 KB Output is correct
24 Correct 15 ms 13752 KB Output is correct
25 Correct 637 ms 55736 KB Output is correct
26 Correct 630 ms 55616 KB Output is correct
27 Correct 674 ms 56908 KB Output is correct
28 Correct 616 ms 55208 KB Output is correct
29 Correct 452 ms 60056 KB Output is correct
30 Correct 629 ms 60472 KB Output is correct
31 Correct 420 ms 62856 KB Output is correct
32 Correct 417 ms 57804 KB Output is correct
33 Correct 410 ms 57972 KB Output is correct
34 Correct 610 ms 59700 KB Output is correct
35 Correct 597 ms 59692 KB Output is correct
36 Correct 779 ms 59764 KB Output is correct
37 Correct 763 ms 60620 KB Output is correct
38 Correct 953 ms 58004 KB Output is correct
39 Correct 621 ms 61680 KB Output is correct
40 Correct 603 ms 61072 KB Output is correct
41 Correct 597 ms 60824 KB Output is correct
42 Correct 862 ms 58380 KB Output is correct
43 Correct 793 ms 58592 KB Output is correct
44 Correct 852 ms 60408 KB Output is correct
45 Correct 1106 ms 57968 KB Output is correct
46 Correct 1054 ms 54264 KB Output is correct
47 Correct 966 ms 51852 KB Output is correct
48 Correct 852 ms 50724 KB Output is correct
49 Correct 833 ms 51476 KB Output is correct
50 Correct 698 ms 61676 KB Output is correct
51 Correct 5 ms 17244 KB Output is correct
52 Correct 14 ms 17752 KB Output is correct
53 Correct 598 ms 62548 KB Output is correct
54 Correct 747 ms 64668 KB Output is correct
55 Correct 780 ms 62852 KB Output is correct
56 Correct 770 ms 64668 KB Output is correct
57 Correct 5 ms 17240 KB Output is correct
58 Incorrect 18 ms 17756 KB Output isn't correct
59 Halted 0 ms 0 KB -