Submission #936618

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936618	2024-03-02T11:54:22 Z	Mher777	Split the sequence (APIO14_sequence)	C++17	0 / 100	40 ms	131072 KB

sequence

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005, M = 205;
ll a[N], pref[N];
pair<ll, int> dp[N][M];

void slv() {
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }
    dp[n - 1][1] = { a[n - 1] * a[n], 1 };
    int kx;
    for (int i = n - 2; i >= 1; --i) {
        kx = min(k, (n - i));
        for (int j = 1; j <= kx; ++j) {
            dp[i][j].ss = dp[i + 1][j].ss + 1;
            dp[i][j].ff = (pref[i + dp[i + 1][j].ss] - pref[i - 1]) * (pref[n] - pref[i + dp[i + 1][j].ss]);
            dp[i][j].ff += dp[i + dp[i][j].ss][j - 1].ff;
            pair<ll, int> opt = { a[i] * (pref[n] - pref[i]) + dp[i + 1][j - 1].ff, 1};
            if (opt.ff >= dp[i][j].ff) dp[i][j] = opt;
        }
    }
    cout << dp[1][k].ff << '\n';
    int cur = dp[1][k].ss;
    kx = k - 1;
    vi ans = { cur };
    while (ans.size() != k) {
        cur = ans.back() + 1;
        cur = cur + dp[cur][kx].ss - 1;
        ans.pub(cur);
        --kx;
    }
    for (auto elem : ans) cout << elem << " ";
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

sequence.cpp: In function 'll range_sum(ll, ll)':
sequence.cpp:94:21: warning: unused variable 'cnt' [-Wunused-variable]
   94 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
sequence.cpp: In function 'll bin_to_dec(std::string)':
sequence.cpp:117:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
sequence.cpp: In function 'void slv()':
sequence.cpp:200:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  200 |     while (ans.size() != k) {
      |            ~~~~~~~~~~~^~~~

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	contestant found the optimal answer: 108 == 108
2	Incorrect	1 ms	2392 KB	contestant didn't find the optimal answer: 774 < 999
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4700 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	1 ms	4700 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	1 ms	4700 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Incorrect	1 ms	4700 KB	contestant didn't find the optimal answer: 117554464392 < 1499437552673
5	Halted	0 ms	0 KB	-