oj.uz

답안 #918669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918669 2024-01-30T08:36:08 Z Boycl07 수열 (APIO14_sequence) C++17
100 / 100
 592 ms 84056 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, n) for(int i = 1; i <= n; ++i)
#define forn(i, l, r) for(int i = l; i <= r; ++i)
#define ford(i, r, l) for(int i = r; i >= l; --i)
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "split"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)

template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}


const int N = 1e5 + 4;
const int M = 3e5 + 3;
const int INF = 1e9 + 3;
const ll LINF = 1e18;
const int A = 26 + 2;
const int K = 200 + 3;

int n, k;

int a[N];

int sum[N];

ll dp[N][2];

int opt[N][K];

int j = 0;

int f = 0;

double slope(pll x, pll y)
{
    return double (1) * (y.se - x.se) / (x.fi - y.fi);
}

ll get(pll line, ll x) {return line.fi * x + line.se;}

pll line[N];
deque<int> cht;
bool bad(pll x, pll y, pll z)
{
    if(z.fi == y.fi) return z.se >= y.se;
    return slope(x, y) >= slope(y, z);
}

void solve()
{
    cin >> n >> k;
    rep(i, n) cin >> a[i], sum[i] = sum[i - 1] + a[i];
    dp[0][0] = 0;
    rep(i, n) dp[i][0] = -LINF;

    rep(_, k + 1)
    {
        f ^= 1;
        ++j;
        forn(i, 0, n) dp[i][f] = -LINF;
        while(sz(cht)) cht.pop_back();
        rep(i, n)
            line[i] = {sum[i - 1], dp[i - 1][f ^ 1] - 1ll * sum[i - 1] * sum[i - 1]};

        rep(i, n )
        {
            while(sz(cht) >= 2 && bad(line[cht[sz(cht) - 2]], line[cht.back()], line[i]))
                cht.pop_back();
            cht.push_back(i);
            while(sz(cht) >= 2 && get(line[cht[0]], sum[i]) <= get(line[cht[1]], sum[i]))
                cht.pop_front();
            maximize(dp[i][f], get(line[cht[0]], sum[i]));
            opt[i][j] = cht[0];
        }
    }
    cout << dp[n][f] << endl;
    int x = n;
    ford(i, k, 1)
    {
        x = opt[x][i + 1] - 1;
        cout << x << " ";
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int TC = 1;

    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }


    while(TC--)
    {
        solve();
        cout << endl;
    }

    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:112:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 2396 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 2396 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 2396 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 2392 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 2392 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 2392 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 2396 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 2396 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 2396 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 2396 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 2396 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 2392 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 2396 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 2396 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 2396 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 2396 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2396 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 2396 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 2396 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 2396 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 2396 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 2396 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 2396 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 2396 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2652 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 2652 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2648 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 2648 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 2652 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 2652 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2648 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2652 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 2652 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5208 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 5212 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 5212 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 5208 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 5212 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 5 ms 5212 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 7 ms 5276 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 5212 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 5212 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 5212 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 11612 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 11612 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 46 ms 11632 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 11608 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 36 ms 11612 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 39 ms 11612 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 47 ms 11612 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 33 ms 11700 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 40 ms 11864 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 46 ms 11612 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 83804 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 34 ms 83784 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 484 ms 83792 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 35 ms 83832 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 592 ms 83804 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 432 ms 83968 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 485 ms 84020 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 339 ms 84056 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 374 ms 83996 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 456 ms 84008 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845