제출 #64349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64349		qkxwsm	Split the sequence (APIO14_sequence)	C++17	100 / 100	1432 ms	84028 KiB

sequence

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013
#define MAXK 213

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, K;
ll arr[MAXN];
ll pref[MAXN], prodpref[MAXN];
ll dp[2][MAXN];
int opt[MAXK][MAXN];

ll C(int L, int R)
{
        return prodpref[R] - prodpref[L] - (pref[L]) * (pref[R] - pref[L]);
}
void solve(int i, int L, int R, int optl, int optr)
{
        if (L > R) return;
        int mid = (L + R) / 2;
        dp[i % 2][mid] = LLINF;
        for (int j = optl; j <= optr && j < mid; j++)
        {
                if (dp[i % 2][mid] >= dp[(i + 1) % 2][j] + C(j, mid))
                {
                        dp[i % 2][mid] = dp[(i + 1) % 2][j] + C(j, mid);
                        opt[i][mid] = j;
                }
        }
        solve(i, L, mid - 1, optl, opt[i][mid]);
        solve(i, mid + 1, R, opt[i][mid], optr);
        return;
}

int32_t main()
{
	// ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
        readi(N); readi(K);
        K++;
        for (int i = 0; i < N; i++)
        {
                readi(arr[i]);
                pref[i + 1] = pref[i] + arr[i];
                prodpref[i + 1] = prodpref[i] + pref[i] * arr[i];
        }
        for (int j = 0; j <= N; j++)
        {
                dp[0][j] = LLINF;
                dp[1][j] = LLINF;
        }
        dp[0][0] = 0;
        // for (int i = 1; i <= K; i++)
        // {
        //         for (int j = 1; j <= N; j++)
        //         {
        //                 for (int k = 0; k < j; k++)
        //                 {
        //                         ckmin(dp[i][j], dp[i - 1][k] + C(k, j));
        //                 }
        //         }
        //
        for (int i = 1; i <= K; i++)
        {
                solve(i, 1, N, 0, N);
        }
        printi(prodpref[N] - dp[K % 2][N]); putchar('\n');
        int u = opt[K][N]; K--;
        while(u)
        {
                printi(u); if (K) putchar(' ');
                u = opt[K][u];
                K--;
        }
        putchar('\n');
        //the order DOES NOT matter!
		// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'int32_t main()':
sequence.cpp:180:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:181:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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