oj.uz

Submission #543421

# Submission time Handle Problem Language Result Execution time Memory
543421 2022-03-30T14:06:58 Z SmolBrain Fuel Station (NOI20_fuelstation) C++17
43 / 100
 265 ms 52048 KB 
// Om Namah Shivaya
// GM in 125 days

#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 <class 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 endl '\n'
#define pb push_back
#define conts continue
#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 ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#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)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
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); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

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

template<typename T>
struct segtree {
    /*=======================================================*/

    struct data {
        ll sum, mnpref;
    };

    data neutral = {0, inf2};

    void merge(data &curr, data &left, data &right) {
        curr.sum = left.sum + right.sum;
        curr.mnpref = min(left.mnpref, left.sum + right.mnpref);
    }

    void create(int x, int lx, int rx, T v) {
        tr[x] = {v, v};
    }

    void modify(int x, int lx, int rx, T v) {
        tr[x] = {v, v};
    }

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

    int siz = 1;
    vector<data> tr;

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

    segtree() {

    };

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

    void build(vector<T> &a, int n, int x, int lx, int rx) {
        if (rx - lx == 1) {
            if (lx < n) {
                create(x, lx, rx, a[lx]);
            }

            return;
        }

        int mid = (lx + rx) / 2;

        build(a, n, 2 * x + 1, lx, mid);
        build(a, n, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void build(vector<T> &a, int n) {
        build(a, n, 0, 0, siz);
    }

    void pupd(int i, T v, int x, int lx, int rx) {
        if (rx - lx == 1) {
            modify(x, lx, rx, v);
            return;
        }

        int mid = (lx + rx) / 2;

        if (i < mid) {
            pupd(i, v, 2 * x + 1, lx, mid);
        }
        else {
            pupd(i, v, 2 * x + 2, mid, rx);
        }

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void pupd(int i, T v) {
        pupd(i, v, 0, 0, siz);
    }

    data query(int l, int r, int x, int lx, int rx) {
        if (lx >= r or rx <= l) return neutral;
        if (lx >= l and rx <= r) return tr[x];

        int mid = (lx + rx) / 2;

        data curr;
        data left = query(l, r, 2 * x + 1, lx, mid);
        data right = query(l, r, 2 * x + 2, mid, rx);

        merge(curr, left, right);
        return curr;
    }

    data query(int l, int r) {
        return query(l, r + 1, 0, 0, siz);
    }
};

void solve(int test_case)
{
    ll n, d; cin >> n >> d;
    vector<array<ll, 3>> a(n);
    rep(i, n) rep(j, 3) cin >> a[i][j];

    sort(all(a));

    vector<ll> diff(n + 5);
    diff[0] = a[0][0];
    rep1(i, n - 1) diff[i] = a[i][0] - a[i - 1][0];
    diff[n] = d - a[n - 1][0];

    auto check = [&](ll f) {
        ll prev = 0, fuel = f;

        rep(i, n) {
            auto [x, add, mx] = a[i];
            ll dis = x - prev;
            fuel -= dis;

            if (fuel < 0) {
                return false;
            }

            if (f <= mx) {
                fuel += add;
            }

            prev = x;
        }

        ll dis = d - prev;
        fuel -= dis;

        if (fuel < 0) return false;

        return true;
    };

    vector<ll> b(n);
    rep(i, n) b[i] = a[i][0];

    sort(all(b));
    auto it = unique(all(b));
    b.resize(it - b.begin());

    segtree<ll> st(2 * n + 5);
    rep(i, n + 1) st.pupd(2 * (i + 1), -diff[i]);

    ll ans = d;

    vector<array<ll, 3>> c(n);
    rep(i, n) {
        auto [x, toadd, mx] = a[i];
        x = lower_bound(all(b), x) - b.begin() + 1;
        c[i] = {mx, x, toadd};
    }

    sort(rall(c));

    ll l = -1, r = -1;

    rep(i, n) {
        auto [mx, x, toadd] = c[i];
        st.pupd(2 * x + 1, toadd);

        ll mnpref = st.query(0, 2 * n + 2).mnpref;
        ll first = 0;

        if (mnpref < 0) {
            first = abs(mnpref);
        }

        if (first <= mx) {
            amin(ans, first);
        }

        // if (mnpref >= 0) {
        //     if (i + 1 < n) {
        //         l = c[i + 1][0] + 1;
        //     }
        //     else {
        //         l = 1;
        //     }

        //     r = f;
        //     debug(l);
        //     debug(r);

        //     while (l <= r) {
        //         ll mid = (l + r) / 2;
        //         st.pupd(0, mid);

        //         mnpref = st.query(0, 2 * n + 2).mnpref;

        //         if (mnpref >= 0) {
        //             amin(ans, f);
        //             r = mid - 1;
        //         }
        //         else {
        //             l = mid + 1;
        //         }
        //     }

        //     st.pupd(0, 20);
        //     debug(st.query(0, 2 * n + 2).mnpref);
        // }
    }

    cout << ans << endl;

    // if (l == -1) {
    //     cout << ans << endl;
    //     return;
    // }

    // while (l <= r) {
    //     ll mid = (l + r) / 2;
    //     if (check(mid)) {
    //         amin(ans, mid);
    //         r = mid - 1;
    //     }
    //     else {
    //         l = mid + 1;
    //     }
    // }

    // cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

FuelStation.cpp: In function 'void solve(int)':
FuelStation.cpp:189:10: warning: variable 'check' set but not used [-Wunused-but-set-variable]
  189 |     auto check = [&](ll f) {
      |          ^~~~~
FuelStation.cpp:237:8: warning: unused variable 'l' [-Wunused-variable]
  237 |     ll l = -1, r = -1;
      |        ^
FuelStation.cpp:237:16: warning: unused variable 'r' [-Wunused-variable]
  237 |     ll l = -1, r = -1;
      |                ^
FuelStation.cpp: In function 'void usaco(std::string)':
FuelStation.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 51912 KB Output is correct
2 Correct 248 ms 51900 KB Output is correct
3 Correct 250 ms 52040 KB Output is correct
4 Incorrect 248 ms 51896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 1876 KB Output is correct
3 Correct 9 ms 1876 KB Output is correct
4 Correct 8 ms 1876 KB Output is correct
5 Correct 8 ms 1876 KB Output is correct
6 Correct 10 ms 1976 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 8 ms 1972 KB Output is correct
15 Correct 8 ms 1972 KB Output is correct
16 Correct 7 ms 1972 KB Output is correct
17 Correct 8 ms 1972 KB Output is correct
18 Correct 8 ms 1876 KB Output is correct
19 Correct 7 ms 1876 KB Output is correct
20 Correct 8 ms 1876 KB Output is correct
21 Correct 7 ms 1876 KB Output is correct
22 Correct 7 ms 1876 KB Output is correct
23 Correct 7 ms 1876 KB Output is correct
24 Correct 7 ms 1876 KB Output is correct
25 Correct 8 ms 1888 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 1876 KB Output is correct
3 Correct 9 ms 1876 KB Output is correct
4 Correct 8 ms 1876 KB Output is correct
5 Correct 8 ms 1876 KB Output is correct
6 Correct 10 ms 1976 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 8 ms 1972 KB Output is correct
15 Correct 8 ms 1972 KB Output is correct
16 Correct 7 ms 1972 KB Output is correct
17 Correct 8 ms 1972 KB Output is correct
18 Correct 8 ms 1876 KB Output is correct
19 Correct 7 ms 1876 KB Output is correct
20 Correct 8 ms 1876 KB Output is correct
21 Correct 7 ms 1876 KB Output is correct
22 Correct 7 ms 1876 KB Output is correct
23 Correct 7 ms 1876 KB Output is correct
24 Correct 7 ms 1876 KB Output is correct
25 Correct 8 ms 1888 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 256 ms 52048 KB Output is correct
28 Correct 255 ms 52044 KB Output is correct
29 Correct 253 ms 52040 KB Output is correct
30 Correct 248 ms 51932 KB Output is correct
31 Correct 259 ms 51912 KB Output is correct
32 Correct 265 ms 51916 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 251 ms 51936 KB Output is correct
40 Correct 252 ms 51904 KB Output is correct
41 Correct 249 ms 51900 KB Output is correct
42 Correct 257 ms 51916 KB Output is correct
43 Correct 255 ms 51932 KB Output is correct
44 Incorrect 236 ms 51896 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 244 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 8 ms 1876 KB Output is correct
18 Correct 9 ms 1876 KB Output is correct
19 Correct 8 ms 1876 KB Output is correct
20 Correct 8 ms 1876 KB Output is correct
21 Correct 10 ms 1976 KB Output is correct
22 Correct 9 ms 1876 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 8 ms 1972 KB Output is correct
30 Correct 8 ms 1972 KB Output is correct
31 Correct 7 ms 1972 KB Output is correct
32 Correct 8 ms 1972 KB Output is correct
33 Correct 8 ms 1876 KB Output is correct
34 Correct 7 ms 1876 KB Output is correct
35 Correct 8 ms 1876 KB Output is correct
36 Correct 7 ms 1876 KB Output is correct
37 Correct 7 ms 1876 KB Output is correct
38 Correct 7 ms 1876 KB Output is correct
39 Correct 7 ms 1876 KB Output is correct
40 Correct 8 ms 1888 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 9 ms 1876 KB Output is correct
43 Correct 12 ms 1992 KB Output is correct
44 Correct 10 ms 1972 KB Output is correct
45 Correct 10 ms 1876 KB Output is correct
46 Correct 11 ms 1876 KB Output is correct
47 Correct 9 ms 1876 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 9 ms 1988 KB Output is correct
55 Correct 9 ms 1876 KB Output is correct
56 Correct 9 ms 1876 KB Output is correct
57 Correct 8 ms 1876 KB Output is correct
58 Correct 8 ms 1876 KB Output is correct
59 Correct 8 ms 1876 KB Output is correct
60 Correct 8 ms 1976 KB Output is correct
61 Incorrect 8 ms 1976 KB Output isn't correct
62 Halted 0 ms 0 KB -

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 249 ms 51912 KB Output is correct
17 Correct 248 ms 51900 KB Output is correct
18 Correct 250 ms 52040 KB Output is correct
19 Incorrect 248 ms 51896 KB Output isn't correct
20 Halted 0 ms 0 KB -