oj.uz

답안 #366798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366798 2021-02-15T09:57:44 Z mickeyandkaka Feast (NOI19_feast) C++17
100 / 100
 180 ms 16492 KB 
//{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
// clang-format off
void _print() { cerr << "]\033[0m\n"; }
template <typename T> void __print(T x) { cerr << x; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#define debug(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m["; _print(x)
#define debug_arr(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m" << (x) << "\033[0m\n"
#else
#define debug(x...)
#define debug_arr(x...)
#endif
// clang-format on
//}}}

const int N = 3e5 + 10;
// const int N = 10;
int n, k;
int a[N];
LL s[N];

LL dp[N];
LL cnt[N];

LL minf[N];
LL minf_p[N];

int check(LL c)
{
    dp[0] = 0, cnt[0] = 0;
    minf[0] = dp[0] - s[0];
    minf_p[0] = 0;

    for (int i = 1; i <= n; i++)
    {
        dp[i] = dp[i - 1];
        cnt[i] = cnt[i - 1];

        if (minf[i - 1] + s[i] - c > dp[i])
        {
            dp[i] = minf[i - 1] + s[i] - c;
            // debug(i, dp[i]);

            cnt[i] = cnt[minf_p[i - 1]] + 1;
        }

        else if (minf[i - 1] + s[i] - c == dp[i])
        {
            if (cnt[i] < cnt[minf_p[i - 1]] + 1)
            {
                dp[i] = minf[i - 1] + s[i] - c;
                cnt[i] = cnt[minf_p[i - 1]] + 1;
            }
        }

        minf[i] = minf[i - 1];
        minf_p[i] = minf_p[i - 1];

        if (dp[i] - s[i] > minf[i])
        {
            minf[i] = dp[i] - s[i];
            minf_p[i] = i;
        }
    }
    // if (cnt[n] == 0) return k + 1;
    return cnt[n];
}

// const int NN = 1e3 + 10;
// LL dp2[NN][NN];

int main()
{
#ifdef LOCAL
    freopen("in", "r", stdin);
    // freopen("out", "w", stdout);
#endif

    ios::sync_with_stdio(false);
    cin.tie(0);

    while (cin >> n >> k)
    {
        for (int i = 1; i <= n; ++i) cin >> a[i];
        s[0] = 0;
        for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i];

        // clr(dp2, 0x80);

        // dp2[0][0] = 0;
        // for (int i = 1; i <= n; i++)
        //{
        // dp2[i][0] = 0;
        // for (int j = 1; j <= i; j++)
        //{
        // dp2[i][j] = dp2[i - 1][j];
        // for (int p = 0; p < i; p++)
        //{
        // dp2[i][j] = max(dp2[i][j], dp2[p][j - 1] + s[i] - s[p]);
        //}
        //}
        //}

        // for (int p = 1; p <= n; ++p)
        //{
        // debug(p, dp2[n][p]);
        //}

        // for (int kk = max(1, k - 15); kk <= min(1000, k + 15); kk++)
        //{
        // debug(kk, dp2[n][kk], dp2[n][kk] - dp2[n][kk - 1]);
        //// cout << kk << "," << dp2[n][kk] << endl;
        //}

        // for (int i = -10; i <= 1; i++)
        //{
        // int v = check(i);
        // debug(i, v, cnt[n], dp[n]);
        //}

        LL lo = 0, hi = 1e15;
        while (lo + 1 < hi)
        {
            LL mid = lo + (hi - lo) / 2;

            if (check(mid) >= k)
            {
                lo = mid;
            }
            else
            {
                hi = mid;
            }
        }
        LL c = lo;
        if (check(hi) >= k) c = hi;
        debug(lo, hi, c);

        int v = check(c);

        debug(c, v);
        debug(cnt[n], k, dp[n]);

        LL ans = dp[n] + c * k;

        LL ans2 = ans;
        v = check(0);
        if (cnt[n] <= k && dp[n] > ans) ans2 = dp[n];
        debug(cnt[n], dp[n], ans);
        ans = max(ans, ans2);

        cout << ans << endl;
    }

    return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:149:13: warning: variable 'v' set but not used [-Wunused-but-set-variable]
  149 |         int v = check(c);
      |             ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 13164 KB Output is correct
2 Correct 106 ms 15980 KB Output is correct
3 Correct 104 ms 16108 KB Output is correct
4 Correct 104 ms 15980 KB Output is correct
5 Correct 121 ms 16108 KB Output is correct
6 Correct 100 ms 15724 KB Output is correct
7 Correct 104 ms 15852 KB Output is correct
8 Correct 103 ms 15980 KB Output is correct
9 Correct 109 ms 15724 KB Output is correct
10 Correct 102 ms 15852 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 13164 KB Output is correct
2 Correct 81 ms 13420 KB Output is correct
3 Correct 78 ms 13164 KB Output is correct
4 Correct 88 ms 13292 KB Output is correct
5 Correct 88 ms 15724 KB Output is correct
6 Correct 77 ms 14060 KB Output is correct
7 Correct 93 ms 14444 KB Output is correct
8 Correct 90 ms 16108 KB Output is correct
9 Correct 87 ms 15596 KB Output is correct
10 Correct 86 ms 14444 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 13480 KB Output is correct
2 Correct 126 ms 13164 KB Output is correct
3 Correct 110 ms 13164 KB Output is correct
4 Correct 115 ms 13028 KB Output is correct
5 Correct 123 ms 13184 KB Output is correct
6 Correct 110 ms 13164 KB Output is correct
7 Correct 113 ms 13164 KB Output is correct
8 Correct 107 ms 13228 KB Output is correct
9 Correct 114 ms 13292 KB Output is correct
10 Correct 112 ms 13164 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 13164 KB Output is correct
2 Correct 106 ms 15980 KB Output is correct
3 Correct 104 ms 16108 KB Output is correct
4 Correct 104 ms 15980 KB Output is correct
5 Correct 121 ms 16108 KB Output is correct
6 Correct 100 ms 15724 KB Output is correct
7 Correct 104 ms 15852 KB Output is correct
8 Correct 103 ms 15980 KB Output is correct
9 Correct 109 ms 15724 KB Output is correct
10 Correct 102 ms 15852 KB Output is correct
11 Correct 76 ms 13164 KB Output is correct
12 Correct 81 ms 13420 KB Output is correct
13 Correct 78 ms 13164 KB Output is correct
14 Correct 88 ms 13292 KB Output is correct
15 Correct 88 ms 15724 KB Output is correct
16 Correct 77 ms 14060 KB Output is correct
17 Correct 93 ms 14444 KB Output is correct
18 Correct 90 ms 16108 KB Output is correct
19 Correct 87 ms 15596 KB Output is correct
20 Correct 86 ms 14444 KB Output is correct
21 Correct 111 ms 13480 KB Output is correct
22 Correct 126 ms 13164 KB Output is correct
23 Correct 110 ms 13164 KB Output is correct
24 Correct 115 ms 13028 KB Output is correct
25 Correct 123 ms 13184 KB Output is correct
26 Correct 110 ms 13164 KB Output is correct
27 Correct 113 ms 13164 KB Output is correct
28 Correct 107 ms 13228 KB Output is correct
29 Correct 114 ms 13292 KB Output is correct
30 Correct 112 ms 13164 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 1 ms 492 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 1 ms 492 KB Output is correct
57 Correct 1 ms 492 KB Output is correct
58 Correct 1 ms 492 KB Output is correct
59 Correct 1 ms 492 KB Output is correct
60 Correct 1 ms 492 KB Output is correct
61 Correct 165 ms 15980 KB Output is correct
62 Correct 151 ms 16492 KB Output is correct
63 Correct 128 ms 15980 KB Output is correct
64 Correct 180 ms 16364 KB Output is correct
65 Correct 164 ms 16284 KB Output is correct
66 Correct 156 ms 16108 KB Output is correct
67 Correct 155 ms 15852 KB Output is correct
68 Correct 114 ms 16236 KB Output is correct
69 Correct 122 ms 15980 KB Output is correct
70 Correct 126 ms 15980 KB Output is correct