Submission #172181

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
172181	2019-12-31T14:09:33 Z	RafaelSus	Split the sequence (APIO14_sequence)	C++14	11 / 100	2000 ms	131072 KB

sequence

#include <bits/stdc++.h>
 
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
const ll inf=1e15;
#define pb push_back
const int INF=(0x3f3f3f3f);

const int maxn=2e2+5;
ll dp[maxn][maxn][maxn];
pair<int,int> rec[maxn][maxn][maxn];
int a[maxn];
ll pref[maxn];
int n,k;

ll solve(int left,int right,int key){
  if(left==right)return 0ll;
  
  if(dp[left][right][key]!=-1)return dp[left][right][key];
  
  ll sumTotal=pref[right]-pref[left]+a[left];
  ll sumLeft=0ll,sumRight=0ll;
  ll res=0;
  int splitPoint=-1;
  int splitKey=-1;
  for(int i=left;i<right;i++){
    sumLeft+=a[i];
    sumRight=sumTotal-sumLeft;
    for(int j=0;j<key;j++){
      int k2=key-j-1;
      ll splitCost=sumLeft*sumRight;
      ll l=solve(left,i,j);
      ll r=solve(i+1,right,k2);
      ll curRes=l+r+splitCost;
      if(res<curRes){
        res=curRes;
        splitPoint=i;
        splitKey=j;
      }
      //res=max(res,curRes);
    }
  }
  rec[left][right][key]=make_pair(splitPoint,splitKey);
  return dp[left][right][key]=res;
}

vector<int>ans;

void getAnsw(int l,int r,int key){
  if(l==r||key<=0)return;
  ans.pb(rec[l][r][key].first);
  //cerr<<l<<' '<<r<<' '<<key<<' '<<rec[l][r][key].first<<' '<<key<<'\n';
  getAnsw(l,rec[l][r][key].first,rec[l][r][key].second);
  getAnsw(rec[l][r][key].first+1,r,key-rec[l][r][key].second-1);
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);
 
  cin>>n>>k;
  for(int i=1;i<=n;i++){
    cin>>a[i];
    if(i>1)pref[i]=pref[i-1]+a[i];
    else pref[i]=a[i];
  }
  memset(dp,-1,sizeof dp);
  ll answ=solve(1,n,k);

  getAnsw(1,n,k);
  cout<<answ<<'\n';
  for(auto x:ans)
    cout<<x<<' ';
  cout<<'\n';
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	59 ms	67884 KB	contestant found the optimal answer: 108 == 108
2	Correct	60 ms	67960 KB	contestant found the optimal answer: 999 == 999
3	Incorrect	60 ms	67832 KB	Integer -1 violates the range [1, 1]
4	Halted	0 ms	0 KB	-

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	61 ms	69856 KB	contestant found the optimal answer: 1093956 == 1093956
2	Correct	61 ms	69856 KB	contestant found the optimal answer: 302460000 == 302460000
3	Correct	210 ms	69880 KB	contestant found the optimal answer: 122453454361 == 122453454361
4	Correct	61 ms	69880 KB	contestant found the optimal answer: 93663683509 == 93663683509
5	Correct	66 ms	69880 KB	contestant found the optimal answer: 1005304678 == 1005304678
6	Correct	63 ms	69880 KB	contestant found the optimal answer: 933702 == 933702
7	Correct	99 ms	69904 KB	contestant found the optimal answer: 25082842857 == 25082842857
8	Correct	67 ms	69880 KB	contestant found the optimal answer: 687136 == 687136
9	Correct	63 ms	69880 KB	contestant found the optimal answer: 27295930079 == 27295930079
10	Correct	71 ms	70008 KB	contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	113 ms	100216 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	113 ms	100272 KB	contestant found the optimal answer: 311760000 == 311760000
3	Execution timed out	2066 ms	73716 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-