Submission #482103

#	Time	Username	Problem	Language	Result	Execution time	Memory
482103		dxz05	Split the sequence (APIO14_sequence)	C++14	0 / 100	8 ms	1996 KiB

sequence

#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 222;

int a[N];
ll dp[M][M][M];
ll pref[N];

ll sum(int l, int r){
    return pref[r] - pref[l - 1];
}

pair<ll, int> cost(int l, int r){
    ll res = 0;
    int ind = 0;
    for (int i = l; i < r; i++){
        ll cur = sum(l, i) * sum(i + 1, r);
        if (cur > res){
            res = cur;
            ind = i;
        }
    }
    return MP(res, ind);
}

void solve(int TC) {
    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }

    ll ans = 0;

    priority_queue<pair<pair<ll, int>, pair<int, int>>> pq;
    pq.push(MP(cost(1, n), MP(1, n)));

    vector<int> ind;

    while (k--){
        auto top = pq.top();
        ll cur = top.first.first;
        int m = top.first.second;
        int l = top.second.first, r = top.second.second;

        ans += cur;
        ind.push_back(m);

        debug(cur, m, l, r);
        pq.pop();

        if (l < m) pq.push(MP(cost(l, m), MP(l, m)));
        if (m + 1 < r) pq.push(MP(cost(m + 1, r), MP(m + 1, r)));
    }

    cout << ans << endl;
    for (int i : ind) cout << i << ' ';

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'void solve(int)':
sequence.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
sequence.cpp:89:9: note: in expansion of macro 'debug'
   89 |         debug(cur, m, l, r);
      |         ^~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29