Submission #1207566

#TimeUsernameProblemLanguageResultExecution timeMemory
1207566trimkusBikeparking (EGOI24_bikeparking)C++20
25 / 100
78 ms2632 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < n; ++i) { cin >> b[i]; } int left = 0; int res = 0; for (int i = 0; i < n; ++i) { while (left < i && b[i] > 0) { int take = min(a[left], b[i]); res += take; b[i] -= take; a[left] -= take; if (a[left] == 0) left++; } } for (int i = n - 1; i >= 0; --i) { int take = min(b[i], a[i]); b[i] -= take; res -= b[i]; } cout << res << "\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...