Submission #959917

# Submission time Handle Problem Language Result Execution time Memory
959917 2024-04-09T10:12:12 Z mannshah1211 Split the sequence (APIO14_sequence) C++17
71 / 100
2000 ms 84912 KB
/**
 *  author: hashman
 *  created: 
**/
 
#include <bits/stdc++.h>
 
using namespace std;
 
string to_string(string s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
   if (!first) {
    res += ", ";
   }
   first = false;
   res += to_string(x);
  }
  res += "}";
  return res;
}
 
void debug_out() {
  cerr << endl;
}
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
 
int64_t inf = 1e17;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<int> p(n + 1);
  for (int i = 1; i <= n; i++) {
    p[i] = p[i - 1] + a[i];
  }
  auto cost = [&](int l, int r) {
    return ((int64_t) (p[r] - p[l - 1]) * (p[r] - p[l - 1]));
  };
  k++;
  vector<int64_t> dp_cur(n + 1, inf), dp_before(n + 1, inf);
  dp_before[0] = 0;
  vector<vector<int>> pr(n + 1, vector<int>(k + 1));
  auto compute = [&](auto&& self, int at, int l, int r, int bl, int br) -> void {
    if (l > r) {
      return;
    }
    int m = (l + r) / 2;
    pair<int64_t, int> best = make_pair(inf, -1);
    for (int i = bl; i <= min(m, br); i++) {
      best = min(best, make_pair(dp_before[i - 1] + cost(i, m), i));
    }
    if (best.second != -1) pr[m][at] = best.second - 1;
    dp_cur[m] = best.first;
    if (best.second != -1) self(self, at, l, m - 1, bl, best.second);
    else self(self, at, l, m - 1, bl, br);
    if (best.second != -1) self(self, at, m + 1, r, best.second, br);
    else self(self, at, m + 1, r, bl, br);
  };
  for (int i = 1; i <= k; i++) {
    compute(compute, i, 1, n, 1, n);
    dp_before = dp_cur;
  }
  cout << ((int64_t) p[n] * p[n] - dp_before[n]) / 2 << '\n';
  int cur = n;
  vector<int> splits;
  while (cur != 0) {
    cur = pr[cur][k];
    k--;
    if (cur != 0) {
      splits.push_back(cur);
    }
  }
  reverse(splits.begin(), splits.end());
  for (int split : splits) {
    cout << split << " ";
  }
  cout << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 344 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 348 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 348 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 348 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 392 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 348 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 348 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 348 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 348 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 348 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 348 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 600 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 348 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 348 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 348 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 344 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 600 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 348 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 348 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 604 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 348 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 348 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 604 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 600 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 348 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 348 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 348 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 348 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 1304 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 348 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 9 ms 1116 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1116 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1116 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 1116 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 604 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 604 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 1116 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 59 ms 8796 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 1116 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 70 ms 5724 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 66 ms 6492 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 58 ms 7004 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 43 ms 5720 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 59 ms 6492 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 75 ms 8028 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 32 ms 8284 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 28 ms 8284 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2077 ms 84912 KB Time limit exceeded
4 Halted 0 ms 0 KB -