oj.uz

Submission #1048163

# Submission time Handle Problem Language Result Execution time Memory
1048163 2024-08-08T03:28:03 Z 12345678 Nizin (COCI16_nizin) C++17
100 / 100
 37 ms 10320 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;

#define ll long long

ll n, a[nx], l, r, cnt;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];
    l=1, r=n;
    while (l<r)
    {
        if (a[l]==a[r]) l++, r--;
        else if (a[l]<a[r]) a[l+1]+=a[l], cnt++, l++;
        else a[r-1]+=a[r], cnt++, r--;
    }
    cout<<cnt;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Correct 4 ms 2908 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5208 KB Output is correct
2 Correct 13 ms 5372 KB Output is correct
3 Correct 16 ms 5720 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 8284 KB Output is correct
2 Correct 24 ms 8280 KB Output is correct
3 Correct 28 ms 9108 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 10104 KB Output is correct
2 Correct 37 ms 10068 KB Output is correct
3 Correct 31 ms 10320 KB Output is correct