Submission #1197593

#TimeUsernameProblemLanguageResultExecution timeMemory
1197593veehjBikeparking (EGOI24_bikeparking)C++20
25 / 100
91 ms5116 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define fi first #define se second #define pb push_back #define sz(a) (ll) a.size() #define all(x) (x).begin(), (x).end() #define rep(i, a, b) for(ll i=a; i<b; i++) #define rrep(i, a, b) for(ll i=a; i>=b; i--) #define vl vector<ll> #define vpll vector<pair<ll, ll>> #define vvl vector<vector<ll>> #define pll pair<ll, ll> ll n; vl x, y; void f() { cin >> n; x.resize(n); y.resize(n); for(auto& u : x) cin >> u; for(auto& u : y) cin >> u; ll nxt=0, wait=0, curr=0, give, ans=0, took=0; for(auto& u : y) nxt+=u; rep(i, 0, n){ if(nxt+wait==0) break; curr=y[i]; give=min(curr, took); took-=give; curr-=give; nxt-=curr; give=min(nxt, x[i]); ans+=give; x[i]-=give; nxt-=give; took+=give; give=min(curr, x[i]); curr-=give; x[i]-=give; wait+=curr; give=min(wait, x[i]); wait-=give; x[i]-=give; ans-=give; } cout << ans; } int main() { int tc = 1; // cin >> tc; for (int i = 1; i <= tc; i++) { // cout << '#' << i << endl; f(); cout << endl; } }
#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...