제출 #977159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977159		thegamercoder19	수열 (APIO14_sequence)	C++14	71 / 100	395 ms	131072 KiB

sequence

/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
V<ll> a, pf, res, p;
V<V<ll>> dp;
ll n, k;

struct line
{
    mutable ll k, b, p, i;
    bool operator<(const line& o) const {
        RET k < o.k;
    }
    bool operator<(ll x)const
    {
        RET p < x;
    }
};
struct lineCont : multiset<line, less<>>
{
    ll div(ll a, ll b) { RET a / b - ((a ^ b) < 0 && (a % b)); }
    bool sect(iterator a, iterator b)
    {
        if (b == end()) { a->p = INFL; RET 0; }
        if (a->k == b->k)  a->p = a->b > b->b ? INFL : -INFL;
        else a->p = div(b->b - a->b, a->k - b->k);
        RET a->p >= b->p;
    }
    void add(ll k, ll b, ll id)
    {
        auto z = insert({ k,b,0,id }), y = z++, x = y;
        WH(sect(y, z)) z = erase(z);
        if (x == begin())RET;
        if (sect(--x, y))sect(x, y = erase(y));
        WH((y = x) != begin() && (--x)->p >= y->p) sect(x, erase(y));
    }
    pll query(ll x)
    {
        auto l = *lower_bound(x);
        RET{ l.k * x + l.b, l.i };
    }
};


void solve()
{
    cin >> n >> k;
    a.resize(n + 1); pf.resize(n + 1);
    FOR(ll, i, 1, n + 1, 1)cin >> a[i], pf[i] = pf[i - 1] + a[i];
    dp.resize(n + 1, V<ll>(k + 1));
    lineCont cht;
    //  pf[c] (m) * pf[i] (x) + (dp[c][j-1] - pf[c] * pf[c]) (c)
    FOR(ll, j, 1, k + 1, 1)
        FOR(ll, i, 1, n + 1, 1)
            
    {
            if (i > 1) dp[i][j] = cht.query(pf[i]).first;
            cht.add(pf[i], dp[i][j - 1] - pf[i] * pf[i], i);
    }


    cout << dp[n][k] << endl;
    ll i = n, j = k;
    WH(j)
    {
        FOR(ll,c,1,i,1)
            if (dp[i - c][j - 1] + pf[i - c] * (pf[i] - pf[i - c]) == dp[i][j])
            {

                j--; i -= c;
                res.push_back(i);
                break;
            }
    }
    reverse(all(res));
    FORA(res, x)cout << x << ' ';

}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

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

sequence.cpp: In function 'void init()':
sequence.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:132:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |         freopen("pump.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: 0 / 29