oj.uz

답안 #312619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312619 2020-10-13T21:43:45 Z aZvezda 수열 (APIO14_sequence) C++14
71 / 100
 2000 ms 86424 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 1e5 + 10, MAX_K = 210;
int hist[MAX_N][MAX_K];
ll dp[MAX_N][2];
ll pref[MAX_N], arr[MAX_N];
int cnt, curr;

void output(int n, int k) {
    if(k == 0) {
        return;
    }
    output(hist[n][k], k - 1);
    cout << hist[n][k] << " ";
}

void div(int l, int r, int optl, int optr) {
    if(l > r) {return;}
    int m = (l + r) / 2ll;
    int best = optl;
    for(int tr = optl; tr <= min(m - 1, optr); tr ++) {
        ll now = dp[tr][curr ^ 1] + pref[tr] * (pref[m] - pref[tr]);
        if(chkmax(dp[m][curr], now)) {
            dp[m][curr] = now;
            best = tr;
        }
    }
    hist[m][cnt] = best;
    div(l, m - 1, optl, best);
    div(m + 1, r, best, optr);
}

signed main() {
    //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> arr[i];
        pref[i] = pref[i - 1] + arr[i];
    }

    for(int i = 1; i <= k; i ++) {
        curr = i & 1;
        cnt = i;
        for(int j = 0; j <= n; j ++) {
            dp[j][curr] = -mod;
        }
        div(1, n, 1, n);
    }

    cout << dp[n][k & 1] << endl;
    output(n, k);
    return 0;
}

/*
7 3
4 1 3 4 0 2 3
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8864 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 8960 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 84 ms 8864 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 8960 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 85 ms 8832 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 83 ms 8832 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 82 ms 9068 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 58 ms 8952 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 79 ms 8952 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 99 ms 8832 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 85624 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 92 ms 85880 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1659 ms 86424 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 113 ms 86136 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Execution timed out 2001 ms 86008 KB Time limit exceeded
6 Halted 0 ms 0 KB -