Submission #510046

#TimeUsernameProblemLanguageResultExecution timeMemory
510046NeroZeinNizin (COCI16_nizin)C++14
100 / 100
66 ms6256 KiB
#include <bits/stdc++.h> #define endl "\n" #define sz = s.size() using ll = long long; const int Z = 1e8+9; const int INF = 1e9+9; const int mod = 1e9+7; using namespace std; ll fp (ll x, ll y) { if (y == 0) return 1; if (y == 1) return x; ll ret = fp(x, y/2) % mod; if (y % 2) ret *= x; return ret; } int a[Z]; ll x, n, mn, mx, sum, ans, dif, t, k ; int main() { ios::sync_with_stdio(0); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) cin >> a[i] ; ll l = 0, r = n - 1 ; while (l != r){ if (l == r - 1 && a[l] == a[r]) break ; if (a[l] == a[r]){ l++; r--; } else{ if (a[l] < a[r]){ a[l+1] += a[l] ; l++ ; ans++ ; } else{ a[r-1] += a[r] ; r-- ; ans++ ; } } } ///for (int i = 0 ; i < n; i++) cout << a[i] << " " ; cout << ans << endl; 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...