Submission #503819

#TimeUsernameProblemLanguageResultExecution timeMemory
503819colossal_pepePinball (JOI14_pinball)C++17
51 / 100
3 ms460 KiB
#include <iostream> #include <map> #include <tuple> using namespace std; typedef long long ll; const ll INF = 1e18; int n, m, a[1005], b[1005], c[1005]; ll d[1005], dpl[1005], dpr[1005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; } for (int i = 0; i < n; i++) { dpl[i] = dpr[i] = INF; if (a[i] == 1) dpl[i] = 0; if (b[i] == m) dpr[i] = 0; for (int j = 0; j < i; j++) { if (a[i] <= c[j] and c[j] <= b[i]) { dpl[i] = min(dpl[i], dpl[j] + d[j]); dpr[i] = min(dpr[i], dpr[j] + d[j]); } } } ll ans = INF; for (int i = 0; i < n; i++) { ans = min(ans, dpl[i] + dpr[i] + d[i]); } cout << (ans >= INF ? -1 : ans) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...