oj.uz

Submission #1000728

# Submission time Handle Problem Language Result Execution time Memory
1000728 2024-06-18T07:43:26 Z vjudge1 Split the sequence (APIO14_sequence) C++17
0 / 100
 689 ms 94036 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 1e5 + 30, MOD = 1e9 + 7;
int n,k;
int a[N];
ll pref[N],sf[N];
int p[N][203];
ll dp[N],tdp[N];
struct line{
    ll k,b;
    int pos = 0;
    ll get(ll x){
        return k * x + b;
    }
};

long double cross(line a,line b){
    return ((a.b - b.b) * 1.0 / ((b.k - a.k) * 1.0));
}
void add(vector<line> &st,line l){
    while((int)st.size() > 1 && cross(l,st[(int)st.size() - 2]) <= cross(l,st.back())){
        st.pop_back();
    }
    st.push_back(l);
}
pair<ll,ll> get(vector<line> &st,ll x){
    int l = -1,r = (int)st.size() - 1;
    while(r - l > 1){
        int mid = (l + r) >> 1;
        if(mid == (int)st.size() - 1 || (st[mid].b - st[mid + 1].b) * 1.0 >= x * 1.0 * (st[mid + 1].k - st[mid].k)){
            r = mid;
        }else{
            l = mid;
        }
    }
    return {st[r].get(x),st[r].pos};
}
set<int> St;
void test(){
    cin >> n >> k;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
        St.insert(i);
    }
    for(int i = 1;i <= n;i++){
        pref[i] = pref[i - 1] + a[i];
    }
    for(int i = n;i >= 1;i--){
        sf[i] = sf[i + 1] + a[i];
    }
    for(int i = 1;i <= k;i++){
        vector<line> st;
        add(st,{0,0});
        int it = 1;
        for(int j = 1;j <= n;j++){
            while(it >= 0 && (it == (int)st.size() - 1 || (st[it].b - st[it + 1].b) * 1.0 >= sf[j + 1] * 1.0 * (st[it + 1].k - st[it].k))){
                it--;
            }
            pair<ll,ll> G = {st[it + 1].get(sf[j + 1]),st[it + 1].pos};
            dp[j] = G.first+ pref[j] * sf[j + 1];
            p[j][i] = G.second;
            if(!p[j][i] && i != 1){
                p[j][i] = j - 1;
            }
            line nv = {-pref[j],tdp[j],j};
            add(st,nv);
            it = min(it,(int)st.size() - 1);
            it++;
        }
        for(int j = 1;j <= n;j++){
            tdp[j] = dp[j];
            dp[j] =0 ;
        }
    }
    ll res = 0;
    int ps = 0;
    for(int i = 1;i < n;i++){
        if(tdp[i] >= res){
            res = tdp[i];
            ps = i;
        }
    }
    vector<int> f;
    cout << res << '\n';
    int k1 = k;
    while(ps){
        f.push_back(ps);
        St.erase(ps);
        ps = p[ps][k--];
    }
    for(int i = 1;i <= n - 1;i++){
        if(St.find(i) != St.end()&&(int)f.size() < k1){
            f.push_back(i);
        }
    }
    sort(f.begin(),f.end());
    for(int j:f){
        cout << j << ' ';
    }
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 1542521 < 1542524
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 344 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 0 ms 348 KB contestant didn't find the optimal answer: 1005184804 < 1005304678
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 604 KB contestant didn't find the optimal answer: 411901520 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1368 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 1236 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1372 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 6 ms 1372 KB contestant didn't find the optimal answer: 679388261 < 679388326
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 9572 KB contestant didn't find the optimal answer: 1593574394 < 1818678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 93008 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 68 ms 92956 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Incorrect 689 ms 94036 KB contestant didn't find the optimal answer: 497313449255748709 < 497313449256899208
4 Halted 0 ms 0 KB -