1154D - Walking Robot - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define int long long
#define inf 1e16
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
void solve()
{
    int n,b,a;
    cin>>n>>b>>a;
    vector<int>s(n);
    for(int i=0;i<n;i++)cin>>s[i];
    int aa=a,bb=b;
    for(int i=0;i<n;i++)
    {
        if(s[i]==1)
        {
            if(aa<a)
            {
                if(bb)bb--,aa++;
                else aa--;
            }
            else
            {
                if(aa)aa--;
                else bb--;
            }
        }
        else
        {
            if(aa)aa--;
            else bb--;
        }
        if(aa<0 || bb<0)
        {
            cout<<i<<endl;
            return;
        }
    }
    cout<<n<<endl;
}
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;//cin>>T;
    while(T--)solve();
    return 0;
}