oj.uz

답안 #791856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791856 2023-07-24T11:27:43 Z vjudge1 Feast (NOI19_feast) C++17
100 / 100
 109 ms 9736 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI acos(-1.0)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x, i) (1 & ((x) >> (i)))
#define MASK(x) (1LL << (x))
#define task "tnc"
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef long double ld;
const ll INF = 1e14;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const int mo = 998244353;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using pii = pair<pair<ll, ll>, ll>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll n, k;
ll a[maxn];
ll dp[maxn];
ll trace[maxn];
ll pre[maxn];
ll f(ll mid)
{
    // dp[i] = max(dp[i-1],dp[j]+dp[i]-pre[j]+pre[i]-mid);
    dp[0] = 0;
    ll ma = 0;
    ll vt = 0;
    trace[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        dp[i] = 0;
        trace[i] = 0;
    }

    for (int i = 1; i <= n; i++)
    {

        if (dp[i - 1] <= ma + pre[i] - mid)
        {
            dp[i] = ma + pre[i] - mid;
            trace[i] = trace[vt] + 1;
        }
        else
        {
            dp[i] = dp[i - 1];
            trace[i] = trace[i - 1];
        }
        if (ma <= dp[i] - pre[i])
        {
            ma = dp[i] - pre[i];
            vt = i;
        }
    }
    return trace[n];
}
void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        pre[i] = pre[i - 1] + a[i];
    }
    ll l = -INF;
    ll r = INF;
    ll ans;
    ll ans1;

    while (l <= r)
    {
        ll mid = (l + r) / 2;
        if (f(mid) >= k)
        {
            ans = dp[n];
            ans1 = mid;
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }

    if (ans1 <= 0)
    {

        f(0);
        cout << dp[n];
    }
    else
    {
        cout << ans + ans1 * k;
    }
}
signed main()
{
    cin.tie(0), cout.tie(0)->sync_with_stdio(0);

    solve();
}

Compilation message

feast.cpp: In function 'void solve()':
feast.cpp:108:28: warning: 'ans1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |         cout << ans + ans1 * k;
      |                       ~~~~~^~~
feast.cpp:108:30: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |         cout << ans + ans1 * k;
      |                              ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 9440 KB Output is correct
2 Correct 49 ms 9536 KB Output is correct
3 Correct 48 ms 9612 KB Output is correct
4 Correct 48 ms 9652 KB Output is correct
5 Correct 47 ms 9556 KB Output is correct
6 Correct 46 ms 9452 KB Output is correct
7 Correct 46 ms 9432 KB Output is correct
8 Correct 47 ms 9632 KB Output is correct
9 Correct 46 ms 9420 KB Output is correct
10 Correct 47 ms 9560 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 9428 KB Output is correct
2 Correct 53 ms 9720 KB Output is correct
3 Correct 50 ms 9500 KB Output is correct
4 Correct 44 ms 9572 KB Output is correct
5 Correct 55 ms 9348 KB Output is correct
6 Correct 51 ms 9484 KB Output is correct
7 Correct 45 ms 9736 KB Output is correct
8 Correct 56 ms 9668 KB Output is correct
9 Correct 55 ms 9432 KB Output is correct
10 Correct 46 ms 9616 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 9628 KB Output is correct
2 Correct 72 ms 9400 KB Output is correct
3 Correct 71 ms 9524 KB Output is correct
4 Correct 68 ms 9420 KB Output is correct
5 Correct 80 ms 9596 KB Output is correct
6 Correct 71 ms 9656 KB Output is correct
7 Correct 70 ms 9708 KB Output is correct
8 Correct 70 ms 9604 KB Output is correct
9 Correct 72 ms 9708 KB Output is correct
10 Correct 72 ms 9588 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 9440 KB Output is correct
2 Correct 49 ms 9536 KB Output is correct
3 Correct 48 ms 9612 KB Output is correct
4 Correct 48 ms 9652 KB Output is correct
5 Correct 47 ms 9556 KB Output is correct
6 Correct 46 ms 9452 KB Output is correct
7 Correct 46 ms 9432 KB Output is correct
8 Correct 47 ms 9632 KB Output is correct
9 Correct 46 ms 9420 KB Output is correct
10 Correct 47 ms 9560 KB Output is correct
11 Correct 50 ms 9428 KB Output is correct
12 Correct 53 ms 9720 KB Output is correct
13 Correct 50 ms 9500 KB Output is correct
14 Correct 44 ms 9572 KB Output is correct
15 Correct 55 ms 9348 KB Output is correct
16 Correct 51 ms 9484 KB Output is correct
17 Correct 45 ms 9736 KB Output is correct
18 Correct 56 ms 9668 KB Output is correct
19 Correct 55 ms 9432 KB Output is correct
20 Correct 46 ms 9616 KB Output is correct
21 Correct 74 ms 9628 KB Output is correct
22 Correct 72 ms 9400 KB Output is correct
23 Correct 71 ms 9524 KB Output is correct
24 Correct 68 ms 9420 KB Output is correct
25 Correct 80 ms 9596 KB Output is correct
26 Correct 71 ms 9656 KB Output is correct
27 Correct 70 ms 9708 KB Output is correct
28 Correct 70 ms 9604 KB Output is correct
29 Correct 72 ms 9708 KB Output is correct
30 Correct 72 ms 9588 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 292 KB Output is correct
39 Correct 0 ms 412 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 104 ms 9492 KB Output is correct
62 Correct 105 ms 9728 KB Output is correct
63 Correct 81 ms 9428 KB Output is correct
64 Correct 109 ms 9656 KB Output is correct
65 Correct 104 ms 9656 KB Output is correct
66 Correct 102 ms 9624 KB Output is correct
67 Correct 100 ms 9484 KB Output is correct
68 Correct 71 ms 9648 KB Output is correct
69 Correct 72 ms 9468 KB Output is correct
70 Correct 70 ms 9428 KB Output is correct