Submission #305164

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
305164	2020-09-22T16:43:19 Z	MarcoMeijer	Split the sequence (APIO14_sequence)	C++14	0 / 100	2000 ms	1152 KB

sequence

#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 1e9
#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 = 5e5;

ll n, k;
ll a[MX];
ll s[MX];

void program() {
    IN(n,k);
    RE(i,n) IN(a[i]);
    
    ll ans = 0;
    vll seq;
    RE(_,k) {
        ll best = 0, x=-1;
        RE(i,n) {
            ll left=0, right=0;
            int j = i-1;
            while(j>=0 && !s[j+1]) {
                left += a[j];
                j--;
            }
            j=i;
            while(j<n && !s[j]) {
                right += a[j];
                j++;
            }
            if(left*right >= best) {
                best = left*right;
                x = i;
            }
        }
        ans += best;
        s[x] = 1;
        seq.pb(x);
    }
    OUTL(ans);
    OUTLS(seq);
}

Subtask #1
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	384 KB	contestant found the optimal answer: 108 == 108
2	Incorrect	384 KB	contestant didn't find the optimal answer: 951 < 999
3	Halted	0 KB	-

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	1 ms	384 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	1 ms	384 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Correct	1 ms	384 KB	contestant found the optimal answer: 1499437552673 == 1499437552673
5	Correct	1 ms	384 KB	contestant found the optimal answer: 1019625819 == 1019625819
6	Incorrect	1 ms	384 KB	position 199 occurs twice in split scheme
7	Halted	0 ms	0 KB	-