제출 #1232474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232474		yixuan19	Bikeparking (EGOI24_bikeparking)	C++20	40 / 100	1098 ms	2628 KiB

Main

//#include <bits/stdc++.h>
#include <iostream>
#include <vector>

using namespace std;
int main(){
    int N, slot, user;
    cin >> N;
    vector<int> slots(N+1,0);
    vector<int> users(N+1,0);
    for (int i = 0; i < N; ++i){
        cin >> slots[i];
    }
    for (int i = 0; i < N; ++i){
        cin >> users[i];
    }
    int sol = 0;
    for (int i = 1; i < N; ++i){
        for (int j = i-1; j >= 0; j--){
            if (users[i] >= slots[j]){
                users[i] -= slots[j];
                sol += slots[j];
                slots[j]= 0;
            }else{
                sol += users[i];
                slots[j] -= users[i];
                users[i] = 0; 
            }
            //cout<<sol<<' '<<users[i]-slots[j]<<endl;
        }
    }
    for (int i = 0; i <N; ++i){
        if (users[i] > 0 && slots[i] > 0){
            if (users[i] >= slots[i]){
                users[i] -= slots[i];
                slots[i]= 0;
            }else{
                slots[i] -= users[i];
                users[i] = 0;
            }
        }
    }
    for (int i = 0; i < N; ++i){
        sol-= users[i];
    }
    cout<<sol<<endl;
}

• Subtask 1: 16 / 16
• Subtask 2: 0 / 9
• Subtask 3: 0 / 19
• Subtask 4: 24 / 24
• Subtask 5: 0 / 32