Submission #1214462

#TimeUsernameProblemLanguageResultExecution timeMemory
1214462VMaksimoski008Fuel Station (NOI20_fuelstation)C++20
54 / 100
3095 ms8668 KiB
#include <bits/stdc++.h> #define ar array //#define int long long using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const ll inf = 1e18; const int N = 1e5 + 5; signed main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); int n, m; cin >> n >> m; vector<ar<int, 3> > a(n+1); vector<int> ord; for(int i=1; i<=n; i++) { cin >> a[i][0] >> a[i][1] >> a[i][2]; ord.push_back(a[i][2]); } a.push_back({ m, 0, m }); ord.push_back(m); sort(a.begin()+1, a.end()); sort(ord.begin(), ord.end()); ll ans = 1e9; n++; for(int d : ord) { ll sum = 0, mn = -1e9, ok = 1; for(int i=1; i<=n; i++) { if(a[i][2] >= d) { mn = max(mn, a[i][0] - sum); sum += a[i][1]; } } if(d >= mn) ans = min(ans, mn); } cout << ans << '\n'; }
#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...