oj.uz

답안 #396160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
396160 2021-04-29T13:58:07 Z talant117408 수열 (APIO14_sequence) C++17
100 / 100
 1076 ms 81720 KB 
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 1e9+7;
 
ll mode(ll a) {
    a -= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 1e5+7;
ll dp[2][N], a[N], pref[N];
int par[203][N];

struct line {
    ll m, c;
    line(ll _m, ll _c) {
        m = _m; 
        c = _c;
    }
    ll get(ll x) {
        return m * x + c;
    } 
    ll intersect(line other) {
        return (c - other.c) / (other.m - m);
    }
};

int main() {
    do_not_disturb
    
    int n, K;
    cin >> n >> K;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pref[i] = pref[i-1] + a[i];
    }
    
    for (int i = 1; i <= n; i++) {
        dp[0][i] = pref[i]*(pref[n]-pref[i]);
    }
    
    for (int k = 2; k <= K; k++) {
        deque <pair <int, line>> K;
        K.push_front(mp(k-1, line(-pref[k-1], dp[0][k-1])));
        for (int i = k; i <= n; i++) {
            while (sz(K) >= 2 && K.back().second.get(pref[n]-pref[i]) <= K[sz(K)-2].second.get(pref[n]-pref[i])) {
                K.pop_back();
            }
            ll res = K.back().second.get(pref[n]-pref[i])+pref[i]*(pref[n]-pref[i]);
            dp[1][i] = res;
            par[k][i] = K.back().first;
            if (a[i]) {
                line cur = line(-pref[i], dp[0][i]);
                while (sz(K) >= 2 && (cur.intersect(K[0].second) >= K[0].second.intersect(K[1].second))) {
                    K.pop_front();
                }
                K.push_front(mp(i, cur));
            }
        }
        for (int i = 1; i <= n; i++) {
            dp[0][i] = dp[1][i];
        }
    }
    
    ll mx = -1;
    int ind = 0;
    for (int i = 1; i <= n; i++) {
        if (dp[0][i] > mx) {
            mx = dp[0][i];
            ind = i;
        }
    }
    
    printf("%lld\n", mx);
    vector <int> v;
    for (int i = 0; i < K; i++) {
        v.pb(ind);
        ind = par[K - i][ind];
    }
    reverse(all(v));
    for (auto to : v) printf("%d ", to);
    
    return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 844 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 912 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 110 ms 9320 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 776 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 62 ms 5900 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 70 ms 6724 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 91 ms 7228 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 66 ms 5956 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 74 ms 6924 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 95 ms 8532 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4848 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 5256 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1076 ms 81512 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 21 ms 5964 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1052 ms 81720 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 755 ms 58252 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 927 ms 62308 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 698 ms 51220 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 746 ms 58272 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 959 ms 74004 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845