oj.uz

Submission #305221

# Submission time Handle Problem Language Result Execution time Memory
305221 2020-09-22T17:57:29 Z MarcoMeijer Split the sequence (APIO14_sequence) C++14
0 / 100
 2000 ms 81912 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 2e5;
 
int n, k;
vi seq;
int a[MX];
ll sm[MX];
ll dpcur[MX], dpprev[MX];
int dpr[MX][201];
 
void fillSeq(int i, int j) {
    if(j < 0) return;
    seq.pb(dpr[i][j]+1);
    fillSeq(dpr[i][j], j-1);
}
void daq(int j, int l, int r, int lopt, int ropt) {
    if(r<l) return;
 
    int m=(l+r)/2;
 
    ll res = -INF;
    int nropt = min(ropt,m-1);
    REP(i,lopt,nropt+1) {
        ll ndp = (sm[m+1]-sm[i])*sm[i] + dpprev[i-1];
        if(ndp > res) {
            res = ndp;
            dpr[m][j] = i-1;
        }
    }
    dpcur[m] = res;
 
    int opt = dpr[m][j]+1;
    daq(j,l,m-1,lopt,opt);
    daq(j,m+1,r,opt,ropt);
}
 
void program() {
    IN(n,k);
    RE(i,n) IN(a[i]);
    
    sm[0]=0;
    RE(i,n) sm[i+1]=sm[i]+a[i];
 
    RE(i,n) dpprev[i] = 0;
    RE(j,k) {
        daq(j,0,n-1,1,n-1);
        RE(i,n) dpprev[i] = dpcur[i];
    }
 
    OUTL(dpcur[n-1]);
    fillSeq(n-1, k-1);
    OUTLS(seq);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 384 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 384 KB declared answer doesn't correspond to the split scheme: declared = -1000000000000000000, real = 0
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB contestant found the optimal answer: 21503404 == 21503404
2 Incorrect 1 ms 1152 KB contestant didn't find the optimal answer: 140403179 < 140412195
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8576 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 8448 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 78 ms 8560 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 8448 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Incorrect 82 ms 8448 KB contestant didn't find the optimal answer: 1085392864 < 1085432199
6 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 81784 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 68 ms 81784 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1667 ms 81912 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 66 ms 81784 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Execution timed out 2029 ms 81912 KB Time limit exceeded
6 Halted 0 ms 0 KB -