Submission #959802

#	Time	Username	Problem	Language	Result	Execution time	Memory
959802		hariaakas646	Split the sequence (APIO14_sequence)	C++14	50 / 100	2074 ms	24156 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

vector<vll> dp;
vvi opt;
vll vec, pref;

int main() {
    // usaco();
    int n, k;
    scd(n);
    scd(k);
    dp = vector<vll>(k+1, vll(n+1, -1e17));
    opt = vvi(k+1, vi(n+1));
    vec = pref = vll(n+1);
    forr(i, 1, n+1) {
        sclld(vec[i]);
        pref[i] = pref[i-1]+vec[i];
    }

    dp[0][0] = 0;

    forr(i, 1, k+1) {
        forr(j, 1, n+1) {
            frange(k, j) {
                if(dp[i-1][k] + (pref[j] - pref[k]) * (pref[n] - pref[j]) > dp[i][j]) {
                    dp[i][j] = dp[i-1][k] + (pref[j] - pref[k]) * (pref[n] - pref[j]);
                    opt[i][j] = k;
                }
            }
        }
    }

    lli ma = -1e9;
    int id = -1;

    forr(i, 1, n+1) {
        if(dp[k][i] > ma) {
            ma = dp[k][i];
            id = i;
        }
    }

    vi out;

    for(int i=k; i>=1; i--) {
        out.pb(id);
        id = opt[i][id];
    }
    printf("%lld\n", ma);
    reverse(all(out));
    for(auto e : out) printf("%d ", e);



}

Compilation message (stderr)

sequence.cpp: In function 'void usaco()':
sequence.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
sequence.cpp:41:5: note: in expansion of macro 'scd'
   41 |     scd(n);
      |     ^~~
sequence.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
sequence.cpp:42:5: note: in expansion of macro 'scd'
   42 |     scd(k);
      |     ^~~
sequence.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
sequence.cpp:47:9: note: in expansion of macro 'sclld'
   47 |         sclld(vec[i]);
      |         ^~~~~

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