oj.uz

Submission #434284

# Submission time Handle Problem Language Result Execution time Memory
434284 2021-06-20T21:07:48 Z mat_v Split the sequence (APIO14_sequence) C++14
100 / 100
 1999 ms 82608 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


ll maks;

int n,k;
ll niz[100005];
int gde[100001][201];
ll dp[100005];
ll dp2[100005];
ll pref[100005];

ll C(ll x, ll y){
    if(y >= x)return maks;
    return (pref[x] - pref[y]) * (pref[x] - pref[y]);
}
int idx;

void resi(int l, int r, int tl, int tr){
    if(l > r)return;
    int mid = (l + r) / 2;
    int koji = 0;
    ll val = maks;

    ff(j,tl,min(mid - 1,tr)){
        ll sta = dp[j] + C(mid,j);
        if(sta < val){
            val = sta;
            koji = j;
        }
    }
    gde[mid][idx] = koji;
    dp2[mid] = val;
    resi(l,mid-1,tl,koji);
    resi(mid+1,r,koji,tr);
}

int main()
{

    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> n >> k;
    ff(i,1,n){cin >> niz[i]; pref[i] = pref[i - 1] + niz[i];}
    k++;
    maks = 1e9;
    maks *= maks;

    maks++;
    dp[0] = 0;
    ff(i,1,n){
        dp[i] = maks;
        dp2[i] = dp2[i - 1] = maks;
    }
    ff(i,1,k){
        idx = i;
        resi(0,n,0,n);
        ff(j,0,n){
            dp[j] = dp2[j];
            dp2[j] = maks;
        }
    }
    cout << (C(n,0) - dp[n])/2 << "\n";
    int sad = n;
    fb(i,k,1){
        sad = gde[sad][i];
        if(i > 1)cout << sad << " ";
    }
    return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

Compilation message

sequence.cpp: In function 'void resi(int, int, int, int)':
sequence.cpp:6:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
sequence.cpp:44:5: note: in expansion of macro 'ff'
   44 |     ff(j,tl,min(mid - 1,tr)){
      |     ^~
sequence.cpp: In function 'int main()':
sequence.cpp:6:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
sequence.cpp:63:5: note: in expansion of macro 'ff'
   63 |     ff(i,1,n){cin >> niz[i]; pref[i] = pref[i - 1] + niz[i];}
      |     ^~
sequence.cpp:6:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
sequence.cpp:70:5: note: in expansion of macro 'ff'
   70 |     ff(i,1,n){
      |     ^~
sequence.cpp:6:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
sequence.cpp:74:5: note: in expansion of macro 'ff'
   74 |     ff(i,1,k){
      |     ^~
sequence.cpp:6:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
sequence.cpp:77:9: note: in expansion of macro 'ff'
   77 |         ff(j,0,n){
      |         ^~
sequence.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
sequence.cpp:84:5: note: in expansion of macro 'fb'
   84 |     fb(i,k,1){
      |     ^~

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 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 328 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 328 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

# Verdict Execution time Memory 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 332 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 332 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 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 460 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 460 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 460 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 452 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 460 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 460 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 588 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 460 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 456 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 460 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 1100 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 1108 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1096 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1160 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1164 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 11 ms 1172 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1168 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1100 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1100 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8524 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 8524 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 87 ms 8556 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 8652 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 94 ms 8520 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 86 ms 8524 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 80 ms 8552 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 61 ms 8544 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 79 ms 8540 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 101 ms 8540 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 82292 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 77 ms 82244 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1615 ms 82608 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 72 ms 82500 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1999 ms 82296 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1445 ms 82372 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1299 ms 82580 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 998 ms 82500 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1235 ms 82552 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1574 ms 82500 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845