oj.uz

Submission #675636

# Submission time Handle Problem Language Result Execution time Memory
675636 2022-12-27T14:10:43 Z Darren0724 Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 2000 ms 215360 KB 
#pragma GCC optimize("O3","unroll-loops","Ofast")
#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;
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){
            pii p=lc->ask(a,b);
            if(p.first<ans.first)ans.first=p.first;
            if(p.second>ans.second)ans.second=p.second;
        }
        if(b>m){
            pii p=rc->ask(a,b);
            if(p.first<ans.first)ans.first=p.first;
            if(p.second>ans.second)ans.second=p.second;
        }
        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<pii> dp0(n),dp1(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++){
        dp0[j]=v[0]->ask(j,j+1);
    }
    for(int i=1;i<17;i++){
        if(i&1){
            for(int j=0;j<n;j++){
                v[i]->add(j,j+1,dp0[j].first);
                v[i]->add(j,j+1,dp0[j].second);
            }
            for(int j=0;j<n;j++){
                int a,b;tie(a,b)=dp0[j];
                dp1[j]=v[i]->ask(a,b+1);
            }
        }
        else{
            for(int j=0;j<n;j++){
                v[i]->add(j,j+1,dp1[j].first);
                v[i]->add(j,j+1,dp1[j].second);
            }
            for(int j=0;j<n;j++){
                int a,b;tie(a,b)=dp1[j];
                dp0[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 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 852 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 21 ms 4608 KB Output is correct
14 Correct 19 ms 4564 KB Output is correct
15 Correct 13 ms 4564 KB Output is correct
16 Correct 14 ms 4616 KB Output is correct
17 Correct 20 ms 4564 KB Output is correct
18 Correct 14 ms 4608 KB Output is correct
19 Correct 18 ms 4308 KB Output is correct
20 Correct 17 ms 4596 KB Output is correct
21 Correct 10 ms 4612 KB Output is correct
22 Correct 18 ms 4564 KB Output is correct
23 Correct 19 ms 4616 KB Output is correct
24 Correct 20 ms 4600 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1028 ms 214872 KB Output is correct
2 Correct 1014 ms 214908 KB Output is correct
3 Correct 1072 ms 214800 KB Output is correct
4 Correct 989 ms 214800 KB Output is correct
5 Correct 777 ms 214916 KB Output is correct
6 Correct 1024 ms 214884 KB Output is correct
7 Correct 721 ms 214860 KB Output is correct
8 Correct 681 ms 212544 KB Output is correct
9 Correct 697 ms 214704 KB Output is correct
10 Correct 1156 ms 214864 KB Output is correct
11 Correct 1029 ms 214796 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1838 ms 214956 KB Output is correct
2 Correct 1410 ms 214928 KB Output is correct
3 Correct 1800 ms 215096 KB Output is correct
4 Correct 1107 ms 214888 KB Output is correct
5 Correct 1105 ms 212716 KB Output is correct
6 Correct 1111 ms 214896 KB Output is correct
7 Correct 1655 ms 215192 KB Output is correct
8 Correct 1596 ms 214996 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1899 ms 214876 KB Output is correct
2 Execution timed out 2084 ms 215360 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 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 21 ms 4608 KB Output is correct
14 Correct 19 ms 4564 KB Output is correct
15 Correct 13 ms 4564 KB Output is correct
16 Correct 14 ms 4616 KB Output is correct
17 Correct 20 ms 4564 KB Output is correct
18 Correct 14 ms 4608 KB Output is correct
19 Correct 18 ms 4308 KB Output is correct
20 Correct 17 ms 4596 KB Output is correct
21 Correct 10 ms 4612 KB Output is correct
22 Correct 18 ms 4564 KB Output is correct
23 Correct 19 ms 4616 KB Output is correct
24 Correct 20 ms 4600 KB Output is correct
25 Correct 1028 ms 214872 KB Output is correct
26 Correct 1014 ms 214908 KB Output is correct
27 Correct 1072 ms 214800 KB Output is correct
28 Correct 989 ms 214800 KB Output is correct
29 Correct 777 ms 214916 KB Output is correct
30 Correct 1024 ms 214884 KB Output is correct
31 Correct 721 ms 214860 KB Output is correct
32 Correct 681 ms 212544 KB Output is correct
33 Correct 697 ms 214704 KB Output is correct
34 Correct 1156 ms 214864 KB Output is correct
35 Correct 1029 ms 214796 KB Output is correct
36 Correct 1838 ms 214956 KB Output is correct
37 Correct 1410 ms 214928 KB Output is correct
38 Correct 1800 ms 215096 KB Output is correct
39 Correct 1107 ms 214888 KB Output is correct
40 Correct 1105 ms 212716 KB Output is correct
41 Correct 1111 ms 214896 KB Output is correct
42 Correct 1655 ms 215192 KB Output is correct
43 Correct 1596 ms 214996 KB Output is correct
44 Correct 1899 ms 214876 KB Output is correct
45 Execution timed out 2084 ms 215360 KB Time limit exceeded
46 Halted 0 ms 0 KB -