oj.uz

Submission #791852

# Submission time Handle Problem Language Result Execution time Memory
791852 2023-07-24T11:24:19 Z anhduc2701 Feast (NOI19_feast) C++17
22 / 100
 70 ms 9700 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
        {
            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 = 0;
    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:104:28: warning: 'ans1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |         cout << ans + ans1 * k;
      |                       ~~~~~^~~
feast.cpp:104:30: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |         cout << ans + ans1 * k;
      |                              ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9460 KB Output is correct
2 Correct 47 ms 9520 KB Output is correct
3 Correct 47 ms 9640 KB Output is correct
4 Correct 48 ms 9648 KB Output is correct
5 Correct 47 ms 9604 KB Output is correct
6 Correct 55 ms 9356 KB Output is correct
7 Correct 46 ms 9428 KB Output is correct
8 Correct 47 ms 9636 KB Output is correct
9 Correct 46 ms 9440 KB Output is correct
10 Correct 47 ms 9560 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 9428 KB Output is correct
2 Correct 50 ms 9700 KB Output is correct
3 Correct 50 ms 9492 KB Output is correct
4 Incorrect 45 ms 9576 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 9556 KB Output is correct
2 Correct 68 ms 9436 KB Output is correct
3 Correct 70 ms 9500 KB Output is correct
4 Correct 68 ms 9512 KB Output is correct
5 Correct 69 ms 9596 KB Output is correct
6 Correct 69 ms 9656 KB Output is correct
7 Correct 70 ms 9688 KB Output is correct
8 Correct 69 ms 9548 KB Output is correct
9 Correct 70 ms 9680 KB Output is correct
10 Correct 70 ms 9688 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9460 KB Output is correct
2 Correct 47 ms 9520 KB Output is correct
3 Correct 47 ms 9640 KB Output is correct
4 Correct 48 ms 9648 KB Output is correct
5 Correct 47 ms 9604 KB Output is correct
6 Correct 55 ms 9356 KB Output is correct
7 Correct 46 ms 9428 KB Output is correct
8 Correct 47 ms 9636 KB Output is correct
9 Correct 46 ms 9440 KB Output is correct
10 Correct 47 ms 9560 KB Output is correct
11 Correct 50 ms 9428 KB Output is correct
12 Correct 50 ms 9700 KB Output is correct
13 Correct 50 ms 9492 KB Output is correct
14 Incorrect 45 ms 9576 KB Output isn't correct
15 Halted 0 ms 0 KB -