oj.uz

답안 #1100491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100491 2024-10-14T05:51:57 Z vjudge1 Feast (NOI19_feast) C++17
30 / 100
 158 ms 14072 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 << 40), 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 158 ms 13644 KB Output is correct
2 Correct 153 ms 13632 KB Output is correct
3 Correct 151 ms 13896 KB Output is correct
4 Correct 150 ms 13648 KB Output is correct
5 Correct 148 ms 13640 KB Output is correct
6 Correct 144 ms 13648 KB Output is correct
7 Correct 146 ms 13648 KB Output is correct
8 Correct 148 ms 13648 KB Output is correct
9 Correct 148 ms 13640 KB Output is correct
10 Correct 147 ms 13636 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 12112 KB Output is correct
2 Correct 67 ms 12100 KB Output is correct
3 Correct 68 ms 11856 KB Output is correct
4 Correct 117 ms 12112 KB Output is correct
5 Correct 148 ms 13896 KB Output is correct
6 Correct 72 ms 11856 KB Output is correct
7 Correct 123 ms 12124 KB Output is correct
8 Correct 157 ms 13660 KB Output is correct
9 Correct 152 ms 13648 KB Output is correct
10 Correct 116 ms 12108 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 14068 KB Output is correct
2 Correct 100 ms 13916 KB Output is correct
3 Correct 92 ms 13896 KB Output is correct
4 Correct 109 ms 13908 KB Output is correct
5 Correct 94 ms 13908 KB Output is correct
6 Correct 97 ms 14072 KB Output is correct
7 Correct 99 ms 13900 KB Output is correct
8 Correct 95 ms 13904 KB Output is correct
9 Correct 109 ms 13896 KB Output is correct
10 Correct 100 ms 14012 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 13644 KB Output is correct
2 Correct 153 ms 13632 KB Output is correct
3 Correct 151 ms 13896 KB Output is correct
4 Correct 150 ms 13648 KB Output is correct
5 Correct 148 ms 13640 KB Output is correct
6 Correct 144 ms 13648 KB Output is correct
7 Correct 146 ms 13648 KB Output is correct
8 Correct 148 ms 13648 KB Output is correct
9 Correct 148 ms 13640 KB Output is correct
10 Correct 147 ms 13636 KB Output is correct
11 Correct 64 ms 12112 KB Output is correct
12 Correct 67 ms 12100 KB Output is correct
13 Correct 68 ms 11856 KB Output is correct
14 Correct 117 ms 12112 KB Output is correct
15 Correct 148 ms 13896 KB Output is correct
16 Correct 72 ms 11856 KB Output is correct
17 Correct 123 ms 12124 KB Output is correct
18 Correct 157 ms 13660 KB Output is correct
19 Correct 152 ms 13648 KB Output is correct
20 Correct 116 ms 12108 KB Output is correct
21 Correct 97 ms 14068 KB Output is correct
22 Correct 100 ms 13916 KB Output is correct
23 Correct 92 ms 13896 KB Output is correct
24 Correct 109 ms 13908 KB Output is correct
25 Correct 94 ms 13908 KB Output is correct
26 Correct 97 ms 14072 KB Output is correct
27 Correct 99 ms 13900 KB Output is correct
28 Correct 95 ms 13904 KB Output is correct
29 Correct 109 ms 13896 KB Output is correct
30 Correct 100 ms 14012 KB Output is correct
31 Correct 1 ms 2384 KB Output is correct
32 Incorrect 1 ms 2388 KB Output isn't correct
33 Halted 0 ms 0 KB -