oj.uz

Submission #111339

# Submission time Handle Problem Language Result Execution time Memory
111339 2019-05-14T20:35:45 Z aleksami Split the sequence (APIO14_sequence) C++14
100 / 100
 998 ms 81700 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define MAXN 100005
#define MAXK 205
const ll INF = 1e18;
//ll dp[MAXK][MAXN];
ll dp[2][MAXN];
ll a[MAXN];
int opt[MAXK][MAXN];
deque <int> q;//deque <line> q;
//struct line {ll n;ll k;int id;};
double presekx(int x,int y,int k)
{
  if(a[x]==a[y])return INF;
  return 1.00*((dp[k%2][x]-a[x]*a[x])-(dp[k%2][y]-a[y]*a[y]))/(a[y]-a[x]);
  //if(a.k==b.k)return INF;
  //return 1.00*(a.n-b.n)/(b.k-a.k);
}

int next_front()//line next_front()
{
  int a = q.front();//line a = q.front();
  q.pop_front();
  int b = q.front();//line b = q.front();
  q.push_front(a);
  return b;
}
int prev_back()//line prev_back()
{
  int a = q.back();//line a = q.back();
  q.pop_back();
  int b = q.back();//line b = q.back();
  q.push_back(a);
  return b;
}
ll eval(int l,int k,ll x)
{
  return (a[l])*x+(dp[k%2][l]-a[l]*a[l]);//return l.k*x+l.n;
}

int main()
{
  ios_base::sync_with_stdio(false);
  int n,k;
  cin >> n >> k;
  for(int i = 1; i <= n; i++)cin >> a[i],a[i]+=a[i-1];
  for(int i = 1; i <= k; i++)
  {
    q.clear();
    for(int j = i; j <= n; j++)
    {
      while(1)
      {
        if(q.size()<=1)break;
        if(eval(q.front(),i-1,a[j])<=eval(next_front(),i-1,a[j])){q.pop_front();continue;}
        break;
      }
      if(q.size())
      {
        dp[i%2][j]=eval(q.front(),i-1,a[j]);
        opt[i][j]=q.front();//opt[i][j]=q.front().id;
      }
      int add;//line add;
      //add.k=a[j];
      //add.n=-a[j]*a[j]+dp[i-1][j];
      add=j;//add.id=j;
      while(1)
      {
        if(q.size()<=1)break;
        if(a[q.back()]==a[add]){q.pop_back();continue;}//if(q.back().k==add.k){q.pop_back();continue;}
        if(a[q.back()]==a[prev_back()]){q.pop_back();continue;}//if(q.back().k==prev_back().k){q.pop_back();continue;}
        if(presekx(prev_back(),q.back(),i-1)>=presekx(q.back(),add,i-1)){q.pop_back();continue;}//if(presekx(prev_back(),q.back())>=presekx(q.back(),add)){q.pop_back();continue;}
        break;
      }
      q.push_back(add);
    }
  }
  cout << dp[k%2][n] << "\n";
  int now = n;
  while(k > 0)
  {
    cout << opt[k][now] << " ";
    now=opt[k][now];
    k--;
  }
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 384 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 384 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 512 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 384 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 384 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 384 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 384 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 3 ms 384 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 3 ms 384 KB contestant found the optimal answer: 140072 == 140072
14 Correct 3 ms 384 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 3 ms 384 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 384 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 3 ms 384 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 384 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 13 ms 2048 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 384 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 15 ms 2048 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 14 ms 1792 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 12 ms 2096 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 10 ms 2048 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 768 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1052 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 816 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 84 ms 9336 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 768 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 59 ms 5880 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 80 ms 6712 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 7060 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 60 ms 5980 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 92 ms 6776 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 86 ms 8440 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4096 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 22 ms 4088 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 895 ms 81700 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 27 ms 4736 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 998 ms 81668 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 674 ms 57976 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 775 ms 62168 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 616 ms 51068 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 717 ms 58216 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 806 ms 73868 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845