Submission #1053020

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053020		Ludissey	Bikeparking (EGOI24_bikeparking)	C++17	44 / 100	37 ms	8612 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()

using namespace std;
int N,M,Q;
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N;
    vector<int> x(N),y(N);
    vector<int> kp(N);
    for (int i = 0; i < N; i++) cin >> x[i];
    for (int i = 0; i < N; i++) cin >> y[i];
    
    int j=0;
    int sm=0;
    for (int i = 0; i < N; i++)
    {
        while(j<N&&j<i&&y[i]>0 ) {
            if(y[j]>0) { j++; continue; }
            int df=min(x[j],y[i]);
            x[j]-=df;
            y[i]-=df;
            sm+=df;
            if(x[j]==0) j++;
        }
    } 
    j=0;
    for (int i = 0; i < N; i++)
    {
        while(j<i&&y[i]>0 ) {
            int df=min(x[j],y[i]);
            x[j]-=df;
            y[i]-=df;
            sm+=df;
            if(x[j]==0) j++;
        }
        kp[i]+=y[i];
    }   
    for (int i = 0; i < N; i++){
        int df=min(x[i],kp[i]);
        x[i]-=df;
        kp[i]-=df;
        sm-=kp[i];
    }
    cout << sm << "\n";
    return 0;
}

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