oj.uz

Submission #164012

# Submission time Handle Problem Language Result Execution time Memory
164012 2019-11-16T20:27:00 Z georgerapeanu Bitaro, who Leaps through Time (JOI19_timeleap) C++11
100 / 100
 939 ms 97444 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <cstring>

using namespace std;

const int NMAX = 3e5;

struct node_t{
    int breaking_point;
    int l,r;
    int real_l,real_r;
    long long cst;

    node_t operator + (const node_t &other)const{
        node_t ans;
        ans.cst = this->cst + other.cst;
        ans.real_l = max(this->real_l,other.real_l);
        ans.real_r = min(this->real_r,other.real_r);
        if(ans.real_l <= ans.real_r){
            ans.breaking_point = ans.real_r;
            ans.cst = 0;
            ans.l = ans.real_l;
            ans.r = ans.real_r;
        }
        else{
            if(this->real_l <= this->real_r){
                if(other.real_l <= other.real_r){
                    if(this->r < other.l){
                        ans.cst += 0;
                        ans.l = ans.r = other.l;
                        ans.breaking_point = this->r;
                    }
                    else{
                        ans.cst += this->l - other.r;
                        ans.l = ans.r = other.r;
                        ans.breaking_point = this->l;
                    }
                }
                else{
                    ans.l = other.l;ans.r = other.r;
                    if(other.breaking_point > this-> r){
                        ans.breaking_point = this->breaking_point;
                        ans.cst += 0;
                    }
                    else if(other.breaking_point >= this->l){
                        ans.breaking_point = other.breaking_point;
                        ans.cst += 0;
                    }
                    else{
                        ans.breaking_point = this->l;
                        ans.cst += this->l - other.breaking_point;
                    }
                }
            }
            else{
                if(this->l >= other.breaking_point){
                    ans.cst += this->l - other.breaking_point;
                }
                ans.breaking_point = this->breaking_point;
                if(other.r < this->l){
                    ans.l = ans.r = other.r;
                }
                else if(other.l <= this->l){
                    ans.l = ans.r = this->l;
                }
                else{
                    ans.l = ans.r = other.l;
                }
            }
        }
        return ans;
    }
};

class SegTree{
public:

    int n;
    node_t aint[NMAX * 4 + 5];

    void build(int nod,int st,int dr,pair<int,int> v[]){
        if(st == dr){
            aint[nod].l = aint[nod].real_l = v[st].first;
            aint[nod].r = aint[nod].real_r = v[st].second;
            aint[nod].breaking_point = aint[nod].real_r;
            aint[nod].cst = 0;
            return ;
        }

        int mid = (st + dr) / 2;

        build(nod * 2,st,mid,v);
        build(nod * 2 + 1,mid + 1,dr,v);

        aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
    }

    void update(int nod,int st,int dr,int pos,pair<int,int> val){
        if(pos < st || pos > dr){
            return ;
        }
        if(st == dr){
            aint[nod].l = aint[nod].real_l = val.first;
            aint[nod].r = aint[nod].real_r = val.second;
            aint[nod].breaking_point = aint[nod].real_r;
            aint[nod].cst = 0;
            return ;
        }

        int mid = (st + dr) / 2;

        update(nod * 2,st,mid,pos,val);
        update(nod * 2 + 1,mid + 1,dr,pos,val);

        aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
    }

    SegTree(int n,pair<int,int> v[]){
        this->n = n;
        build(1,1,n,v);
    }

    SegTree(){
        this->n = 0;
        memset(this->aint,0,sizeof(this->aint));
    }

    node_t query(int nod,int st,int dr,int l,int r){
        if(l <= st && dr <= r){
            return aint[nod];
        }

        int mid = (st + dr) / 2;

        if(l > mid){
            return query(nod * 2 + 1,mid + 1,dr,l,r);
        }
        else if(r <= mid){
            return query(nod * 2,st,mid,l,r);
        }
        else{
            return query(nod * 2,st,mid,l,r) + query(nod * 2 + 1,mid + 1,dr,l,r);
        }
    }
};

int n,q;
pair<int,int> fst[NMAX + 5];
pair<int,int> snd[NMAX + 5];

SegTree norm;
SegTree rev;

