# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1232796 | coco2311 | Bikeparking (EGOI24_bikeparking) | C++17 | 2 ms | 324 KiB |
#include <iostream>
#include <queue>
using namespace std;
#define f first
#define s second
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
freopen("input.in","r",stdin);
int N;cin>>N;
int remSlots[N],nbP[N];
for(int i=0;i<N;i++){
cin>>remSlots[i];
}
for(int i=0;i<N;i++){
cin>>nbP[i];
}
int it=0; //iterator over slots;
int vote=0;
for(int i=0;i<N;i++){ //for each group of people
//it=min(it,(i-1));
while(it<i && nbP[i]>0){
if(remSlots[it]==0){
it++;
continue;
}
if(remSlots[it]<nbP[i]){
vote+=remSlots[it];
nbP[i]-=remSlots[it];
remSlots[it]=0;
it++;
}
else{
vote+=nbP[i];
remSlots[it]-=nbP[i];
nbP[i]=0;
}
}
}
cout << vote << endl;
it=0;
for(int i=0;i<N;i++){
if(remSlots[i]<nbP[i]){
nbP[i]-=remSlots[i];
remSlots[i]=0;
vote-=nbP[i];
}
else{
remSlots[i]-=nbP[i];
nbP[i]=0;
}
}
cout<<vote;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |