Submission #652400

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

sequence

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu

void solve()
{
    int n, k;
    cin >> n >> k;
    vint a = read(n);
    vint splittingPositions;
    int score = 0;
    prefix_sum pref;
    pref.build(a);
    vector<pair<int, int>> levels[200];
    for(int i = 0; i < 200; i++)
    {
        vector<pair<int, int>> x;
        levels[i] = x;
    }
    levels[0].push_back({0, n-1});
    for(int level = 0; level < 200; level++)
    {
        vector<pair<int, int>> top_scores;
        for(int portion = 0; portion < levels[level].size(); portion++)
        {
            if(levels[level][portion].fr == levels[level][portion].sc)
            {
                continue;
            }
            int splitAtPosition = levels[level][portion].sc;
            for(int i = levels[level][portion].fr; i < levels[level][portion].sc; i++)
            {
                if(pref.get(levels[level][portion].fr, i)*pref.get(i+1, levels[level][portion].sc) >= pref.get(levels[level][portion].fr, splitAtPosition)*pref.get(splitAtPosition+1, levels[level][portion].sc))
                   {
                    splitAtPosition = i;
                }
            }
            top_scores.push_back({pref.get(levels[level][portion].fr, splitAtPosition)*pref.get(splitAtPosition+1, levels[level][portion].sc), splitAtPosition+1});
            levels[level+1].push_back({levels[level][portion].fr, splitAtPosition});
            levels[level+1].push_back({splitAtPosition+1, levels[level][portion].sc});
        }
        sort(top_scores.rbegin(), top_scores.rend());
        for(int i = 0; i < top_scores.size(); i++)
        {
            if(k == 0)
            {
                break;
            }
            score+=top_scores[i].fr;
            splittingPositions.pb(top_scores[i].sc);
            k--;
        }
        if(k == 0)
        {
            break;
        }
    }
    cout << score << endl;
    for(auto x : splittingPositions)
    {
        cout << x << " ";
    }
}
 
int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
 7 3
 4 1 3 4 0 2 3
 */

Compilation message (stderr)

sequence.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
sequence.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
sequence.cpp: In function 'void solve()':
sequence.cpp:41:38: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int portion = 0; portion < levels[level].size(); portion++)
      |                              ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:60:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int i = 0; i < top_scores.size(); i++)
      |                        ~~^~~~~~~~~~~~~~~~~~~

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