Submission #242534

#TimeUsernameProblemLanguageResultExecution timeMemory
242534VEGAnnNizin (COCI16_nizin)C++14
100 / 100
68 ms4216 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1000100; int ans = 0, a[N], n; bool ed = 0; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); #ifdef _LOCAL freopen("in.txt","r",stdin); #endif // _LOCAL cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int lf = 0, rt = n - 1; while (!ed){ while (a[lf] != a[rt]){ if (lf + 1 == rt){ ans++; ed = 1; break; } if (a[lf] < a[rt]){ a[lf + 1] += a[lf]; lf++; ans++; } else { a[rt - 1] += a[rt]; rt--; ans++; } } if (lf + 1 >= rt - 1) ed = 1; else { lf++; rt--; } } 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...