oj.uz

Submission #1039976

# Submission time Handle Problem Language Result Execution time Memory
1039976 2024-07-31T13:18:54 Z underwaterkillerwhale Fuel Station (NOI20_fuelstation) C++17
13 / 100
 134 ms 31556 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N =3e5 + 7;
const int Mod = 1e9 + 7;
const int szBL = 240;
const int INF = 2e9;
const int BASE = 137;

struct Segment_Tree {
    struct Node {
        ll sum, pre;
    };
    int m;
    Node st[N << 2];

    void init (int n) {
        m = n;
    }

    Node mer (Node lf, Node rt) {
        Node cur;
        cur.pre = min(lf.pre, lf.sum + rt.pre);
        cur.sum = lf.sum + rt.sum;
        return cur;
    }

    void update (int id, int l, int r, int pos, ll val) {
        if (l > pos || r < pos) return;
        if (l == r) {
            st[id].sum += val;
            st[id].pre = min (0LL, st[id].sum);
            return;
        }
        int mid = l + r >> 1;
        update (id << 1, l, mid, pos, val);
        update (id << 1 | 1, mid + 1, r, pos, val);
        st[id] = mer(st[id << 1], st[id << 1 | 1]);
//        cout << l <<" "<<r<<" "<<st[id].mn <<" "<<pos<<" "<<val<<"\n";
    }
    void update (int pos, ll val) {
        update (1, 1, m, pos, val);
    }
    Node get (int id, int l, int r, int u, int v) {
        if (l > v || r < u) return {0, 0};
        if (l >= u && r <= v) {
            return st[id];
        }
        int mid = l + r >> 1;
//        cout << l <<" "<<r<<" "<<mer(get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v)).pre <<"\n";
        return mer(get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
//        st[id] = mer(st[id << 1], st[id << 1 | 1]);
//        cout << l <<" "<<r<<" "<<st[id].mn <<" "<<pos<<" "<<val<<"\n";
    }

}ST;

struct Data {
    int X, a, b, id;
};

struct Data2 {
    int X, a, id;
};

int n, m, K, D;
Data a[N];
vector<Data2> events[N];
int cnt[N];

void solution () {
    cin >> n >> D;
    rep (i, 1, n) {
        cin >> a[i].X >> a[i].a >> a[i].b;
    }
    sort (a + 1, a + 1 + n, [] (Data A, Data B) { return A.X < B.X; });
    vector<int> valx;
    rep (i, 1, n) valx.push_back(a[i].X);
    sort (ALL(valx));
    valx.resize(K = unique(ALL(valx)) - valx.begin());
    rep (i, 1, n) a[i].id = lower_bound(ALL(valx), a[i].X) - valx.begin() + 1;
    vector<int> vals = {0};
    rep (i, 1, n) {
        vals.push_back(a[i].b);
    }
    sort (ALL(vals));
    vals.resize(m = unique(ALL(vals)) - vals.begin());
    ST.init(K + 1);
    ST.update(K + 1, -D);
    rep (i, 1, n) {
        a[i].b = lower_bound(ALL(vals), a[i].b) - vals.begin();
        events[a[i].b].push_back({a[i].X, a[i].a, a[i].id});
        if (cnt[a[i].id] == 0) {
            ST.update (a[i].id, -a[i].X);
            ST.update (a[i].id + 1, a[i].X);
        }
        cnt[a[i].id]++;
        ST.update (a[i].id + 1, a[i].a);
//        cout << a[i].id<<" "<<-a[i].X<<"\n";
//        cout << a[i].id + 1<<" "<<a[i].X<<"\n";
//        cout << a[i].id + 1<<" "<<a[i].a<<"\n";
    }
//    cout << K<<"\n";
    ll res = INF;
    rep (i, 1, m - 1) {
        res = min(res, -ST.st[1].pre);
//        cout << vals[i]<<":"<<ST.get(1, 1, m, 1, 1).sum <<" aaa\n";
        iter (&id, events[i]) {
            ST.update(id.id + 1, -id.a);
            --cnt[id.id];
            if (cnt[id.id] == 0) {
                ST.update (id.id, id.X);
                ST.update (id.id + 1, -id.X);
//                cout << id.id<<" "<<id.a<<" "<<
            }
        }
    }
    cout << res <<"\n";
}

#define file(name) freopen(name".inp", "r", stdin); \
freopen(name".out", "w", stdout);
/*
*/
int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
no bug challenge +2
more insight about dp0/1
*/

Compilation message

FuelStation.cpp: In member function 'void Segment_Tree::update(int, int, int, int, long long int)':
FuelStation.cpp:51:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |         int mid = l + r >> 1;
      |                   ~~^~~
FuelStation.cpp: In member function 'Segment_Tree::Node Segment_Tree::get(int, int, int, int, int)':
FuelStation.cpp:65:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Incorrect 2 ms 7516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 31124 KB Output is correct
2 Correct 117 ms 31048 KB Output is correct
3 Correct 118 ms 31044 KB Output is correct
4 Correct 99 ms 30648 KB Output is correct
5 Correct 106 ms 31100 KB Output is correct
6 Correct 125 ms 30492 KB Output is correct
7 Correct 117 ms 30540 KB Output is correct
8 Correct 104 ms 30792 KB Output is correct
9 Correct 118 ms 31552 KB Output is correct
10 Correct 91 ms 29820 KB Output is correct
11 Correct 125 ms 30532 KB Output is correct
12 Correct 94 ms 30536 KB Output is correct
13 Correct 120 ms 30532 KB Output is correct
14 Correct 134 ms 31040 KB Output is correct
15 Correct 104 ms 30536 KB Output is correct
16 Correct 118 ms 31556 KB Output is correct
17 Correct 98 ms 31200 KB Output is correct
18 Correct 117 ms 31048 KB Output is correct
19 Correct 95 ms 30532 KB Output is correct
20 Correct 125 ms 31016 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Incorrect 2 ms 7516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Incorrect 2 ms 7516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Incorrect 2 ms 7516 KB Output isn't correct
3 Halted 0 ms 0 KB -