oj.uz

Submission #985972

# Submission time Handle Problem Language Result Execution time Memory
985972 2024-05-19T13:17:32 Z GrindMachine Treatment Project (JOI20_treatment) C++17
100 / 100
 133 ms 15872 KB 
#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.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 13084 KB Output is correct
2 Correct 59 ms 13064 KB Output is correct
3 Correct 79 ms 12500 KB Output is correct
4 Correct 79 ms 12760 KB Output is correct
5 Correct 65 ms 15064 KB Output is correct
6 Correct 91 ms 13136 KB Output is correct
7 Correct 88 ms 12884 KB Output is correct
8 Correct 49 ms 12820 KB Output is correct
9 Correct 44 ms 12920 KB Output is correct
10 Correct 46 ms 12892 KB Output is correct
11 Correct 65 ms 15056 KB Output is correct
12 Correct 62 ms 14948 KB Output is correct
13 Correct 72 ms 15080 KB Output is correct
14 Correct 74 ms 15056 KB Output is correct
15 Correct 97 ms 12792 KB Output is correct
16 Correct 90 ms 12880 KB Output is correct
17 Correct 83 ms 12116 KB Output is correct
18 Correct 58 ms 14288 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 856 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 5 ms 884 KB Output is correct
26 Correct 5 ms 860 KB Output is correct
27 Correct 5 ms 856 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 5 ms 856 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 7 ms 856 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 5 ms 912 KB Output is correct
37 Correct 5 ms 860 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 13084 KB Output is correct
2 Correct 59 ms 13064 KB Output is correct
3 Correct 79 ms 12500 KB Output is correct
4 Correct 79 ms 12760 KB Output is correct
5 Correct 65 ms 15064 KB Output is correct
6 Correct 91 ms 13136 KB Output is correct
7 Correct 88 ms 12884 KB Output is correct
8 Correct 49 ms 12820 KB Output is correct
9 Correct 44 ms 12920 KB Output is correct
10 Correct 46 ms 12892 KB Output is correct
11 Correct 65 ms 15056 KB Output is correct
12 Correct 62 ms 14948 KB Output is correct
13 Correct 72 ms 15080 KB Output is correct
14 Correct 74 ms 15056 KB Output is correct
15 Correct 97 ms 12792 KB Output is correct
16 Correct 90 ms 12880 KB Output is correct
17 Correct 83 ms 12116 KB Output is correct
18 Correct 58 ms 14288 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 4 ms 856 KB Output is correct
39 Correct 4 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 6 ms 860 KB Output is correct
42 Correct 5 ms 860 KB Output is correct
43 Correct 5 ms 884 KB Output is correct
44 Correct 5 ms 860 KB Output is correct
45 Correct 5 ms 856 KB Output is correct
46 Correct 4 ms 856 KB Output is correct
47 Correct 5 ms 856 KB Output is correct
48 Correct 3 ms 860 KB Output is correct
49 Correct 3 ms 860 KB Output is correct
50 Correct 3 ms 860 KB Output is correct
51 Correct 4 ms 856 KB Output is correct
52 Correct 7 ms 856 KB Output is correct
53 Correct 4 ms 860 KB Output is correct
54 Correct 5 ms 912 KB Output is correct
55 Correct 5 ms 860 KB Output is correct
56 Correct 84 ms 12912 KB Output is correct
57 Correct 84 ms 13776 KB Output is correct
58 Correct 90 ms 12168 KB Output is correct
59 Correct 92 ms 12372 KB Output is correct
60 Correct 87 ms 13256 KB Output is correct
61 Correct 99 ms 12116 KB Output is correct
62 Correct 89 ms 12864 KB Output is correct
63 Correct 89 ms 12876 KB Output is correct
64 Correct 89 ms 13076 KB Output is correct
65 Correct 89 ms 13176 KB Output is correct
66 Correct 86 ms 13260 KB Output is correct
67 Correct 119 ms 13652 KB Output is correct
68 Correct 100 ms 13608 KB Output is correct
69 Correct 110 ms 13740 KB Output is correct
70 Correct 109 ms 14044 KB Output is correct
71 Correct 113 ms 13648 KB Output is correct
72 Correct 105 ms 13692 KB Output is correct
73 Correct 121 ms 13684 KB Output is correct
74 Correct 53 ms 13548 KB Output is correct
75 Correct 53 ms 13680 KB Output is correct
76 Correct 88 ms 15564 KB Output is correct
77 Correct 78 ms 14800 KB Output is correct
78 Correct 103 ms 15428 KB Output is correct
79 Correct 111 ms 13656 KB Output is correct
80 Correct 133 ms 13396 KB Output is correct
81 Correct 48 ms 13652 KB Output is correct
82 Correct 105 ms 12632 KB Output is correct
83 Correct 110 ms 12884 KB Output is correct
84 Correct 117 ms 13000 KB Output is correct
85 Correct 88 ms 13548 KB Output is correct
86 Correct 86 ms 13820 KB Output is correct
87 Correct 104 ms 13736 KB Output is correct
88 Correct 112 ms 13548 KB Output is correct
89 Correct 96 ms 13576 KB Output is correct
90 Correct 76 ms 15824 KB Output is correct
91 Correct 61 ms 13916 KB Output is correct
92 Correct 88 ms 13916 KB Output is correct
93 Correct 106 ms 13652 KB Output is correct
94 Correct 114 ms 13724 KB Output is correct
95 Correct 88 ms 13652 KB Output is correct
96 Correct 72 ms 14868 KB Output is correct
97 Correct 72 ms 15748 KB Output is correct
98 Correct 78 ms 15872 KB Output is correct
99 Correct 67 ms 15824 KB Output is correct
100 Correct 68 ms 15824 KB Output is correct
101 Correct 80 ms 15824 KB Output is correct
102 Correct 72 ms 15872 KB Output is correct
103 Correct 72 ms 13908 KB Output is correct