Submission #511429

#TimeUsernameProblemLanguageResultExecution timeMemory
511429MulhamadlahNizin (COCI16_nizin)C++14
10 / 100
134 ms8732 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(i<j) { 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--; }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...