Submission #1073238

#	Time	Username	Problem	Language	Result	Execution time	Memory
1073238		ivaziva	Bikeparking (EGOI24_bikeparking)	C++14	25 / 100	84 ms	5672 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define MAXN 300001

int n;
int x[MAXN],y[MAXN];

int main()
{
    cin>>n;
    for (int i=0;i<n;i++) cin>>x[i];
    for (int i=0;i<n;i++) cin>>y[i];
    int ans=0;
    int pointer=0;
    for (int i=0;i<n;i++)
    {
        while (x[pointer]==0) pointer++;
        if (pointer>=i) continue;
        int val=min(x[pointer],y[i]);
        x[pointer]-=val;y[i]-=val;ans+=val;
    }
    for (int i=0;i<n;i++)
    {
        int val=min(x[i],y[i]);
        x[i]-=val;y[i]-=val;
    }
    for (int i=0;i<n;i++) ans-=y[i];
    cout<<ans<<endl;
}

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