oj.uz

Submission #510046

# Submission time Handle Problem Language Result Execution time Memory
510046 2022-01-14T15:00:04 Z NeroZein Nizin (COCI16_nizin) C++14
100 / 100
 66 ms 6256 KB 
#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 ;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 588 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 6 ms 684 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1588 KB Output is correct
2 Correct 21 ms 1868 KB Output is correct
3 Correct 25 ms 2188 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3424 KB Output is correct
2 Correct 42 ms 5008 KB Output is correct
3 Correct 49 ms 5552 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 4744 KB Output is correct
2 Correct 52 ms 6256 KB Output is correct
3 Correct 51 ms 6212 KB Output is correct