Submission #265536

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
265536	2020-08-15T00:15:41 Z	tko919	Split the sequence (APIO14_sequence)	C++17	22 / 100	12 ms	2048 KB

sequence

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

ll dp[201][1010]={},pre[1010][201];

int main(){
   int n,k; cin>>n>>k;
   if(n>1000)return 0;
   vector<ll> a(n),rui(n+1);
   rep(i,0,n){
      cin>>a[i]; rui[i+1]=a[i];
   }
   rep(i,0,n)rui[i+1]+=rui[i];
   rep(i,0,n+1)rep(j,0,k+1)dp[i][j]=-INF;
   dp[0][0]=0;
   rep(i,1,k+1)rep(j,1,n)rep(i2,0,j){
      ll add=(rui[j]-rui[i2])*(rui[n]-rui[j]);
      if(chmax(dp[i][j],dp[i-1][i2]+add))pre[i][j]=i2;
   }
   ll res=0; int pos=-1;
   rep(i,0,n)if(chmax(res,dp[k][i]))pos=i;
   cout<<res<<endl;
   int cur=k; vector<int> ps;
   while(cur){
      ps.push_back(pos);
      pos=pre[cur][pos]; cur--;
   }
   reverse(ALL(ps));
   rep(i,0,k)cout<<ps[i]<<endl;
   return 0;
}

Subtask #1
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	384 KB	contestant found the optimal answer: 108 == 108
2	Correct	384 KB	contestant found the optimal answer: 999 == 999
3	Incorrect	384 KB	Integer -1 violates the range [1, 1]
4	Halted	0 KB	-

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	640 KB	contestant found the optimal answer: 122453454361 == 122453454361
4	Correct	0 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	640 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	1152 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	1 ms	1152 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	9 ms	1792 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Correct	1 ms	1152 KB	contestant found the optimal answer: 1499437552673 == 1499437552673
5	Correct	11 ms	1664 KB	contestant found the optimal answer: 1019625819 == 1019625819
6	Correct	12 ms	1792 KB	contestant found the optimal answer: 107630884 == 107630884
7	Correct	8 ms	1792 KB	contestant found the optimal answer: 475357671774 == 475357671774
8	Correct	3 ms	1280 KB	contestant found the optimal answer: 193556962 == 193556962
9	Correct	2 ms	1280 KB	contestant found the optimal answer: 482389919803 == 482389919803
10	Correct	4 ms	1408 KB	contestant found the optimal answer: 490686959791 == 490686959791