oj.uz

Submission #824543

# Submission time Handle Problem Language Result Execution time Memory
824543 2023-08-14T07:30:17 Z Amylopectin Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 876 ms 48884 KB 
#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;

const int mxn = 1e6 + 10;
int n,le[40][mxn] = {},ri[40][mxn] = {},rel,rer,ldo[mxn] = {},rdo[mxn] = {};
int bui(int cl,int cr,int no,int v)
{
    if(cl == cr)
    {
        // le[][no] = cl;
        // ri[][no] = cl;
        le[v][no] = -1;
        ri[v][no] = -1;
        return 0;
    }
    int mid = (cl+cr) / 2;
    bui(cl,mid,no*2,v);
    bui(mid+1,cr,no*2+1,v);
    le[v][no] = -1;
    ri[v][no] = -1;
    // le[][no] = min(le[][no*2],le[][no*2+1]);
    // ri[][no] = max(ri[][no*2],ri[][no*2+1]);
    return 0;
}
int ad(int cl,int cr,int no,int tl,int tr,int ava,int v)
{

    if(cl > tr || cr < tl)
    {
        return 0;
    }
    if(cl >= tl && cr <= tr)
    {
        if(le[v][no] == -1)
        {
            le[v][no] = ava;
        }
        else 
        {
            le[v][no] = min(le[v][no],ava);
        }
        if(ri[v][no] == -1)
        {
            ri[v][no] = ava;
        }
        else 
        {
            ri[v][no] = max(ri[v][no],ava);
        }
        return 0;
    }
    int mid = (cl+cr) / 2;
    ad(cl,mid,no*2,tl,tr,ava,v);
    ad(mid+1,cr,no*2+1,tl,tr,ava,v);
    // le[][no] = min(le[][no*2],le[][no*2+1]);
    // ri[][no] = max(ri[][no*2],ri[][no*2+1]);
    return 0;
}
int bui2(int cl,int cr,int no,int ldow,int rdow,int v)
{
    if(le[v][no] != -1)
    {
        if(ldow != -1)
        {
            ldow = min(ldow,le[v][no]);
        }
        else 
        {
            ldow = le[v][no];
        }
    }
    if(ri[v][no] != -1)
    {
        if(rdow != -1)
        {
            rdow = max(rdow,ri[v][no]);
        }
        else 
        {
            rdow = ri[v][no];
        }
    }
    if(cl == cr)
    {
        le[v][no] = ldow;
        ri[v][no] = rdow;
        return 0;
    }
    int mid = (cl+cr) / 2;
    bui2(cl,mid,no*2,ldow,rdow,v);
    bui2(mid+1,cr,no*2+1,ldow,rdow,v);
    if(le[v][no*2] == -1)
    {
        le[v][no] = le[v][no*2 +1];
    }
    else if(le[v][no*2+1] == -1)
    {
        le[v][no] = le[v][no*2];
    }
    else 
    {
        le[v][no] = min(le[v][no*2],le[v][no*2+1]);
    }
    if(ri[v][no*2] == -1)
    {
        ri[v][no] = ri[v][no*2 +1];
    }
    else if(ri[v][no*2+1] == -1)
    {
        ri[v][no] = ri[v][no*2];
    }
    else 
    {
        ri[v][no] = max(ri[v][no*2],ri[v][no*2+1]);
    }
    
    return 0;
}
int fii(int cl,int cr,int no,int tl,int tr,int v)
{
    if(cl > tr || cr < tl)
    {
        return 0;
    }
    if(cl >= tl && cr <= tr)
    {
        if(le[v][no] != -1)
            rel = min(le[v][no],rel);
        if(ri[v][no] != -1)
            rer = max(ri[v][no],rer);
        return 0;
    }
    int mid = (cl+cr) / 2;
    fii(cl,mid,no*2,tl,tr,v);
    fii(mid+1,cr,no*2+1,tl,tr,v);
    return 0;
}
int bui3(int cl,int cr,int no,int v)
{
    if(cl == cr)
    {
        if(le[v][no] != -1)
        {
            le[v][no] = min(le[v][no],cl);
        }
        if(ri[v][no] != -1)
        {
            ri[v][no] = max(ri[v][no],cl);
        }
        rel = le[v][no];
        rer = ri[v][no];
        fii(1,n,1,le[v][no],ri[v][no],v);
        le[v+1][no] = rel;
        ri[v+1][no] = rer;
        return 0;
    }
    int mid = (cl+cr) / 2;
    bui3(cl,mid,no*2,v);
    bui3(mid+1,cr,no*2+1,v);
    if(le[v+1][no*2] == -1)
    {
        le[v+1][no] = le[v+1][no*2 +1];
    }
    else if(le[v+1][no*2+1] == -1)
    {
        le[v+1][no] = le[v+1][no*2];
    }
    else 
    {
        le[v+1][no] = min(le[v+1][no*2],le[v+1][no*2+1]);
    }
    if(ri[v+1][no*2] == -1)
    {
        ri[v+1][no] = ri[v+1][no*2 +1];
    }
    else if(ri[v+1][no*2+1] == -1)
    {
        ri[v+1][no] = ri[v+1][no*2];
    }
    else 
    {
        ri[v+1][no] = max(ri[v+1][no*2],ri[v+1][no*2+1]);
    }
    return 0;
}

