oj.uz

Submission #779536

# Submission time Handle Problem Language Result Execution time Memory
779536 2023-07-11T13:58:11 Z bachhoangxuan Bitaro, who Leaps through Time (JOI19_timeleap) C++17
100 / 100
 669 ms 95748 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=300005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
struct node{
    int l,r,cost,nxt;
    node(int _l=-inf,int _r=inf,int _cost=0,int _nxt=inf):l(_l),r(_r),cost(_cost),nxt(_nxt){}
    friend node operator+(node a,node b){
        node res;
        if(a.nxt!=inf) res=node(a.l,a.r,a.cost+max(a.nxt-b.r,0LL),max(min(a.nxt,b.r),b.l));
        else if(a.r<b.l) res=node(a.r,a.r,0,b.l);
        else if(a.l>b.r) res=node(a.l,a.l,a.l-b.r,b.r);
        else if(b.nxt!=inf) return b;
        else res=node(max(a.l,b.l),min(a.r,b.r),0,inf);
        if(b.nxt!=inf) res.nxt=b.nxt,res.cost+=b.cost;
        return res;
    }
};
struct Segtree{
    node tree[4*maxn];
    void update(int l,int r,int id,int p,int lt,int rt){
        if(l==r) return tree[id]=node(lt-p,rt-p-1,0,inf),void();
        int mid=(l+r)/2;
        if(p<=mid) update(l,mid,id<<1,p,lt,rt);
        else update(mid+1,r,id<<1|1,p,lt,rt);
        tree[id]=tree[id<<1]+tree[id<<1|1];
    }
    node query(int l,int r,int id,int tl,int tr){
        if(l>tr||tl>r) return node();
        if(tl<=l && r<=tr) return tree[id];
        int mid=(l+r)/2;
        return query(l,mid,id<<1,tl,tr)+query(mid+1,r,id<<1|1,tl,tr);
    }
}s[2];
int n,q;
void update(int p,int l,int r){
    s[0].update(1,n-1,1,p,l,r);
    s[1].update(1,n-1,1,n-p,l,r);
}
void solve(){
    cin >> n >> q;
    for(int i=1;i<n;i++){int l,r;cin >> l >> r;update(i,l,r);}
    for(int i=1;i<=q;i++){
        int t,a,b,c,d;cin >> t;
        if(t==1){
            cin >> a >> c >> d;
            update(a,c,d);
        }
        else{
            cin >> a >> b >> c >> d;
            if(a==c) cout << max(b-d,0LL) << '\n';
            else{
                int rt=0;
                if(a>c) rt=1,a=n-a+1,c=n-c+1;
                node res=node(b-a,b-a,0,inf)+s[rt].query(1,n-1,1,a,c-1)+node(d-c,d-c,0,inf);
                cout << res.cost << '\n';
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 75428 KB Output is correct
2 Correct 31 ms 75488 KB Output is correct
3 Correct 27 ms 75392 KB Output is correct
4 Correct 26 ms 75472 KB Output is correct
5 Correct 26 ms 75348 KB Output is correct
6 Correct 29 ms 75380 KB Output is correct
7 Correct 30 ms 75348 KB Output is correct
8 Correct 31 ms 75360 KB Output is correct
9 Correct 26 ms 75420 KB Output is correct
10 Correct 26 ms 75476 KB Output is correct
11 Correct 27 ms 75452 KB Output is correct
12 Correct 27 ms 75500 KB Output is correct
13 Correct 27 ms 75476 KB Output is correct
14 Correct 30 ms 75632 KB Output is correct
15 Correct 27 ms 75476 KB Output is correct
16 Correct 32 ms 75508 KB Output is correct
17 Correct 30 ms 75388 KB Output is correct
18 Correct 33 ms 75484 KB Output is correct
19 Correct 28 ms 75508 KB Output is correct
20 Correct 28 ms 75416 KB Output is correct
21 Correct 28 ms 75416 KB Output is correct
22 Correct 30 ms 75480 KB Output is correct
23 Correct 29 ms 75468 KB Output is correct
24 Correct 29 ms 75464 KB Output is correct
25 Correct 35 ms 75564 KB Output is correct
26 Correct 28 ms 75444 KB Output is correct
27 Correct 33 ms 75476 KB Output is correct
28 Correct 28 ms 75444 KB Output is correct
29 Correct 28 ms 75468 KB Output is correct
30 Correct 29 ms 75544 KB Output is correct
31 Correct 28 ms 75476 KB Output is correct
32 Correct 29 ms 75464 KB Output is correct
33 Correct 33 ms 75396 KB Output is correct
34 Correct 28 ms 75480 KB Output is correct
35 Correct 32 ms 75420 KB Output is correct
36 Correct 28 ms 75468 KB Output is correct
37 Correct 27 ms 75476 KB Output is correct
38 Correct 27 ms 75448 KB Output is correct
39 Correct 27 ms 75404 KB Output is correct
40 Correct 28 ms 75392 KB Output is correct
41 Correct 32 ms 75448 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 95464 KB Output is correct
2 Correct 613 ms 94840 KB Output is correct
3 Correct 594 ms 94980 KB Output is correct
4 Correct 555 ms 94796 KB Output is correct
5 Correct 582 ms 95180 KB Output is correct
6 Correct 590 ms 95080 KB Output is correct
7 Correct 616 ms 95100 KB Output is correct
8 Correct 643 ms 95748 KB Output is correct
9 Correct 564 ms 95104 KB Output is correct
10 Correct 622 ms 95244 KB Output is correct
11 Correct 603 ms 95232 KB Output is correct
12 Correct 657 ms 95688 KB Output is correct
13 Correct 628 ms 95740 KB Output is correct
14 Correct 27 ms 75476 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 75428 KB Output is correct
2 Correct 31 ms 75488 KB Output is correct
3 Correct 27 ms 75392 KB Output is correct
4 Correct 26 ms 75472 KB Output is correct
5 Correct 26 ms 75348 KB Output is correct
6 Correct 29 ms 75380 KB Output is correct
7 Correct 30 ms 75348 KB Output is correct
8 Correct 31 ms 75360 KB Output is correct
9 Correct 26 ms 75420 KB Output is correct
10 Correct 26 ms 75476 KB Output is correct
11 Correct 27 ms 75452 KB Output is correct
12 Correct 27 ms 75500 KB Output is correct
13 Correct 27 ms 75476 KB Output is correct
14 Correct 30 ms 75632 KB Output is correct
15 Correct 27 ms 75476 KB Output is correct
16 Correct 32 ms 75508 KB Output is correct
17 Correct 30 ms 75388 KB Output is correct
18 Correct 33 ms 75484 KB Output is correct
19 Correct 28 ms 75508 KB Output is correct
20 Correct 28 ms 75416 KB Output is correct
21 Correct 28 ms 75416 KB Output is correct
22 Correct 30 ms 75480 KB Output is correct
23 Correct 29 ms 75468 KB Output is correct
24 Correct 29 ms 75464 KB Output is correct
25 Correct 35 ms 75564 KB Output is correct
26 Correct 28 ms 75444 KB Output is correct
27 Correct 33 ms 75476 KB Output is correct
28 Correct 28 ms 75444 KB Output is correct
29 Correct 28 ms 75468 KB Output is correct
30 Correct 29 ms 75544 KB Output is correct
31 Correct 28 ms 75476 KB Output is correct
32 Correct 29 ms 75464 KB Output is correct
33 Correct 33 ms 75396 KB Output is correct
34 Correct 28 ms 75480 KB Output is correct
35 Correct 32 ms 75420 KB Output is correct
36 Correct 28 ms 75468 KB Output is correct
37 Correct 27 ms 75476 KB Output is correct
38 Correct 27 ms 75448 KB Output is correct
39 Correct 27 ms 75404 KB Output is correct
40 Correct 28 ms 75392 KB Output is correct
41 Correct 32 ms 75448 KB Output is correct
42 Correct 669 ms 95464 KB Output is correct
43 Correct 613 ms 94840 KB Output is correct
44 Correct 594 ms 94980 KB Output is correct
45 Correct 555 ms 94796 KB Output is correct
46 Correct 582 ms 95180 KB Output is correct
47 Correct 590 ms 95080 KB Output is correct
48 Correct 616 ms 95100 KB Output is correct
49 Correct 643 ms 95748 KB Output is correct
50 Correct 564 ms 95104 KB Output is correct
51 Correct 622 ms 95244 KB Output is correct
52 Correct 603 ms 95232 KB Output is correct
53 Correct 657 ms 95688 KB Output is correct
54 Correct 628 ms 95740 KB Output is correct
55 Correct 27 ms 75476 KB Output is correct
56 Correct 630 ms 92092 KB Output is correct
57 Correct 579 ms 91708 KB Output is correct
58 Correct 618 ms 92160 KB Output is correct
59 Correct 619 ms 92308 KB Output is correct
60 Correct 580 ms 91832 KB Output is correct
61 Correct 604 ms 92504 KB Output is correct
62 Correct 639 ms 92440 KB Output is correct
63 Correct 619 ms 92544 KB Output is correct
64 Correct 646 ms 92480 KB Output is correct
65 Correct 585 ms 92188 KB Output is correct
66 Correct 617 ms 92144 KB Output is correct
67 Correct 604 ms 92464 KB Output is correct
68 Correct 582 ms 91604 KB Output is correct
69 Correct 627 ms 92512 KB Output is correct
70 Correct 560 ms 91820 KB Output is correct
71 Correct 579 ms 91104 KB Output is correct
72 Correct 595 ms 91312 KB Output is correct
73 Correct 619 ms 91912 KB Output is correct
74 Correct 615 ms 91980 KB Output is correct
75 Correct 625 ms 92032 KB Output is correct
76 Correct 614 ms 92648 KB Output is correct
77 Correct 45 ms 75452 KB Output is correct