oj.uz

Submission #142563

# Submission time Handle Problem Language Result Execution time Memory
142563 2019-08-09T16:54:49 Z 12tqian Split the sequence (APIO14_sequence) C++14
0 / 100
 16 ms 6892 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAXN = 1e5 + 5;
const int MAXK = 2e2 + 5;
ll dp[MAXK][MAXN];
ll pre[MAXN];
vector<ll> a;
ll get(int l, int r){return pre[r] - (l == 0? 0: pre[l-1]);}
int bef[MAXK][MAXN];
int main(){
    fast_io();
    int n, k;
    cin >> n >> k;
    k++;
    f0r(i, n){
        int ai;
        cin >> ai;
        a.eb(ai);
        if(i == 0) pre[i] = ai;
        else pre[i] = pre[i-1] + ai;
    }
    ll res = pre[n-1]*pre[n-1];
    f0r(i, n){
        dp[1][i] = get(0, i)*get(0, i);
        bef[1][i] = -1;
    }
    f1r(i, 2, k+1){
        int best = i-2;
        f1r(j,i-1, n){
            while(best+1<j){
                ll v1 = dp[i-1][best] + get(best+1, j)*get(best+1, j);
                ll v2 = dp[i-1][best+1] + get(best+2, j)*get(best + 2, j);
                if(v2<v1){
                    best++;
                }
                else break;
            }
            dp[i][j] = dp[i-1][best] + get(best+1, j)*get(best+1, j);
            bef[i][j] = best;
        }
    }
    res -= dp[k][n-1];
    res/=2;
   // cout << dp[3][4] << endl;
    cout << res << endl;
    vi ans;
    int f = k;
    int s = n-1;
    while(bef[f][s] != -1){
        ans.eb(bef[f][s]);
        s = bef[f][s];
        f--;

    }
    reverse(all(ans));
    for(int x: ans) cout << x+1 << " ";
    cout << endl;

    return 0;
}

Compilation message

sequence.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
sequence.cpp: In function 'void io(std::__cxx11::string)':
sequence.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 6892 KB contestant didn't find the optimal answer: 5054352 < 19795776960
2 Halted 0 ms 0 KB -