oj.uz

Submission #41651

# Submission time Handle Problem Language Result Execution time Memory
41651 2018-02-20T05:16:40 Z funcsr Split the sequence (APIO14_sequence) C++14
100 / 100
 1902 ms 83308 KB 
#pragma GCC optimize ("-O2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cassert>
#include <map>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
//#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define index(xs, xe, y) (int)(lower_bound(xs, xe, y) - xs)
#define _1 first
#define _2 second
#define pb push_back
#define MOD 1000000007
#define INF (1LL<<60)
typedef pair<long long, long long> P;
inline P rel(long long p, long long q) {
  if (q < 0) p = -p, q = -q;
  return P(p, q);
}
inline P x_intersect(const P &a, const P &b) { return rel(b._2-a._2, a._1-b._1); }
inline bool ord(const P &a, const P &b) {
  // ap/aq < bp/bq
  //return (__int128)a._1*b._2 < (__int128)a._2*b._1;
  return a._1*b._2 < a._2*b._1;
}

pair<P, int> ps[100001];
struct ConvexHullTrick {
  int sz = 0, h = 0;
  void add(long long x, long long y, int attr) {
    if (sz && ps[sz-1]._1._1 == x) {
      if (ps[sz-1]._1._2 < y) return;
      sz--;
    }
    P c = P(x, y);
    while (sz >= 2) {
      P a = ps[sz-2]._1, b = ps[sz-1]._1;
      P p = x_intersect(a, c);
      if (ord(x_intersect(b, c), p) && ord(p, x_intersect(a, b))) break;
      sz--;
    }
    //h = max(0, min(h, (int)ps.size()-1));
    ps[sz++] = make_pair(P(x, y), attr);
  }
  P f(long long a) {
    assert(sz);
    //if (sz == 0) return P(-1, INF);
    while (h+1 < sz) {
      if (ord(P(a, 1), x_intersect(ps[h]._1, ps[h+1]._1))) h++;
      else break;
    }
    return P(ps[h]._2, a*ps[h]._1._1+ps[h]._1._2);
  }
  void clear() {
    h = 0, sz = 0;
  }
};

int N, K;
int B[100001];
int pre[100001][202];
long long dp[100001];
ConvexHullTrick cht;

signed main() {
  cin >> N >> K;
  K++;
  rep(i, N) cin >> B[i+1];
  rep(i, N) B[i+1] += B[i];
  rep(i, N+1) rep(j, K+1) pre[i][j] = -1;
  cht.add(0, 0, 0);
  rep(k, K) {
    rep(i, N+1) dp[i] = INF;
    for (int x=k+1; x<=N; x++) {
      P p = cht.f(-2LL*B[x]);
      dp[x] = 1LL*B[x]*B[x] + p._2;
      pre[x][k+1] = min((int)p._1, x-1);
    }
    cht.clear();
    for (int x=k+1; x<=N; x++) cht.add(B[x], dp[x] + 1LL*B[x]*B[x], x);
  }
  long long m = (1LL*B[N]*B[N]-dp[N])/2LL;
  cout << m << "\n";
  int p = pre[N][K], k = K-1;
  vector<int> seq;
  while (k > 0) {
    seq.pb(p);
    p = pre[p][k];
    k--;
  }
  reverse(all(seq));
  for (int x : seq) cout << x << " "; cout << "\n";
  return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1388 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 1388 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 1388 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 1388 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 7 ms 1388 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 6 ms 1452 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 7 ms 1452 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1452 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1452 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 1452 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8812 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 12 ms 8840 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 95 ms 8896 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 12 ms 8896 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 63 ms 8896 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 79 ms 8896 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 8896 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 60 ms 8980 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 72 ms 8980 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 86 ms 8980 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 82668 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 125 ms 82668 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1876 ms 83308 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 118 ms 83308 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1902 ms 83308 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1204 ms 83308 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1210 ms 83308 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 1033 ms 83308 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1409 ms 83308 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1421 ms 83308 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845