oj.uz

Submission #305180

# Submission time Handle Problem Language Result Execution time Memory
305180 2020-09-22T17:02:57 Z MarcoMeijer Split the sequence (APIO14_sequence) C++14
50 / 100
 2000 ms 49016 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;

ll n, k;
vll seq;
ll a[MX], sm[MX];
ll dp[MX][200], dpr[MX][200];

void fillSeq(int i, int j) {
    if(j < 0) return;
    seq.pb(dpr[i][j]+1);
    fillSeq(dpr[i][j], j-1);
}

void program() {
    IN(n,k);
    RE(i,n) IN(a[i]);
    
    sm[0]=0;
    RE(i,n) sm[i+1]=sm[i]+a[i];

    auto get = [](int i, int j) {
        if(j < 0) return 0ll;
        return dp[i][j];
    };
    RE(i,n) RE(j,k) {
        dp[i][j] = -INF;
        REP(I,1,i+1) {
            ll ndp = (sm[i+1]-sm[I])*sm[I] + get(I-1,j-1);
            if(ndp > dp[i][j]) {
                dp [i][j] = ndp;
                dpr[i][j] = I-1;
            }
        }
    }
    OUTL(dp[n-1][k-1]);
    fillSeq(n-1, k-1);
    OUTLS(seq);
}

Subtask #1
11.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 Correct 1 ms 384 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 384 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 384 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 384 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 384 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 384 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 384 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 384 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 384 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 384 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 384 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 512 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 512 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 512 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 512 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 512 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 512 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 512 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 512 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 512 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 1024 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 28 ms 1024 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 1024 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 17 ms 1024 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 21 ms 1024 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 27 ms 1016 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 7 ms 1024 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 5 ms 1024 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 8 ms 1024 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3456 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 3456 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 667 ms 3448 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 10 ms 3456 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 562 ms 3512 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 498 ms 3576 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 683 ms 3576 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 673 ms 3452 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 131 ms 3448 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 267 ms 3448 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 902 ms 31992 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 569 ms 31864 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2092 ms 6148 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 49016 KB Time limit exceeded
2 Halted 0 ms 0 KB -