int main(){

    scanf("%d %d",&n,&q);

    for(int i = 1;i < n;i++){
        scanf("%d %d",&fst[i].first,&fst[i].second);
        fst[i].second--;
        snd[n - i] = fst[i];
    }

    for(int i = 1;i < n;i++){
        fst[i].first -= i;
        fst[i].second -= i;
        snd[i].first -= i;
        snd[i].second -= i;
    }
    
    if(n == 1){
        while(q--){
            int t;
            scanf("%d",&t);
            if(t == 1){
                int p,l,r;
                scanf("%d %d %d",&p,&l,&r);
            }
            else{
                int a,b,c,d;
                scanf("%d %d %d %d",&a,&b,&c,&d);
                printf("%d\n",max(0,b - d));
            }
        }
        return 0;
    }

    norm.n = n - 1;norm.build(1,1,n - 1,fst);
    rev.n = n - 1;rev.build(1,1,n - 1,snd);

    while(q--){
        int t;
        scanf("%d",&t);

        if(t == 1){
            int p,l,r;
            scanf("%d %d %d",&p,&l,&r);
            r--;
            norm.update(1,1,n - 1,p,{l - p,r - p});
            rev.update(1,1,n - 1,n - p,{l - (n - p),r - (n - p)});
        }
        else{
            int a,b,c,d;
            scanf("%d %d %d %d",&a,&b,&c,&d);
            if(a == c){
                printf("%lld\n",max(0LL,(long long)b - d));
            }
            else if(a < c){
                b -= a;
                d -= c;
                node_t tmp = norm.query(1,1,n - 1,a,c - 1);
                int ext_wh = -1;

                if(b > tmp.r){
                    ext_wh = tmp.r;
                }
                else if(b >= tmp.l){
                    ext_wh = b;
                }
                else{
                    ext_wh = tmp.l;
                }

                long long ans = tmp.cst + max(0,b - tmp.breaking_point) + max(0,ext_wh - d);
                
                printf("%lld\n",ans);
            }
            else{
                a = n + 1 - a;
                c = n + 1 - c;
                b -= a;
                d -= c;
                node_t tmp = rev.query(1,1,n - 1,a,c - 1);
                int ext_wh = -1;

                if(b > tmp.r){
                    ext_wh = tmp.r;
                }
                else if(b >= tmp.l){
                    ext_wh = b;
                }
                else{
                    ext_wh = tmp.l;
                }
                long long ans = tmp.cst + max(0,b - tmp.breaking_point) + max(0,ext_wh - d);
                
                printf("%lld\n",ans);
            }
        }
    }

    return 0;
}

Compilation message

timeleap.cpp: In function 'int main()':
timeleap.cpp:159:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&q);
     ~~~~~^~~~~~~~~~~~~~~
timeleap.cpp:162:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&fst[i].first,&fst[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:177:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&t);
             ~~~~~^~~~~~~~~
timeleap.cpp:180:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d %d %d",&p,&l,&r);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:184:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d %d %d %d",&a,&b,&c,&d);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:196:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&t);
         ~~~~~^~~~~~~~~
