oj.uz

Submission #23250

# Submission time Handle Problem Language Result Execution time Memory
23250 2017-05-05T14:49:23 Z Nurlykhan Split the sequence (APIO14_sequence) C++14
0 / 100
 19 ms 9832 KB 
#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
using namespace std;
 
const int N = (int) 100;
const int M = (int) 2e6 + 10;
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const double EPS = (double) 1e-9;
int n, k;
ll dp[N][N][N];
int a[N];
 
int sum(int l, int r) {
    return a[r] - a[l - 1];
}
 
int get_id(int l, int r) {
    int ans = l;
    for (int i = l; i < r; i++) {
        if (sum(l, ans) * 1ll * sum(ans + 1, r) < sum(l, i) * 1ll * sum(i + 1, r))
            ans = i;
    }
    return ans;
}
 
ll calc(int l, int r, int k);
 
ll f(int l, int r, int k, int i) {
    return calc(l, i, k - 1) + sum(l, i) * 1ll * sum(i + 1, r);
}
 
ll f1(int l, int r, int k, int i) {
    return calc(i + 1, r, k - 1) + sum(l, i) * 1ll * sum(i + 1, r);
}
 
int ptr[N], ptr1[N];
 
ll calc(int l, int r, int k) {
    if (l > r) return 0;
    if (k == 0) return 0;
    ll &ans = dp[l][r][k];
    if (ans != -1) 
        return ans;
    ans = 0;
    //ptr[l] = max(ptr[l], l);
    //ptr1[l] = max(ptr1[l], l);
    ptr[l]=ptr1[l]=l;  
    while (ptr[l] + 1 < r && f(l, r, k, ptr[l]) <= f(l, r, k, ptr[l] + 1)) ptr[l]++;
    while (ptr1[l] + 1 < r && f1(l, r, k, ptr1[l]) <= f1(l, r, k, ptr1[l] + 1)) ptr1[l]++;
    ans = max(f(l, r, k, ptr[l]), f1(l, r, k, ptr1[l]));
    return ans;
}
 
void print(int l, int r, int k) {
    if (k == 0) return;
    for (int i = l; i < r; i++) {
        for (int t = 0; t <= 0; t++) {
            if (calc(l, r, k) == calc(l, i, t) + calc(i + 1, r, k - 1 - t) + sum(l, i) * 1ll * sum(i + 1, r)) {
                cout << i << " ";
                print(l, i, t);
                print(i + 1, r, k - 1 - t);
                return;   
            }
        }
        for (int t = k - 1; t < k; t++) {
            if (calc(l, r, k) == calc(l, i, t) + calc(i + 1, r, k - 1 - t) + sum(l, i) * 1ll * sum(i + 1, r)) {
                cout << i << " ";
                print(l, i, t);
                print(i + 1, r, k - 1 - t);
                return;   
            }
        }
    }
}
 
int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    memset(dp, -1, sizeof(dp));
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] += a[i - 1];
    }
    cout << calc(1, n, k) << endl;
    print(1, n, k);
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 9832 KB contestant didn't find the optimal answer: 107 < 108
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9832 KB contestant found the optimal answer: 1093956 == 1093956
2 Incorrect 0 ms 9832 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 9832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 9832 KB contestant didn't find the optimal answer: 20444022 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 9832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 9832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -