oj.uz

Submission #675569

# Submission time Handle Problem Language Result Execution time Memory
675569 2022-12-27T13:17:28 Z Darren0724 Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 2000 ms 227404 KB 
#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
#define pii pair<int,int>
#define endl '\n'
vector<pii> tmp;
inline 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);
    }
    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(17);
    for(int i=0;i<17;i++){
        v[i]=new seg(0,n);
    }
    vector<vector<pii>> dp(17,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<17;i++){
        for(int j=0;j<n;j++){
            v[i]->add(j,j+1,dp[i-1][j].first);
            v[i]->add(j,j+1,dp[i-1][j].second);
        }
        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=16;j>=0;j--){
                int c,d;
                tie(c,d)=v[j]->ask(l,r+1);
                if(d<b){
                    ans+=(1<<(j-1));
                    l=c,r=d;
                }
                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=16;j>=0;j--){
                int c,d;
                tie(c,d)=v[j]->ask(l,r+1);
                if(c>b){
                    ans+=(1<<(j-1));
                    l=c,r=d;
                }
                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 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 980 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 980 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 22 ms 4820 KB Output is correct
14 Correct 22 ms 4820 KB Output is correct
15 Correct 17 ms 4820 KB Output is correct
16 Correct 15 ms 4820 KB Output is correct
17 Correct 25 ms 4848 KB Output is correct
18 Correct 17 ms 4820 KB Output is correct
19 Correct 18 ms 4632 KB Output is correct
20 Correct 14 ms 4820 KB Output is correct
21 Correct 10 ms 4820 KB Output is correct
22 Correct 19 ms 4820 KB Output is correct
23 Correct 21 ms 4868 KB Output is correct
24 Correct 20 ms 4820 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1053 ms 227280 KB Output is correct
2 Correct 1016 ms 227276 KB Output is correct
3 Correct 1113 ms 227292 KB Output is correct
4 Correct 1008 ms 227300 KB Output is correct
5 Correct 782 ms 227308 KB Output is correct
6 Correct 1048 ms 227276 KB Output is correct
7 Correct 734 ms 227352 KB Output is correct
8 Correct 683 ms 224968 KB Output is correct
9 Correct 686 ms 227292 KB Output is correct
10 Correct 1031 ms 227276 KB Output is correct
11 Correct 985 ms 227276 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1585 ms 227276 KB Output is correct
2 Correct 1187 ms 227284 KB Output is correct
3 Correct 1725 ms 227404 KB Output is correct
4 Correct 1068 ms 227292 KB Output is correct
5 Correct 1014 ms 225044 KB Output is correct
6 Correct 956 ms 227312 KB Output is correct
7 Correct 1583 ms 227276 KB Output is correct
8 Correct 1562 ms 227332 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1647 ms 227308 KB Output is correct
2 Execution timed out 2045 ms 227276 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 980 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 22 ms 4820 KB Output is correct
14 Correct 22 ms 4820 KB Output is correct
15 Correct 17 ms 4820 KB Output is correct
16 Correct 15 ms 4820 KB Output is correct
17 Correct 25 ms 4848 KB Output is correct
18 Correct 17 ms 4820 KB Output is correct
19 Correct 18 ms 4632 KB Output is correct
20 Correct 14 ms 4820 KB Output is correct
21 Correct 10 ms 4820 KB Output is correct
22 Correct 19 ms 4820 KB Output is correct
23 Correct 21 ms 4868 KB Output is correct
24 Correct 20 ms 4820 KB Output is correct
25 Correct 1053 ms 227280 KB Output is correct
26 Correct 1016 ms 227276 KB Output is correct
27 Correct 1113 ms 227292 KB Output is correct
28 Correct 1008 ms 227300 KB Output is correct
29 Correct 782 ms 227308 KB Output is correct
30 Correct 1048 ms 227276 KB Output is correct
31 Correct 734 ms 227352 KB Output is correct
32 Correct 683 ms 224968 KB Output is correct
33 Correct 686 ms 227292 KB Output is correct
34 Correct 1031 ms 227276 KB Output is correct
35 Correct 985 ms 227276 KB Output is correct
36 Correct 1585 ms 227276 KB Output is correct
37 Correct 1187 ms 227284 KB Output is correct
38 Correct 1725 ms 227404 KB Output is correct
39 Correct 1068 ms 227292 KB Output is correct
40 Correct 1014 ms 225044 KB Output is correct
41 Correct 956 ms 227312 KB Output is correct
42 Correct 1583 ms 227276 KB Output is correct
43 Correct 1562 ms 227332 KB Output is correct
44 Correct 1647 ms 227308 KB Output is correct
45 Execution timed out 2045 ms 227276 KB Time limit exceeded
46 Halted 0 ms 0 KB -