Submission #907436

#	Time	Username	Problem	Language	Result	Execution time	Memory
907436		GrindMachine	Bitaro, who Leaps through Time (JOI19_timeleap)	C++17	4 / 100	3023 ms	10764 KiB

timeleap

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,q; cin >> n >> q;
    vector<pll> a(n+5);
    rep1(i,n-1) cin >> a[i].ff >> a[i].ss;
    rep1(i,n-1) a[i].ss--;

    while(q--){
        ll t; cin >> t;
        if(t == 1){
            ll i,l,r; cin >> i >> l >> r;
            a[i] = {l,r-1};
        }
        else{
            ll u,t1,v,t2; cin >> u >> t1 >> v >> t2;
            ll ans = 0;

            if(u < v){
                for(int i = u; i < v; ++i){
                    auto [l,r] = a[i];
                    if(t1 > r){
                        ans += t1-r;
                        t1 = r;
                    }

                    amax(t1,l);
                    t1++;
                }
            }
            else{
                for(int i = u; i > v; --i){
                    auto [l,r] = a[i-1];
                    if(t1 > r){
                        ans += t1-r;
                        t1 = r;
                    }

                    amax(t1,l);
                    t1++;
                }
            }

            ans += max(t1-t2,0ll);
            cout << ans << endl;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 30
• Subtask 3: 0 / 66