oj.uz

답안 #959662

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

const int MX=1e5+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.erase(st.find(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.erase(st.find(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 18 ms 43608 KB Output is correct
2 Correct 7 ms 43612 KB Output is correct
3 Correct 9 ms 43612 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 9 ms 43700 KB Output is correct
6 Correct 11 ms 43608 KB Output is correct
7 Correct 8 ms 43612 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct
9 Correct 7 ms 43612 KB Output is correct
10 Correct 6 ms 43612 KB Output is correct
11 Correct 7 ms 43640 KB Output is correct
12 Correct 8 ms 43700 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 43608 KB Output is correct
2 Correct 7 ms 43612 KB Output is correct
3 Correct 9 ms 43612 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 9 ms 43700 KB Output is correct
6 Correct 11 ms 43608 KB Output is correct
7 Correct 8 ms 43612 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct
9 Correct 7 ms 43612 KB Output is correct
10 Correct 6 ms 43612 KB Output is correct
11 Correct 7 ms 43640 KB Output is correct
12 Correct 8 ms 43700 KB Output is correct
13 Correct 19 ms 46156 KB Output is correct
14 Correct 19 ms 45916 KB Output is correct
15 Correct 15 ms 45876 KB Output is correct
16 Correct 16 ms 45916 KB Output is correct
17 Correct 19 ms 45828 KB Output is correct
18 Correct 15 ms 45912 KB Output is correct
19 Correct 17 ms 45916 KB Output is correct
20 Correct 15 ms 45912 KB Output is correct
21 Correct 12 ms 45916 KB Output is correct
22 Correct 18 ms 45868 KB Output is correct
23 Correct 17 ms 45660 KB Output is correct
24 Correct 19 ms 46112 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 607 ms 69220 KB Output is correct
2 Correct 605 ms 68756 KB Output is correct
3 Correct 624 ms 70384 KB Output is correct
4 Correct 580 ms 68468 KB Output is correct
5 Correct 456 ms 73420 KB Output is correct
6 Correct 569 ms 71832 KB Output is correct
7 Correct 406 ms 73160 KB Output is correct
8 Correct 400 ms 69228 KB Output is correct
9 Correct 396 ms 69332 KB Output is correct
10 Correct 611 ms 70740 KB Output is correct
11 Correct 508 ms 72984 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 745 ms 70904 KB Output is correct
2 Incorrect 695 ms 74828 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 738 ms 75084 KB Output is correct
2 Correct 1025 ms 71272 KB Output is correct
3 Correct 966 ms 67652 KB Output is correct
4 Correct 931 ms 65100 KB Output is correct
5 Correct 798 ms 64028 KB Output is correct
6 Correct 805 ms 63524 KB Output is correct
7 Correct 666 ms 73152 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct
9 Correct 18 ms 45672 KB Output is correct
10 Correct 638 ms 76880 KB Output is correct
11 Correct 722 ms 77200 KB Output is correct
12 Correct 763 ms 77300 KB Output is correct
13 Correct 747 ms 77024 KB Output is correct
14 Correct 7 ms 43612 KB Output is correct
15 Correct 19 ms 45812 KB Output is correct
16 Correct 655 ms 71332 KB Output is correct
17 Correct 953 ms 74864 KB Output is correct
18 Correct 914 ms 72396 KB Output is correct
19 Correct 920 ms 72500 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 43608 KB Output is correct
2 Correct 7 ms 43612 KB Output is correct
3 Correct 9 ms 43612 KB Output is correct
4 Correct 7 ms 43612 KB Output is correct
5 Correct 9 ms 43700 KB Output is correct
6 Correct 11 ms 43608 KB Output is correct
7 Correct 8 ms 43612 KB Output is correct
8 Correct 7 ms 43612 KB Output is correct
9 Correct 7 ms 43612 KB Output is correct
10 Correct 6 ms 43612 KB Output is correct
11 Correct 7 ms 43640 KB Output is correct
12 Correct 8 ms 43700 KB Output is correct
13 Correct 19 ms 46156 KB Output is correct
14 Correct 19 ms 45916 KB Output is correct
15 Correct 15 ms 45876 KB Output is correct
16 Correct 16 ms 45916 KB Output is correct
17 Correct 19 ms 45828 KB Output is correct
18 Correct 15 ms 45912 KB Output is correct
19 Correct 17 ms 45916 KB Output is correct
20 Correct 15 ms 45912 KB Output is correct
21 Correct 12 ms 45916 KB Output is correct
22 Correct 18 ms 45868 KB Output is correct
23 Correct 17 ms 45660 KB Output is correct
24 Correct 19 ms 46112 KB Output is correct
25 Correct 607 ms 69220 KB Output is correct
26 Correct 605 ms 68756 KB Output is correct
27 Correct 624 ms 70384 KB Output is correct
28 Correct 580 ms 68468 KB Output is correct
29 Correct 456 ms 73420 KB Output is correct
30 Correct 569 ms 71832 KB Output is correct
31 Correct 406 ms 73160 KB Output is correct
32 Correct 400 ms 69228 KB Output is correct
33 Correct 396 ms 69332 KB Output is correct
34 Correct 611 ms 70740 KB Output is correct
35 Correct 508 ms 72984 KB Output is correct
36 Correct 745 ms 70904 KB Output is correct
37 Incorrect 695 ms 74828 KB Output isn't correct
38 Halted 0 ms 0 KB -