Submission #1214460

#TimeUsernameProblemLanguageResultExecution timeMemory
1214460VMaksimoski008Fuel Station (NOI20_fuelstation)C++20
26 / 100
934 ms7240 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()); ll ans = 1e9; n++; for(int s=0; s<(1<<n); s++) { // cout << s << endl; ll ok = 1, mn = -1e9, sum = 0; if((s & (1 << (n-1))) == 0) continue; for(int i=1; i<=n; i++) { if(s & (1 << (i - 1))) { mn = max(mn, a[i][0] - sum); sum += a[i][1]; } } for(int i=1; i<=n; i++) { if(s & (1 << (i - 1))) { if(mn > a[i][2]) ok = 0; // cout << i << " "; } } // cout << ": " << mn << " " << ok << endl; if(ok) 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...