oj.uz

답안 #846708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846708 2023-09-08T09:29:11 Z BamshooT Feast (NOI19_feast) C++14
100 / 100
 108 ms 30812 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <cstdlib>

#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define inf -1e18
#define fi first
#define se second

using namespace std;

typedef pair <ll, int> li;

const int N = 3e5 + 9, M = 2e3 + 9;
int n, k;
ll a[N], pre[N], dp[M][M];

void sub1(){

    for (int i = 1; i <= k; ++i){
        ll cur = 0;
        for (int j = 1; j <= n; ++j) {
            cur = max(cur, dp[i-1][j] - pre[j]);
            dp[i][j] = max(dp[i][j-1], cur + pre[j]);
        }
    }
    cout << dp[k][n];
}

pair<ll, int> f[N];

void maximize(li &a, li b){
    if (a.fi < b.fi) a = b;
    if (a.fi == b.fi && a.se < b.se) a = b;
}

li calc(ll cost){
    li best = {0, 0};
    for (int i = 1; i <= n; ++i) {
        f[i] = f[i-1];
        maximize(f[i], {pre[i] + best.fi - cost , best.se + 1});
        maximize(best, {f[i].fi - pre[i], f[i].se});
    }
    return f[n];
}

void sub2(){
    ll lo = -1e15, hi = 1e15, ans = 0;
    while (lo <= hi) {
        ll mid = lo + hi >> 1;
        li tmp = calc(mid);
        if (tmp.se <= k) {
            ans = max(ans, tmp.fi + tmp.se*mid);
            hi = mid - 1;
        } else lo = mid + 1;
    }
    cout << ans;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  //  freopen("nhap.inp", "r", stdin);
  //  freopen("xuat.out", "w", stdout);
    cin >> n >> k;
    FOR(i, 1, n) {
        cin >> a[i];
        pre[i] = pre[i-1] + a[i];
    }
    if (max(k, n) <= 2000) sub1(); else
    sub2();
    return 0;
}

Compilation message

feast.cpp: In function 'void sub2()':
feast.cpp:53:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |         ll mid = lo + hi >> 1;
      |                  ~~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 11208 KB Output is correct
2 Correct 47 ms 11392 KB Output is correct
3 Correct 55 ms 11600 KB Output is correct
4 Correct 47 ms 11460 KB Output is correct
5 Correct 48 ms 11356 KB Output is correct
6 Correct 47 ms 11608 KB Output is correct
7 Correct 47 ms 11356 KB Output is correct
8 Correct 47 ms 11344 KB Output is correct
9 Correct 48 ms 11508 KB Output is correct
10 Correct 46 ms 11356 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 11352 KB Output is correct
2 Correct 49 ms 11468 KB Output is correct
3 Correct 44 ms 11352 KB Output is correct
4 Correct 48 ms 11432 KB Output is correct
5 Correct 46 ms 11356 KB Output is correct
6 Correct 44 ms 11352 KB Output is correct
7 Correct 43 ms 11440 KB Output is correct
8 Correct 47 ms 11348 KB Output is correct
9 Correct 47 ms 11396 KB Output is correct
10 Correct 45 ms 11600 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 11296 KB Output is correct
2 Correct 73 ms 11416 KB Output is correct
3 Correct 72 ms 11344 KB Output is correct
4 Correct 72 ms 11424 KB Output is correct
5 Correct 72 ms 11356 KB Output is correct
6 Correct 76 ms 11356 KB Output is correct
7 Correct 73 ms 11484 KB Output is correct
8 Correct 71 ms 11440 KB Output is correct
9 Correct 83 ms 11344 KB Output is correct
10 Correct 73 ms 11304 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 9 ms 30812 KB Output is correct
23 Correct 3 ms 10072 KB Output is correct
24 Correct 2 ms 5976 KB Output is correct
25 Correct 2 ms 8028 KB Output is correct
26 Correct 2 ms 5980 KB Output is correct
27 Correct 3 ms 8028 KB Output is correct
28 Correct 1 ms 3040 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 11208 KB Output is correct
2 Correct 47 ms 11392 KB Output is correct
3 Correct 55 ms 11600 KB Output is correct
4 Correct 47 ms 11460 KB Output is correct
5 Correct 48 ms 11356 KB Output is correct
6 Correct 47 ms 11608 KB Output is correct
7 Correct 47 ms 11356 KB Output is correct
8 Correct 47 ms 11344 KB Output is correct
9 Correct 48 ms 11508 KB Output is correct
10 Correct 46 ms 11356 KB Output is correct
11 Correct 47 ms 11352 KB Output is correct
12 Correct 49 ms 11468 KB Output is correct
13 Correct 44 ms 11352 KB Output is correct
14 Correct 48 ms 11432 KB Output is correct
15 Correct 46 ms 11356 KB Output is correct
16 Correct 44 ms 11352 KB Output is correct
17 Correct 43 ms 11440 KB Output is correct
18 Correct 47 ms 11348 KB Output is correct
19 Correct 47 ms 11396 KB Output is correct
20 Correct 45 ms 11600 KB Output is correct
21 Correct 74 ms 11296 KB Output is correct
22 Correct 73 ms 11416 KB Output is correct
23 Correct 72 ms 11344 KB Output is correct
24 Correct 72 ms 11424 KB Output is correct
25 Correct 72 ms 11356 KB Output is correct
26 Correct 76 ms 11356 KB Output is correct
27 Correct 73 ms 11484 KB Output is correct
28 Correct 71 ms 11440 KB Output is correct
29 Correct 83 ms 11344 KB Output is correct
30 Correct 73 ms 11304 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2908 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 1 ms 2648 KB Output is correct
45 Correct 1 ms 2652 KB Output is correct
46 Correct 2 ms 2648 KB Output is correct
47 Correct 1 ms 2648 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 2 ms 5980 KB Output is correct
52 Correct 9 ms 30812 KB Output is correct
53 Correct 3 ms 10072 KB Output is correct
54 Correct 2 ms 5976 KB Output is correct
55 Correct 2 ms 8028 KB Output is correct
56 Correct 2 ms 5980 KB Output is correct
57 Correct 3 ms 8028 KB Output is correct
58 Correct 1 ms 3040 KB Output is correct
59 Correct 1 ms 2908 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 108 ms 11172 KB Output is correct
62 Correct 97 ms 11468 KB Output is correct
63 Correct 83 ms 11604 KB Output is correct
64 Correct 102 ms 11456 KB Output is correct
65 Correct 104 ms 11448 KB Output is correct
66 Correct 105 ms 11356 KB Output is correct
67 Correct 106 ms 11560 KB Output is correct
68 Correct 74 ms 11708 KB Output is correct
69 Correct 73 ms 11348 KB Output is correct
70 Correct 70 ms 11400 KB Output is correct