int main()
{
    int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
    scanf("%d %d %d",&n,&ex,&m);
    for(i=0; i<21; i++)
    {
        bui(1,n,1,i);
    }
    for(i=0; i<m; i++)
    {
        scanf("%d %d",&cn,&cm);
        if(cn < cm)
        {
            ad(1,n,1,cn,min(cn+ex-1,cm),cm,0);
        }
        else 
        {
            ad(1,n,1,max(cn-ex+1,cm),cn,cm,0);
        }
    }
    bui2(1,n,1,-1,-1,0);
    for(i=0; i<21; i++)
    {
        bui3(1,n,1,i);
    }
    scanf("%d",&q);
    for(i=0; i<q; i++)
    {
        scanf("%d %d",&cn,&cm);
        cl = cn;
        cr = cn;
        of = 0;
        cou = 0;
        for(j=20; j>=0; j--)
        {
            rel = cl;
            rer = cr;
            fii(1,n,1,cl,cr,j);
            if(!(rel <= cm && cm <= rer))
            {
                cou += (1<<j);
                cl = rel;
                cr = rer;
            }
        }
        cou ++;
        if(cou > m)
        {
            printf("-1\n");
        }
        else 
        {
            printf("%d\n",cou);
        }
        
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:191:13: warning: unused variable 'k' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |             ^
Main.cpp:191:25: warning: unused variable 'fn' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                         ^~
Main.cpp:191:28: warning: unused variable 'fm' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                            ^~
Main.cpp:191:44: warning: unused variable 'clp' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                                            ^~~
Main.cpp:191:48: warning: unused variable 'crp' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                                                ^~~
Main.cpp:191:52: warning: variable 'of' set but not used [-Wunused-but-set-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                                                    ^~
Main.cpp:191:55: warning: unused variable 'fl' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                                                       ^~
Main.cpp:191:58: warning: unused variable 'fr' [-Wunused-variable]
  191 |     int i,j,k,m,q,cn,cm,fn,fm,ex,cou,cl,cr,clp,crp,of,fl,fr;
      |                                                          ^~
Main.cpp:192:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  192 |     scanf("%d %d %d",&n,&ex,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:199:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  199 |         scanf("%d %d",&cn,&cm);
      |         ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:214:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  214 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
Main.cpp:217:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  217 |         scanf("%d %d",&cn,&cm);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 820 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 2 ms 840 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 820 KB Output is correct
12 Correct 2 ms 816 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 820 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 2 ms 840 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 820 KB Output is correct
12 Correct 2 ms 816 KB Output is correct
13 Correct 12 ms 1364 KB Output is correct
14 Correct 9 ms 1364 KB Output is correct
15 Correct 5 ms 1344 KB Output is correct
16 Correct 7 ms 1352 KB Output is correct
17 Correct 12 ms 1344 KB Output is correct
18 Correct 5 ms 1340 KB Output is correct
19 Correct 9 ms 1364 KB Output is correct
20 Correct 6 ms 1344 KB Output is correct
21 Correct 2 ms 1364 KB Output is correct
22 Correct 9 ms 1404 KB Output is correct
23 Correct 9 ms 1348 KB Output is correct
24 Correct 10 ms 1376 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 450 ms 46708 KB Output is correct
2 Correct 434 ms 46668 KB Output is correct
3 Correct 472 ms 46872 KB Output is correct
4 Correct 362 ms 46672 KB Output is correct
5 Correct 181 ms 48052 KB Output is correct
6 Correct 434 ms 47096 KB Output is correct
7 Correct 127 ms 46916 KB Output is correct
8 Correct 119 ms 46932 KB Output is correct
9 Correct 136 ms 46908 KB Output is correct
10 Correct 435 ms 47128 KB Output is correct
11 Correct 385 ms 47088 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 663 ms 47400 KB Output is correct
2 Correct 529 ms 48684 KB Output is correct
3 Correct 765 ms 47644 KB Output is correct
4 Correct 257 ms 48384 KB Output is correct
5 Correct 278 ms 48648 KB Output is correct
6 Correct 328 ms 48640 KB Output is correct
7 Correct 650 ms 48684 KB Output is correct
8 Correct 541 ms 48800 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 687 ms 48096 KB Output is correct
2 Correct 838 ms 47704 KB Output is correct
3 Correct 797 ms 47352 KB Output is correct
4 Correct 837 ms 46844 KB Output is correct
5 Correct 487 ms 46536 KB Output is correct
6 Correct 666 ms 46456 KB Output is correct
7 Correct 504 ms 47568 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 10 ms 1400 KB Output is correct
10 Correct 428 ms 48060 KB Output is correct
11 Correct 531 ms 48560 KB Output is correct
12 Correct 584 ms 48592 KB Output is correct
13 Correct 576 ms 48612 KB Output is correct
14 Correct 2 ms 816 KB Output is correct
15 Correct 12 ms 1344 KB Output is correct
16 Correct 535 ms 48072 KB Output is correct
17 Correct 872 ms 48816 KB Output is correct
18 Correct 809 ms 48820 KB Output is correct
19 Correct 739 ms 48784 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 820 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 2 ms 840 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 820 KB Output is correct
12 Correct 2 ms 816 KB Output is correct
13 Correct 12 ms 1364 KB Output is correct
14 Correct 9 ms 1364 KB Output is correct
15 Correct 5 ms 1344 KB Output is correct
16 Correct 7 ms 1352 KB Output is correct
17 Correct 12 ms 1344 KB Output is correct
18 Correct 5 ms 1340 KB Output is correct
19 Correct 9 ms 1364 KB Output is correct
20 Correct 6 ms 1344 KB Output is correct
21 Correct 2 ms 1364 KB Output is correct
22 Correct 9 ms 1404 KB Output is correct
23 Correct 9 ms 1348 KB Output is correct
24 Correct 10 ms 1376 KB Output is correct
25 Correct 450 ms 46708 KB Output is correct
26 Correct 434 ms 46668 KB Output is correct
27 Correct 472 ms 46872 KB Output is correct
28 Correct 362 ms 46672 KB Output is correct
29 Correct 181 ms 48052 KB Output is correct
30 Correct 434 ms 47096 KB Output is correct
31 Correct 127 ms 46916 KB Output is correct
32 Correct 119 ms 46932 KB Output is correct
33 Correct 136 ms 46908 KB Output is correct
34 Correct 435 ms 47128 KB Output is correct
35 Correct 385 ms 47088 KB Output is correct
36 Correct 663 ms 47400 KB Output is correct
37 Correct 529 ms 48684 KB Output is correct
38 Correct 765 ms 47644 KB Output is correct
39 Correct 257 ms 48384 KB Output is correct
40 Correct 278 ms 48648 KB Output is correct
41 Correct 328 ms 48640 KB Output is correct
42 Correct 650 ms 48684 KB Output is correct
43 Correct 541 ms 48800 KB Output is correct
44 Correct 687 ms 48096 KB Output is correct
45 Correct 838 ms 47704 KB Output is correct
46 Correct 797 ms 47352 KB Output is correct
47 Correct 837 ms 46844 KB Output is correct
48 Correct 487 ms 46536 KB Output is correct
49 Correct 666 ms 46456 KB Output is correct
50 Correct 504 ms 47568 KB Output is correct
51 Correct 1 ms 724 KB Output is correct
52 Correct 10 ms 1400 KB Output is correct
53 Correct 428 ms 48060 KB Output is correct
54 Correct 531 ms 48560 KB Output is correct
55 Correct 584 ms 48592 KB Output is correct
56 Correct 576 ms 48612 KB Output is correct
57 Correct 2 ms 816 KB Output is correct
58 Correct 12 ms 1344 KB Output is correct
59 Correct 535 ms 48072 KB Output is correct
60 Correct 872 ms 48816 KB Output is correct
61 Correct 809 ms 48820 KB Output is correct
62 Correct 739 ms 48784 KB Output is correct
63 Correct 761 ms 47408 KB Output is correct
64 Correct 876 ms 47892 KB Output is correct
65 Correct 658 ms 47496 KB Output is correct
66 Correct 199 ms 48700 KB Output is correct
67 Correct 638 ms 48852 KB Output is correct
68 Correct 524 ms 48560 KB Output is correct
69 Correct 289 ms 48588 KB Output is correct
70 Correct 680 ms 48740 KB Output is correct
71 Correct 754 ms 48884 KB Output is correct