oj.uz

Submission #674661

# Submission time Handle Problem Language Result Execution time Memory
674661 2022-12-25T16:49:11 Z Darren0724 Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
 2000 ms 269280 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
#define pii pair<int,int>
pii comb(pii a,pii b){
    return {min(a.first,b.first),max(a.second,b.second)};
}
struct seg{
    int l,m,r;
    int maxval=-INF,minval=INF;
    int maxlz=-INF,minlz=INF;
    seg *lc,*rc;
    int rmax(){
        return max(maxlz,maxval);
    }
    int rmin(){
        return min(minlz,minval);
    }
    void pull(){
        maxval=max(lc->rmax(),rc->rmax());
        minval=min(lc->rmin(),rc->rmin());
    }
    void push(){
        lc->maxlz=max(lc->maxlz,maxlz);
        rc->maxlz=max(rc->maxlz,maxlz);
        lc->minlz=min(lc->minlz,minlz);
        rc->minlz=min(rc->minlz,minlz);
        pull();
    }
    seg(int l1,int r1){
        l=l1,r=r1;
        m=(l+r)>>1;
        if(r-l==1){
            maxval=minval=maxlz=minlz=l1;
            return;
        }
        lc=new seg(l,m);
        rc=new seg(m,r);
        pull();
    }
    void add(int a,int b,int x){
        if(a<=l&&b>=r){
            maxlz=max(maxlz,x);
            minlz=min(minlz,x);
            return;
        }
        push();
        if(a<m){
            lc->add(a,b,x);
        }
        if(b>m){
            rc->add(a,b,x);
        }
        pull();
    }
    pii ask(int a,int b){
        if(a<=l&&b>=r){
            return {rmin(),rmax()};
        }
        pii ans={INF,-INF};
        push();
        if(a<m){
            ans=comb(ans,lc->ask(a,b));
        }
        if(b>m){
            ans=comb(ans,rc->ask(a,b));
        }
        pull();
        return ans;
    }
};
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,k;cin>>n>>k;
    vector<seg*> v(20);
    for(int i=0;i<20;i++){
        v[i]=new seg(0,n);
    }
    vector<vector<pii>> dp(20,vector<pii>(n));
    int m;cin>>m;
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;a--;b--;
        if(a<b){
            int c=min(a+k,b);
            v[0]->add(a,c,b);
        }
        else{
            int c=max(b+1,a-k+1);
            v[0]->add(c,a+1,b);
        }
    }
    for(int j=0;j<n;j++){
        dp[0][j]=v[0]->ask(j,j+1);
    }
    for(int i=1;i<20;i++){
        for(int j=0;j<n;j++){
            int a,b;tie(a,b)=dp[i-1][j];
            v[i]->add(j,j+1,a);
            v[i]->add(j,j+1,b);
        }
        for(int j=0;j<n;j++){
            int a,b;tie(a,b)=dp[i-1][j];
            dp[i][j]=v[i]->ask(a,b+1);
        }
    }
    int q;cin>>q;
    for(int i=0;i<q;i++){
        int a,b;cin>>a>>b;a--;b--;
        if(a<b){
            int ans=0;
            int l=a,r=a;
            bool flag=0;
            for(int j=19;j>=0;j--){
                if(v[j]->ask(l,r+1).second<b){
                    ans+=(1<<(j-1));
                    tie(l,r)=v[j]->ask(l,r+1);
                }
                else{
                    flag=1;
                }
            }
            if(flag==0){
                cout<<-1<<endl;
            }
            else{
                cout<<ans+1<<endl;
            }
        }
        else{
            int ans=0;
            int l=a,r=a;
            bool flag=0;
            for(int j=19;j>=0;j--){
                if(v[j]->ask(l,r+1).first>b){
                    ans+=(1<<(j-1));
                    tie(l,r)=v[j]->ask(l,r+1);
                }
                else{
                    flag=1;
                }
            }
            if(flag==0){
                cout<<-1<<endl;
            }
            else{
                cout<<ans+1<<endl;
            }
        }
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 3 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 4 ms 1084 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 1124 KB Output is correct
12 Correct 6 ms 1088 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 3 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 4 ms 1084 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 1124 KB Output is correct
12 Correct 6 ms 1088 KB Output is correct
13 Correct 44 ms 5680 KB Output is correct
14 Correct 39 ms 5684 KB Output is correct
15 Correct 25 ms 5652 KB Output is correct
16 Correct 30 ms 5588 KB Output is correct
17 Correct 43 ms 5684 KB Output is correct
18 Correct 32 ms 5632 KB Output is correct
19 Correct 33 ms 5424 KB Output is correct
20 Correct 26 ms 5696 KB Output is correct
21 Correct 17 ms 5588 KB Output is correct
22 Correct 39 ms 5588 KB Output is correct
23 Correct 37 ms 5588 KB Output is correct
24 Correct 46 ms 5580 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1851 ms 267340 KB Output is correct
2 Correct 1861 ms 267500 KB Output is correct
3 Correct 1822 ms 267568 KB Output is correct
4 Correct 1718 ms 267316 KB Output is correct
5 Correct 1338 ms 268928 KB Output is correct
6 Correct 1813 ms 268820 KB Output is correct
7 Correct 1265 ms 268616 KB Output is correct
8 Correct 1166 ms 265004 KB Output is correct
9 Correct 1216 ms 267664 KB Output is correct
10 Correct 1801 ms 268820 KB Output is correct
11 Correct 1630 ms 268820 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2089 ms 267904 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2097 ms 269280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 3 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 4 ms 1084 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 1124 KB Output is correct
12 Correct 6 ms 1088 KB Output is correct
13 Correct 44 ms 5680 KB Output is correct
14 Correct 39 ms 5684 KB Output is correct
15 Correct 25 ms 5652 KB Output is correct
16 Correct 30 ms 5588 KB Output is correct
17 Correct 43 ms 5684 KB Output is correct
18 Correct 32 ms 5632 KB Output is correct
19 Correct 33 ms 5424 KB Output is correct
20 Correct 26 ms 5696 KB Output is correct
21 Correct 17 ms 5588 KB Output is correct
22 Correct 39 ms 5588 KB Output is correct
23 Correct 37 ms 5588 KB Output is correct
24 Correct 46 ms 5580 KB Output is correct
25 Correct 1851 ms 267340 KB Output is correct
26 Correct 1861 ms 267500 KB Output is correct
27 Correct 1822 ms 267568 KB Output is correct
28 Correct 1718 ms 267316 KB Output is correct
29 Correct 1338 ms 268928 KB Output is correct
30 Correct 1813 ms 268820 KB Output is correct
31 Correct 1265 ms 268616 KB Output is correct
32 Correct 1166 ms 265004 KB Output is correct
33 Correct 1216 ms 267664 KB Output is correct
34 Correct 1801 ms 268820 KB Output is correct
35 Correct 1630 ms 268820 KB Output is correct
36 Execution timed out 2089 ms 267904 KB Time limit exceeded
37 Halted 0 ms 0 KB -