Submission #985972

#	Time	Username	Problem	Language	Result	Execution time	Memory
985972		GrindMachine	Treatment Project (JOI20_treatment)	C++17	100 / 100	133 ms	15872 KiB

treatment

#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(...) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/74871?#comment-592237

*/

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

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        pll mn1,mn2;
    };

    data neutral = {{inf2,inf2},{inf2,inf2}};

    data merge(data &left, data &right) {
        data curr;
        
        curr.mn1 = min(left.mn1,right.mn1);
        curr.mn2 = min(left.mn2,right.mn2);

        return curr;
    }

    void create(int i, T v) {

    }

    void modify(int i, T v) {
        tr[i].mn1 = {v.ff,i-n};
        tr[i].mn2 = {v.ss,i-n};
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    ll m,n; cin >> m >> n;
    vector<array<ll,4>> a(n+5);
    rep1(i,n) rep(j,4) cin >> a[i][j];
    sort(a.begin()+1,a.begin()+n+1);

    segtree<pll> st(n+5);
    rep1(i,n){
        auto [t,l,r,c] = a[i];
        st.pupd(i,{l-t,l+t});
    }

    priority_queue<pll,vector<pll>,greater<pll>> pq;
    rep1(i,n){
        auto [t,l,r,c] = a[i];
        if(l == 1){
            pq.push({c,i});
            st.pupd(i,{inf2,inf2});
        }
    }

    vector<bool> vis(n+5);

    while(!pq.empty()){
        auto [cost,u] = pq.top();
        pq.pop();

        if(a[u][2] == m){
            cout << cost << endl;
            return;
        }

        if(vis[u]) conts;
        vis[u] = 1;

        auto [t,l,r,c] = a[u];

        // tj >= ti
        while(true){
            auto [mn1,mn2] = st.query(u+1,n);
            if(mn2.ff > r+t+1) break;
            ll v = mn2.ss;
            pq.push({cost+a[v][3],v});
            st.pupd(v,{inf2,inf2});
        }

        // tj <= ti
        while(true){
            auto [mn1,mn2] = st.query(1,u-1);
            if(mn1.ff > r-t+1) break;
            ll v = mn1.ss;
            pq.push({cost+a[v][3],v});
            st.pupd(v,{inf2,inf2});
        }
    }

    cout << -1 << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 61 / 61