Submission #1214454

#TimeUsernameProblemLanguageResultExecution timeMemory
1214454VMaksimoski008Fuel Station (NOI20_fuelstation)C++20
24 / 100
3094 ms7440 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); for(int i=1; i<=n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2]; a.push_back({ m, 0, m }); sort(a.begin()+1, a.end()); int ans = 1e9; n++; for(int d=m; d>=0; d--) { ll curr = d; int ok = 1; for(int i=1; i<=n; i++) { if(a[i][0] - a[i-1][0] <= curr) { curr -= (a[i][0] - a[i-1][0]); if(a[i][2] >= d) curr += a[i][1]; } else ok = 0; } if(ok) ans = d; } 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...