oj.uz

답안 #834150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834150 2023-08-22T11:16:31 Z mosiashvililuka Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 685 ms 104596 KB 
#include<bits/stdc++.h>
using namespace std;
int zl,zr;
int MDE;
int a,b,c,d,e,i,j,ii,zx,xc,K,tes,t,segMN[18][400009],segMN2[18][400009],segMX[18][400009],segMX2[18][400009],l,r,za,lf[18][400009],rg[18][400009],L,R,pas,ANS;
int JJ;
void read(int q, int w, int rr){
    if(q>r||w<l) return;
    if(q>=l&&w<=r){
        zr=max(zr,segMX[JJ][rr]);
        zl=min(zl,segMN[JJ][rr]);
        return;
    }
    read(q,((q+w)>>1),rr*2);
    read(((q+w)>>1)+1,w,rr*2+1);
}
void UPD(int q, int zl, int zr){
    q=za+q-1;
    segMN[JJ][q]=zl;segMX[JJ][q]=zr;
    q/=2;
    while(q){
        segMX[JJ][q]=max(segMX[JJ][q*2],segMX[JJ][q*2+1]);
        segMN[JJ][q]=min(segMN[JJ][q*2],segMN[JJ][q*2+1]);
        q>>=1;
    }
}
vector <int> MN[100009],MX[100009];
multiset <int> sMN,sMX;
multiset <int>::iterator it;
int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>a>>K;
    cin>>b;
    za=1;
    while(za<a) za*=2;
    for(j=0; j<=17; j++){
        for(i=0; i<=za*2; i++){
            segMN[j][i]=a+2;
            segMX[j][i]=0;
            segMN2[j][i]=a+2;
            segMX2[j][i]=0;
        }
    }
    for(ii=1; ii<=b; ii++){
        cin>>c>>d;
        if(c<=d){
            l=c;r=min(d,c+K-1);JJ=0;
            zr=d;zl=a+2;
            MX[l].push_back(zr);
            MX[r+1].push_back(-zr);
        }else{
            swap(c,d);
            l=max(d-K+1,c);r=d;JJ=0;
            zl=c;zr=0;
            MN[l].push_back(zl);
            MN[r+1].push_back(-zl);
        }
    }

    for(i=1; i<=a; i++){
        for(auto x:MN[i]){
            if(x>=0){
                sMN.insert(x);
            }else{
                sMN.erase(sMN.find(-x));
            }

        }

        for(auto x:MX[i]){
            if(x>=0){
                sMX.insert(x);
            }else{
                sMX.erase(sMX.find(-x));
            }

        }

        lf[0][i]=rg[0][i]=i;
        if(sMN.size()){
            it=sMN.begin();
            lf[0][i]=(*it);
        }
        if(sMX.size()){
            it=sMX.end();
            it--;
            rg[0][i]=(*it);
        }
    }

    for(i=1; i<=a; i++){
        JJ=0;
        l=i;r=i;
        zl=lf[0][i];zr=rg[0][i];
        UPD(i,zl,zr);
    }


    for(j=0; j<16; j++){
        for(i=1; i<=a; i++){
            l=lf[j][i];r=rg[j][i];JJ=j;
            zl=a+2;zr=0;
            read(1,za,1);
            c=min(zl,lf[j][i]);
            d=max(zr,rg[j][i]);

            lf[j+1][i]=c;rg[j+1][i]=d;
            if(c>=lf[j][i]&&d<=rg[j][i]){
                ;
            }else{
                MDE=max(MDE,j+1);
            }

            l=i;r=i;JJ=j+1;
            zr=d;zl=c;
            UPD(i,zl,zr);
        }
    }


    cin>>tes;
    for(t=1; t<=tes; t++){
        cin>>c>>d;
        L=c;R=c;
        ANS=b+1;pas=0;
        for(j=MDE; j>=0; j--){
            zx=L;xc=R;
            l=L;r=R;JJ=j;
            zr=0;zl=a+2;
            read(1,za,1);
            xc=max(xc,zr);
            zx=min(zx,zl);

            if(zx<=d&&d<=xc){
                ANS=min(ANS,pas+(1<<j));
            }else{
                pas+=(1<<j);
                L=min(L,zx);
                R=max(R,xc);
            }
        }
        if(ANS==b+1) cout<<"-1\n"; else cout<<ANS<<"\n";
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6100 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 3 ms 6076 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 3 ms 6100 KB Output is correct
8 Correct 3 ms 6100 KB Output is correct
9 Correct 3 ms 6100 KB Output is correct
10 Correct 2 ms 5716 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6100 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 3 ms 6076 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 3 ms 6100 KB Output is correct
8 Correct 3 ms 6100 KB Output is correct
9 Correct 3 ms 6100 KB Output is correct
10 Correct 2 ms 5716 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct
13 Correct 10 ms 7252 KB Output is correct
14 Correct 10 ms 7252 KB Output is correct
15 Correct 8 ms 7124 KB Output is correct
16 Correct 7 ms 7208 KB Output is correct
17 Correct 10 ms 7316 KB Output is correct
18 Correct 6 ms 7252 KB Output is correct
19 Correct 8 ms 7216 KB Output is correct
20 Correct 6 ms 7252 KB Output is correct
21 Correct 6 ms 7252 KB Output is correct
22 Correct 8 ms 7300 KB Output is correct
23 Correct 8 ms 7256 KB Output is correct
24 Correct 9 ms 7252 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 408 ms 95616 KB Output is correct
2 Correct 385 ms 95596 KB Output is correct
3 Correct 427 ms 95892 KB Output is correct
4 Correct 371 ms 95596 KB Output is correct
5 Correct 372 ms 100796 KB Output is correct
6 Correct 406 ms 98968 KB Output is correct
7 Correct 280 ms 104508 KB Output is correct
8 Correct 287 ms 98588 KB Output is correct
9 Correct 263 ms 99036 KB Output is correct
10 Correct 403 ms 98416 KB Output is correct
11 Correct 381 ms 98380 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 446 ms 100328 KB Output is correct
2 Correct 439 ms 100732 KB Output is correct
3 Correct 646 ms 99292 KB Output is correct
4 Correct 301 ms 104596 KB Output is correct
5 Correct 359 ms 102904 KB Output is correct
6 Correct 349 ms 103104 KB Output is correct
7 Correct 489 ms 98484 KB Output is correct
8 Correct 492 ms 98520 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 487 ms 99420 KB Output is correct
2 Correct 664 ms 96268 KB Output is correct
3 Correct 592 ms 94620 KB Output is correct
4 Correct 590 ms 93764 KB Output is correct
5 Correct 438 ms 93296 KB Output is correct
6 Correct 493 ms 92984 KB Output is correct
7 Correct 420 ms 101016 KB Output is correct
8 Correct 3 ms 6100 KB Output is correct
9 Correct 8 ms 7252 KB Output is correct
10 Correct 492 ms 100176 KB Output is correct
11 Correct 474 ms 101704 KB Output is correct
12 Correct 497 ms 99696 KB Output is correct
13 Correct 500 ms 101724 KB Output is correct
14 Correct 3 ms 6100 KB Output is correct
15 Correct 10 ms 7252 KB Output is correct
16 Correct 453 ms 96904 KB Output is correct
17 Correct 602 ms 97108 KB Output is correct
18 Correct 598 ms 97224 KB Output is correct
19 Correct 575 ms 97172 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6100 KB Output is correct
2 Correct 3 ms 6100 KB Output is correct
3 Correct 3 ms 6100 KB Output is correct
4 Correct 4 ms 6100 KB Output is correct
5 Correct 3 ms 6076 KB Output is correct
6 Correct 3 ms 6100 KB Output is correct
7 Correct 3 ms 6100 KB Output is correct
8 Correct 3 ms 6100 KB Output is correct
9 Correct 3 ms 6100 KB Output is correct
10 Correct 2 ms 5716 KB Output is correct
11 Correct 3 ms 6100 KB Output is correct
12 Correct 3 ms 6100 KB Output is correct
13 Correct 10 ms 7252 KB Output is correct
14 Correct 10 ms 7252 KB Output is correct
15 Correct 8 ms 7124 KB Output is correct
16 Correct 7 ms 7208 KB Output is correct
17 Correct 10 ms 7316 KB Output is correct
18 Correct 6 ms 7252 KB Output is correct
19 Correct 8 ms 7216 KB Output is correct
20 Correct 6 ms 7252 KB Output is correct
21 Correct 6 ms 7252 KB Output is correct
22 Correct 8 ms 7300 KB Output is correct
23 Correct 8 ms 7256 KB Output is correct
24 Correct 9 ms 7252 KB Output is correct
25 Correct 408 ms 95616 KB Output is correct
26 Correct 385 ms 95596 KB Output is correct
27 Correct 427 ms 95892 KB Output is correct
28 Correct 371 ms 95596 KB Output is correct
29 Correct 372 ms 100796 KB Output is correct
30 Correct 406 ms 98968 KB Output is correct
31 Correct 280 ms 104508 KB Output is correct
32 Correct 287 ms 98588 KB Output is correct
33 Correct 263 ms 99036 KB Output is correct
34 Correct 403 ms 98416 KB Output is correct
35 Correct 381 ms 98380 KB Output is correct
36 Correct 446 ms 100328 KB Output is correct
37 Correct 439 ms 100732 KB Output is correct
38 Correct 646 ms 99292 KB Output is correct
39 Correct 301 ms 104596 KB Output is correct
40 Correct 359 ms 102904 KB Output is correct
41 Correct 349 ms 103104 KB Output is correct
42 Correct 489 ms 98484 KB Output is correct
43 Correct 492 ms 98520 KB Output is correct
44 Correct 487 ms 99420 KB Output is correct
45 Correct 664 ms 96268 KB Output is correct
46 Correct 592 ms 94620 KB Output is correct
47 Correct 590 ms 93764 KB Output is correct
48 Correct 438 ms 93296 KB Output is correct
49 Correct 493 ms 92984 KB Output is correct
50 Correct 420 ms 101016 KB Output is correct
51 Correct 3 ms 6100 KB Output is correct
52 Correct 8 ms 7252 KB Output is correct
53 Correct 492 ms 100176 KB Output is correct
54 Correct 474 ms 101704 KB Output is correct
55 Correct 497 ms 99696 KB Output is correct
56 Correct 500 ms 101724 KB Output is correct
57 Correct 3 ms 6100 KB Output is correct
58 Correct 10 ms 7252 KB Output is correct
59 Correct 453 ms 96904 KB Output is correct
60 Correct 602 ms 97108 KB Output is correct
61 Correct 598 ms 97224 KB Output is correct
62 Correct 575 ms 97172 KB Output is correct
63 Correct 609 ms 95808 KB Output is correct
64 Correct 685 ms 96048 KB Output is correct
65 Correct 618 ms 95876 KB Output is correct
66 Correct 407 ms 100892 KB Output is correct
67 Correct 606 ms 99240 KB Output is correct
68 Correct 386 ms 98448 KB Output is correct
69 Correct 365 ms 102988 KB Output is correct
70 Correct 544 ms 98560 KB Output is correct
71 Correct 605 ms 98580 KB Output is correct