Submission #1058235

#TimeUsernameProblemLanguageResultExecution timeMemory
1058235kachim2Bikeparking (EGOI24_bikeparking)C++17
16 / 100
1097 ms4956 KiB
#include<bits/stdc++.h> using namespace std; typedef int64_t ll; int main(){ ll n; cin >> n; vector<ll> slots(n); vector<ll> users(n); for(ll i = 0; i < n; i++){ cin >> slots[i]; } for(ll i = 0; i < n; i++){ cin >> users[i]; } ll happy = 0; for(ll i = 0; i < n; i++){ ll x= min(slots[i], users[i]); slots[i]-=x; users[i]-=x; for(int j = i+1; j < n; j++){ ll x= min(slots[i], users[j]); slots[i]-=x; users[j]-=x; happy+=x; } } happy -= accumulate(users.begin(), users.end(), ll(0)); cout << happy; }
#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...