oj.uz

Submission #469235

# Submission time Handle Problem Language Result Execution time Memory
469235 2021-08-31T08:16:05 Z amirmohammad_nezami Split the sequence (APIO14_sequence) C++14
100 / 100
 1586 ms 82188 KB 
#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define PB push_back
#define ll long long
#define _sz(e) e.size()
#define pii pair <int , int>
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#pragma GCC target("sse4,avx,avx2")
#pragma GCC optimize("O3,unroll-loops")

const ll maxn = 1e5 + 8 , N = 200 + 8 , mod = 1e9 + 7 , INF = 1e18;

int n , k , par[N][maxn];
ll dp[2][maxn] , ps[maxn] , a[maxn];

void get(int l , int r , int ql , int qr , int K) {
    if(r - l < 1 || qr - ql < 1) return ;

    bool b = (K & 1); 
    int mid = (l + r) / 2;
    dp[b][mid] = INF;
    for (int i = ql; i < min(qr , mid); ++i) {
        ll val = dp[b ^ 1][i] + (ps[mid + 1] - ps[i + 1]) * (ps[mid + 1] - ps[i + 1]);
        if(val < dp[b][mid]) {
            par[K][mid] = i , dp[b][mid] = val;
        }
    }   
    get(l , mid , ql , par[K][mid] + 1 , K);
    get(mid + 1 , r , par[K][mid] , qr , K);
}

int main() {
    FAST;
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        ps[i + 1] = ps[i] + a[i];
        dp[1][i] = ps[i + 1] * ps[i + 1]; 
        par[1][i] = -1;
    }

    for (int i = 2; i <= k + 1; ++i) {
        get(0 , n , 0 , n , i);
    }

    int b = (k + 1) & 1;
    cout << ((ps[n] * ps[n]) - dp[b][n - 1]) / 2 << '\n';

    int c_id = n - 1 , c_k = k + 1;
    while(c_k > 0 && par[c_k][c_id] != -1) {
        cout << par[c_k][c_id] + 1 << ' ';
        c_id = par[c_k][c_id];
        c_k--;
    }
    cout << '\n';
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 332 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 332 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 332 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 332 KB contestant found the optimal answer: 1 == 1
8 Correct 0 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 0 ms 332 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 332 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 332 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 332 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 332 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 332 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 332 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 332 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 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 0 ms 332 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 332 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 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 1100 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 1228 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 588 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 460 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 588 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory 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 7 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 10 ms 2020 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 1672 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 9 ms 1996 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1996 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 716 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 972 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 716 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 716 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 72 ms 9296 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 716 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 82 ms 5912 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 81 ms 6724 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 70 ms 7240 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 50 ms 5956 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 72 ms 6724 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 90 ms 8480 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 4916 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 4916 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 795 ms 82180 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 25 ms 4932 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1586 ms 82188 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 948 ms 58748 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 773 ms 63176 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 577 ms 51908 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 747 ms 58948 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 967 ms 74644 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845