oj.uz

Submission #121364

# Submission time Handle Problem Language Result Execution time Memory
121364 2019-06-26T12:50:33 Z IOrtroiii Split the sequence (APIO14_sequence) C++14
100 / 100
 433 ms 85136 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const ll inf = 1e18;

struct Line {
   int a; ll b;
   Line(int a = 0, ll b = 0) : a(a), b(b) {}
   ll f(int x) { return (ll) a * x + b; }
};

bool bad(Line x, Line y, Line z) {
   return (ll) (x.b - z.b) * (y.a - x.a) <= (ll) (z.a - x.a) * (x.b - y.b);
}

const int N = 100100;

struct Hull {
   Line ls[N];
   int go[N];
   int h, t;
   void reset() { h = t = 0; }
   void add(Line z, int id) {
      while (h + 1 < t && bad(ls[t - 2], ls[t - 1], z)) {
         t--;
      }
      ls[t] = z;
      go[t++] = id;
   }
   int trace() {
      return go[h];
   }
   ll get(int x) {
      while (h + 1 < t && ls[h].f(x) <= ls[h + 1].f(x)) {
         ++h;
      }
      return ls[h].f(x);
   }
} hull[2];

ll f[2][N];
int a[N];
int go[205][N];
int ans[205];

int main() {
   int n, k;
   scanf("%d %d", &n, &k);
   for (int i = 1; i <= n; ++i) {
      scanf("%d", a + i);
      a[i] += a[i - 1];
   }
   int now = 0, nxt = 1;
   for (int j = 1; j <= k; ++j) {
      hull[nxt].reset();
      for (int i = 1; i <= n; ++i) {
         f[nxt][i] = hull[now].get(a[i]);
         go[j][i] = hull[now].trace();
         hull[now].add(Line(a[i], f[now][i] - (ll) a[i] * a[i]), i);
      }
      swap(now, nxt);
   }
   printf("%lld\n", f[now][n]);
   now = n;
   for (int i = k; i > 0; --i) {
      now = go[i][now];
      ans[i] = now;
   }
   for (int i = 1; i <= k; ++i) {
      printf("%d ", ans[i]);
   }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:50:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d", &n, &k);
    ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:52:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", a + i);
       ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3840 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 3968 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 32 ms 12624 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 3892 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 32 ms 8952 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 33 ms 9856 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 36 ms 10360 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 25 ms 9216 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 29 ms 10028 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 39 ms 11608 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 7416 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 21 ms 7416 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 250 ms 85136 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 7936 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 433 ms 84600 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 271 ms 61080 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 308 ms 65528 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 210 ms 54392 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 225 ms 61432 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 287 ms 77048 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845