Submission #1058257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058257		Zbyszek99	Bikeparking (EGOI24_bikeparking)	C++17	25 / 100	23 ms	5164 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

void solve()
{
    int n;
    cin >> n;
    vector<ll> a(n);
    vector<ll> b(n);
    ll sum = 0;
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    rep2(i,1,n-1) sum += b[i];
    int p1 = 0;
    int p2 = 0;
    ll ans = 0;
    while(p2 < n)
    {
        ll od = min(a[p1],b[p2]);
        if(p1 < p2) 
        {
            ans += od;
            a[p1] -= od;
            b[p2] -= od;
            if(a[p1] == 0) p1++; 
            else p2++;
        }
        else
        {
            p2++;
        }
        
    }
    p1 = 0;
    p2 = 0;
    while(p2 < n)
    {
        ll od = min(a[p1],b[p2]);
        if(p1 == p2) 
        {
            a[p1] -= od;
            b[p2] -= od;
            if(a[p1] == 0) p1++; 
            else p2++;
        }
        else
        {
            p2++;
        }
    }
    rep(i,n) ans -= b[i];
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

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