timeleap.cpp:200:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d %d",&p,&l,&r);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:207:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d %d %d",&a,&b,&c,&d);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 75384 KB Output is correct
2 Correct 64 ms 75384 KB Output is correct
3 Correct 64 ms 75512 KB Output is correct
4 Correct 71 ms 75512 KB Output is correct
5 Correct 65 ms 75384 KB Output is correct
6 Correct 65 ms 75452 KB Output is correct
7 Correct 65 ms 75512 KB Output is correct
8 Correct 65 ms 75384 KB Output is correct
9 Correct 65 ms 75384 KB Output is correct
10 Correct 69 ms 75484 KB Output is correct
11 Correct 73 ms 75484 KB Output is correct
12 Correct 66 ms 75528 KB Output is correct
13 Correct 74 ms 75596 KB Output is correct
14 Correct 74 ms 75512 KB Output is correct
15 Correct 70 ms 75512 KB Output is correct
16 Correct 66 ms 75512 KB Output is correct
17 Correct 72 ms 75388 KB Output is correct
18 Correct 74 ms 75512 KB Output is correct
19 Correct 70 ms 75464 KB Output is correct
20 Correct 70 ms 75424 KB Output is correct
21 Correct 73 ms 75512 KB Output is correct
22 Correct 67 ms 75512 KB Output is correct
23 Correct 65 ms 75524 KB Output is correct
24 Correct 66 ms 75512 KB Output is correct
25 Correct 65 ms 75512 KB Output is correct
26 Correct 67 ms 75456 KB Output is correct
27 Correct 67 ms 75512 KB Output is correct
28 Correct 66 ms 75640 KB Output is correct
29 Correct 66 ms 75512 KB Output is correct
30 Correct 67 ms 75512 KB Output is correct
31 Correct 67 ms 75512 KB Output is correct
32 Correct 67 ms 75640 KB Output is correct
33 Correct 70 ms 75512 KB Output is correct
34 Correct 66 ms 75512 KB Output is correct
35 Correct 66 ms 75516 KB Output is correct
36 Correct 66 ms 75512 KB Output is correct
37 Correct 66 ms 75528 KB Output is correct
38 Correct 67 ms 75512 KB Output is correct
39 Correct 67 ms 75512 KB Output is correct
40 Correct 67 ms 75616 KB Output is correct
41 Correct 65 ms 75512 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 793 ms 83952 KB Output is correct
2 Correct 756 ms 84128 KB Output is correct
3 Correct 796 ms 83916 KB Output is correct
4 Correct 755 ms 83852 KB Output is correct
5 Correct 787 ms 84180 KB Output is correct
6 Correct 822 ms 84060 KB Output is correct
7 Correct 768 ms 84220 KB Output is correct
8 Correct 806 ms 84504 KB Output is correct
9 Correct 819 ms 83904 KB Output is correct
10 Correct 778 ms 84120 KB Output is correct
11 Correct 803 ms 84184 KB Output is correct
12 Correct 790 ms 84364 KB Output is correct
13 Correct 795 ms 84344 KB Output is correct
14 Correct 64 ms 75384 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 75384 KB Output is correct
2 Correct 64 ms 75384 KB Output is correct
3 Correct 64 ms 75512 KB Output is correct
4 Correct 71 ms 75512 KB Output is correct
5 Correct 65 ms 75384 KB Output is correct
6 Correct 65 ms 75452 KB Output is correct
7 Correct 65 ms 75512 KB Output is correct
8 Correct 65 ms 75384 KB Output is correct
9 Correct 65 ms 75384 KB Output is correct
10 Correct 69 ms 75484 KB Output is correct
11 Correct 73 ms 75484 KB Output is correct
12 Correct 66 ms 75528 KB Output is correct
13 Correct 74 ms 75596 KB Output is correct
14 Correct 74 ms 75512 KB Output is correct
15 Correct 70 ms 75512 KB Output is correct
16 Correct 66 ms 75512 KB Output is correct
17 Correct 72 ms 75388 KB Output is correct
18 Correct 74 ms 75512 KB Output is correct
19 Correct 70 ms 75464 KB Output is correct
20 Correct 70 ms 75424 KB Output is correct
21 Correct 73 ms 75512 KB Output is correct
22 Correct 67 ms 75512 KB Output is correct
23 Correct 65 ms 75524 KB Output is correct
24 Correct 66 ms 75512 KB Output is correct
25 Correct 65 ms 75512 KB Output is correct
26 Correct 67 ms 75456 KB Output is correct
27 Correct 67 ms 75512 KB Output is correct
28 Correct 66 ms 75640 KB Output is correct
29 Correct 66 ms 75512 KB Output is correct
30 Correct 67 ms 75512 KB Output is correct
31 Correct 67 ms 75512 KB Output is correct
32 Correct 67 ms 75640 KB Output is correct
33 Correct 70 ms 75512 KB Output is correct
34 Correct 66 ms 75512 KB Output is correct
35 Correct 66 ms 75516 KB Output is correct
36 Correct 66 ms 75512 KB Output is correct
37 Correct 66 ms 75528 KB Output is correct
38 Correct 67 ms 75512 KB Output is correct
39 Correct 67 ms 75512 KB Output is correct
40 Correct 67 ms 75616 KB Output is correct
41 Correct 65 ms 75512 KB Output is correct
42 Correct 793 ms 83952 KB Output is correct
43 Correct 756 ms 84128 KB Output is correct
44 Correct 796 ms 83916 KB Output is correct
45 Correct 755 ms 83852 KB Output is correct
46 Correct 787 ms 84180 KB Output is correct
47 Correct 822 ms 84060 KB Output is correct
48 Correct 768 ms 84220 KB Output is correct
49 Correct 806 ms 84504 KB Output is correct
50 Correct 819 ms 83904 KB Output is correct
51 Correct 778 ms 84120 KB Output is correct
52 Correct 803 ms 84184 KB Output is correct
53 Correct 790 ms 84364 KB Output is correct
54 Correct 795 ms 84344 KB Output is correct
55 Correct 64 ms 75384 KB Output is correct
56 Correct 858 ms 96508 KB Output is correct
57 Correct 921 ms 95804 KB Output is correct
58 Correct 877 ms 96624 KB Output is correct
59 Correct 878 ms 96784 KB Output is correct
60 Correct 834 ms 96092 KB Output is correct
61 Correct 874 ms 97180 KB Output is correct
62 Correct 881 ms 97160 KB Output is correct
63 Correct 930 ms 97008 KB Output is correct
64 Correct 939 ms 97036 KB Output is correct
65 Correct 895 ms 96652 KB Output is correct
66 Correct 900 ms 96644 KB Output is correct
67 Correct 839 ms 97036 KB Output is correct
68 Correct 821 ms 95868 KB Output is correct
69 Correct 846 ms 97192 KB Output is correct
70 Correct 813 ms 95944 KB Output is correct
71 Correct 876 ms 95168 KB Output is correct
72 Correct 846 ms 95680 KB Output is correct
73 Correct 884 ms 96800 KB Output is correct
74 Correct 876 ms 96808 KB Output is correct
75 Correct 876 ms 97028 KB Output is correct
76 Correct 883 ms 97444 KB Output is correct
77 Correct 64 ms 75512 KB Output is correct