Submission #752546

# Submission time Handle Problem Language Result Execution time Memory
752546 2023-06-03T07:20:16 Z inventiontime Split the sequence (APIO14_sequence) C++17
100 / 100
850 ms 97340 KB
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define endl '\n' //comment for interactive
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define pb push_back
#define re resize
#define ff first
#define ss second

#define all(x) (x).begin(), (x).end()
#define all1(x) (x).begin()+1, (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)

#define print(x) cout << #x << ": " << x << endl << flush

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef vector<vi> vvi;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;

signed pos[100005][205];
int res;

struct line {
    int m, c, id;
    int eval(int x) { return m*x + c; }
};

double isect(line a, line b) {
    assert(b.m != a.m);
    return (double) (a.c - b.c) / (b.m - a.m);
}

void solve() {
    
    int n, k; cin >> n >> k;
    k++;
    vi a(n+1);
    loop1(i, n) cin >> a[i];
    vi pref(n+1);
    loop1(i, n)
        pref[i] = pref[i-1] + a[i];
    
    deque<line> dq[k+1];
    dq[0].pb({0, 0, 0});
    pos[0][0] = 0;
    loop1(i, n) for(int j = k; j >= 1; j--) if(!dq[j-1].empty()) {
        // query
        while(dq[j-1].size() >= 2) {
            line a = dq[j-1][0];
            line b = dq[j-1][1];
            if(a.eval(pref[i]) < b.eval(pref[i]))
                dq[j-1].pop_front();
            else break;
        }
        int ans = dq[j-1].front().eval(pref[i]);
        if(i == n and j == k) res = ans;
        pos[i][j] = dq[j-1].front().id;
        // update
        line nl = {pref[i], ans - pref[i] * pref[i], i};
        while(!dq[j].empty()) {
            if(dq[j].back().m == nl.m)
                dq[j].pop_back();
            else break;
        }
        while(dq[j].size() >= 2) {
            line a = dq[j][dq[j].size()-1];
            line b = dq[j][dq[j].size()-2];
            if(isect(nl, a) <= isect(nl, b))
                dq[j].pop_back();
            else break;
        }
        dq[j].pb(nl);
    }

    cout << res << endl;
    int x = n;
    int l = k;
    while(l > 1) {
        x = pos[x][l];
        l--;
        cout << x << " ";
    }
    cout << endl;

}

signed main() {

    fast_io;

    int t = 1; //cin >> t;
    while(t--)
        solve();

    return 0;

}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 212 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 212 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 212 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 340 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 212 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 340 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 340 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 212 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 212 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 212 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 212 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 340 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 340 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 212 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 340 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 340 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 340 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 340 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 340 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 340 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 340 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 340 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 340 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 468 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 596 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 488 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 596 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 596 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 596 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 468 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 468 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 468 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1108 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 1356 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 1108 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1340 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1364 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1428 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 1620 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 1236 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1236 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 5 ms 8788 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 9044 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 70 ms 10096 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 10 ms 8916 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 51 ms 9832 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 50 ms 9408 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 68 ms 9880 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 49 ms 10132 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 66 ms 9776 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 79 ms 9804 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 49 ms 86004 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 51 ms 86240 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 850 ms 97340 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 57 ms 87648 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 770 ms 95288 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 558 ms 90696 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 648 ms 95988 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 558 ms 94984 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 614 ms 94864 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 718 ms 95324 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845