Submission #332434

# Submission time Handle Problem Language Result Execution time Memory
332434 2020-12-02T14:37:44 Z vitkishloh228 Split the sequence (APIO14_sequence) C++14
0 / 100
18 ms 1900 KB
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
int32_t main() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> pr(n + 1);
    for (int i = 0; i < n; ++i) pr[i + 1] = pr[i] + a[i];
    int needsum = pr[n] / (k + 1);
    int it = 0;
    int cursum = 0;
    int ans = 0;
    vector<int> ans1;
    for (int i = 0; i < k; ++i) {
        int pos1 = upper_bound(pr.begin(), pr.end(), needsum + cursum) - pr.begin() - 1;
        //cout << pr[pos1] << endl;
        ans += ((pr[pos1] - pr[it]) * (pr[n] - pr[pos1]));
        ans1.push_back(pos1);
        it = pos1 ;
        cursum = pr[pos1];
    }
    cout << ans << '\n';
    for (auto elme : ans1) cout << elme << ' ';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB contestant found the optimal answer: 108 == 108
2 Incorrect 1 ms 364 KB contestant didn't find the optimal answer: 951 < 999
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB position 49 occurs twice in split scheme
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB contestant didn't find the optimal answer: 514120000 < 610590000
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB position 999 occurs twice in split scheme
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 492 KB contestant didn't find the optimal answer: 1712295104 < 1818678304
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1900 KB contestant didn't find the optimal answer: 19795776952 < 19795776960
2 Halted 0 ms 0 KB -