Submission #1352578

#TimeUsernameProblemLanguageResultExecution timeMemory
1352578nathlol2Fuel Station (NOI20_fuelstation)C++20
0 / 100
3093 ms29328 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3e5 + 5;
int n, d;
tuple<int, int, int> a[N];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> d;
    vector<int> cand = {0};
    for(int i = 1;i<=n;i++){
        auto &[x, b, c] = a[i];
        cin >> x >> b >> c;
        cand.push_back(x);
    }
    sort(a + 1, a + n + 1);
    int ans = d;
    for(auto x : cand){
        vector<tuple<int, int, int>> v;
        v.push_back({0, 0, 0});
        for(int i = 1;i<=n;i++){
            if(get<2>(a[i]) >= x) v.push_back(a[i]);
        }
        v.push_back({d, 0, 0});
        int cur = x, c = x;
        for(int i = 1;i<v.size();i++){
            cur -= (get<0>(v[i]) - get<0>(v[i - 1]));
            if(cur < 0){
                c -= cur;
                cur = 0;
            }
            cur += get<1>(v[i]);
        }
        ans = min(ans, c + x);
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...