oj.uz

답안 #1100492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100492 2024-10-14T05:53:34 Z Ryuga_ Feast (NOI19_feast) C++17
30 / 100
 211 ms 11080 KB 
/*For today, you happen to be the defeated. But what will you become tomorrow?*/

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 300005;
const ll inf = (1ll << 60);
int arr[N], n, k;
array<ll, 2> dp[N][2];

array<ll, 2> f(ll c) {
    for(int i = 0; i <= n; i ++) {
        dp[i][0] = {0, 0};
        dp[i][1] = {-inf, 0};
    }

    for(int i = 1; i <= n; i ++) {
        dp[i][0] = dp[i - 1][0];
        dp[i][1] = {dp[i - 1][1][0] + (ll)arr[i], dp[i - 1][1][1]};
        array<ll, 2> cur = {dp[i - 1][0][0] + (ll)arr[i] - c, dp[i - 1][0][1] + 1};
        dp[i][1] = max(dp[i][1], cur);
        dp[i][0] = max(dp[i][0], dp[i][1]);
        
    }
    return dp[n][0];
}
void solve() {
    
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) cin >> arr[i];    
    ll lo = 0, hi = (1ll << 60), ans = 0;

    while(lo <= hi) {
        ll mid = (lo + hi) / 2;
        array<ll, 2> yo = f(mid);
        if(yo[1] >= k) {
            ans = yo[0] + k * mid;
            lo = mid + 1;
        }
        else {
            hi = mid - 1;
        }
    }

    cout << ans << '\n';
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
        
    int t = 1;
    // cin >> t;
    
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 10832 KB Output is correct
2 Correct 186 ms 10832 KB Output is correct
3 Correct 197 ms 10832 KB Output is correct
4 Correct 211 ms 10964 KB Output is correct
5 Correct 191 ms 10840 KB Output is correct
6 Correct 188 ms 10960 KB Output is correct
7 Correct 190 ms 10776 KB Output is correct
8 Correct 191 ms 10832 KB Output is correct
9 Correct 189 ms 10832 KB Output is correct
10 Correct 205 ms 10832 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 10832 KB Output is correct
2 Correct 98 ms 10844 KB Output is correct
3 Correct 91 ms 10832 KB Output is correct
4 Correct 147 ms 11080 KB Output is correct
5 Correct 111 ms 10824 KB Output is correct
6 Correct 95 ms 11000 KB Output is correct
7 Correct 149 ms 10832 KB Output is correct
8 Correct 102 ms 10824 KB Output is correct
9 Correct 101 ms 10980 KB Output is correct
10 Correct 143 ms 10832 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 10832 KB Output is correct
2 Correct 125 ms 10828 KB Output is correct
3 Correct 148 ms 10832 KB Output is correct
4 Correct 155 ms 11080 KB Output is correct
5 Correct 139 ms 10824 KB Output is correct
6 Correct 133 ms 10832 KB Output is correct
7 Correct 141 ms 10844 KB Output is correct
8 Correct 167 ms 10840 KB Output is correct
9 Correct 135 ms 10832 KB Output is correct
10 Correct 129 ms 10832 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2556 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2556 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2556 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 10832 KB Output is correct
2 Correct 186 ms 10832 KB Output is correct
3 Correct 197 ms 10832 KB Output is correct
4 Correct 211 ms 10964 KB Output is correct
5 Correct 191 ms 10840 KB Output is correct
6 Correct 188 ms 10960 KB Output is correct
7 Correct 190 ms 10776 KB Output is correct
8 Correct 191 ms 10832 KB Output is correct
9 Correct 189 ms 10832 KB Output is correct
10 Correct 205 ms 10832 KB Output is correct
11 Correct 91 ms 10832 KB Output is correct
12 Correct 98 ms 10844 KB Output is correct
13 Correct 91 ms 10832 KB Output is correct
14 Correct 147 ms 11080 KB Output is correct
15 Correct 111 ms 10824 KB Output is correct
16 Correct 95 ms 11000 KB Output is correct
17 Correct 149 ms 10832 KB Output is correct
18 Correct 102 ms 10824 KB Output is correct
19 Correct 101 ms 10980 KB Output is correct
20 Correct 143 ms 10832 KB Output is correct
21 Correct 126 ms 10832 KB Output is correct
22 Correct 125 ms 10828 KB Output is correct
23 Correct 148 ms 10832 KB Output is correct
24 Correct 155 ms 11080 KB Output is correct
25 Correct 139 ms 10824 KB Output is correct
26 Correct 133 ms 10832 KB Output is correct
27 Correct 141 ms 10844 KB Output is correct
28 Correct 167 ms 10840 KB Output is correct
29 Correct 135 ms 10832 KB Output is correct
30 Correct 129 ms 10832 KB Output is correct
31 Correct 1 ms 2556 KB Output is correct
32 Incorrect 1 ms 2384 KB Output isn't correct
33 Halted 0 ms 0 KB -