oj.uz

Submission #1098748

# Submission time Handle Problem Language Result Execution time Memory
1098748 2024-10-09T20:15:10 Z Turkhuu Bigger segments (IZhO19_segments) C++17
0 / 100
 0 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &i : a) {
        cin >> i;
    }
    vector<pair<int, ll>> dp(n + 1, {0, 0});
    for (int i = 0; i < n; i++) {
        ll sum = 0;
        for (int j = i; j >= 0; j--) {
            sum += a[j];
            auto [x, y] = dp[j];
            if (-y <= sum) {
                dp[i + 1] = {x + 1, -sum};
                break;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        if (dp[i - 1].first == dp[i].first) {
            assert(dp[i - 1].second <= dp[i].second);
        }
    }
    cout << dp[n].first;
    return 6/22;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -