oj.uz

Submission #1115782

# Submission time Handle Problem Language Result Execution time Memory
1115782 2024-11-21T00:53:18 Z vjudge1 Feast (NOI19_feast) C++17
30 / 100
 72 ms 4680 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

constexpr int N = int(3e5) + 5;
constexpr int MOD = int(1e9) + 7;

int a[N];

void solve(){
    int n, k;
    cin >> n >> k;
    for(int i{}; i < n; ++i){
        cin >> a[i];
    }
    ll l{}, r{ll(3e14)}, ans{};
    while(l <= r){
        ll m = l + r >> 1;
        pair<ll, int> cur{ll(-1e18), 0}, dp{0, 0};
        for(int i = 0; i < n; ++i){
            cur = max(pair{cur.first + a[i], cur.second}, {dp.first + a[i] - m, dp.second + 1});
            dp = max(dp, cur);
        }
        if(dp.second >= k){
            ans = dp.first + k * m;
            l = m + 1;
        }
        else r = m - 1;
    }
    cout << ans;
}
int main(){
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(0);    
    cin.tie(0);
 
    int t = 1;
    // cin >> t;
    for(int i = 1; i <= t; ++i) {
        solve();
    }
}

Compilation message

feast.cpp: In function 'void solve()':
feast.cpp:19:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |         ll m = l + r >> 1;
      |                ~~^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3172 KB Output is correct
2 Correct 38 ms 4436 KB Output is correct
3 Correct 39 ms 4436 KB Output is correct
4 Correct 45 ms 4352 KB Output is correct
5 Correct 40 ms 4276 KB Output is correct
6 Correct 38 ms 4252 KB Output is correct
7 Correct 38 ms 4168 KB Output is correct
8 Correct 39 ms 4280 KB Output is correct
9 Correct 39 ms 4168 KB Output is correct
10 Correct 39 ms 4184 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2640 KB Output is correct
2 Correct 41 ms 2756 KB Output is correct
3 Correct 33 ms 2640 KB Output is correct
4 Correct 31 ms 2808 KB Output is correct
5 Correct 42 ms 4036 KB Output is correct
6 Correct 34 ms 2496 KB Output is correct
7 Correct 30 ms 2640 KB Output is correct
8 Correct 43 ms 4176 KB Output is correct
9 Correct 50 ms 4176 KB Output is correct
10 Correct 30 ms 2640 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 4436 KB Output is correct
2 Correct 62 ms 3492 KB Output is correct
3 Correct 59 ms 4432 KB Output is correct
4 Correct 60 ms 4592 KB Output is correct
5 Correct 68 ms 4432 KB Output is correct
6 Correct 62 ms 4432 KB Output is correct
7 Correct 72 ms 4680 KB Output is correct
8 Correct 61 ms 3656 KB Output is correct
9 Correct 60 ms 4432 KB Output is correct
10 Correct 59 ms 4620 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3172 KB Output is correct
2 Correct 38 ms 4436 KB Output is correct
3 Correct 39 ms 4436 KB Output is correct
4 Correct 45 ms 4352 KB Output is correct
5 Correct 40 ms 4276 KB Output is correct
6 Correct 38 ms 4252 KB Output is correct
7 Correct 38 ms 4168 KB Output is correct
8 Correct 39 ms 4280 KB Output is correct
9 Correct 39 ms 4168 KB Output is correct
10 Correct 39 ms 4184 KB Output is correct
11 Correct 35 ms 2640 KB Output is correct
12 Correct 41 ms 2756 KB Output is correct
13 Correct 33 ms 2640 KB Output is correct
14 Correct 31 ms 2808 KB Output is correct
15 Correct 42 ms 4036 KB Output is correct
16 Correct 34 ms 2496 KB Output is correct
17 Correct 30 ms 2640 KB Output is correct
18 Correct 43 ms 4176 KB Output is correct
19 Correct 50 ms 4176 KB Output is correct
20 Correct 30 ms 2640 KB Output is correct
21 Correct 61 ms 4436 KB Output is correct
22 Correct 62 ms 3492 KB Output is correct
23 Correct 59 ms 4432 KB Output is correct
24 Correct 60 ms 4592 KB Output is correct
25 Correct 68 ms 4432 KB Output is correct
26 Correct 62 ms 4432 KB Output is correct
27 Correct 72 ms 4680 KB Output is correct
28 Correct 61 ms 3656 KB Output is correct
29 Correct 60 ms 4432 KB Output is correct
30 Correct 59 ms 4620 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Incorrect 1 ms 336 KB Output isn't correct
33 Halted 0 ms 0 KB -