Submission #511430

#TimeUsernameProblemLanguageResultExecution timeMemory
511430MulhamadlahNizin (COCI16_nizin)C++14
10 / 100
124 ms7916 KiB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll n;
ll a[1000009];
int main()
{
    cin>>n;
    for(ll i=0;i<n;i++)
        cin>>a[i];
    ll i=0,j=n-1,ans=0;
    while(abs(i-j)>1)
    {
        if(a[i]!=a[j])
        {
            if(a[i+1]+a[i]==a[j])
                {a[i+1]+=a[i];
                ans++;}
            else if(a[i]==a[j-1]+a[j])
                {a[j-1]+=a[j];
                ans++;}
            else
            {
                a[i+1]+=a[i];
                a[j-1]+=a[j];
                ans+=2;
            }

        }
i++;
j--;

    }
    if(n%2==0)
    {
        if(a[(n+1)/2]!=a[(n+1)/2+1])
            ans++;
    }
    cout<<ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...