oj.uz

답안 #1115313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115313 2024-11-20T10:23:35 Z vjudge1 Feast (NOI19_feast) C++17
30 / 100
 68 ms 4568 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{a[0] - m, 1}, dp{max(cur, {})};
        for(int i = 1; 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

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 3144 KB Output is correct
2 Correct 52 ms 4432 KB Output is correct
3 Correct 37 ms 4412 KB Output is correct
4 Correct 39 ms 4308 KB Output is correct
5 Correct 37 ms 4424 KB Output is correct
6 Correct 38 ms 4176 KB Output is correct
7 Correct 38 ms 4176 KB Output is correct
8 Correct 43 ms 4424 KB Output is correct
9 Correct 38 ms 4176 KB Output is correct
10 Correct 38 ms 4176 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 2812 KB Output is correct
2 Correct 35 ms 2640 KB Output is correct
3 Correct 35 ms 2640 KB Output is correct
4 Correct 34 ms 2640 KB Output is correct
5 Correct 41 ms 3912 KB Output is correct
6 Correct 33 ms 2640 KB Output is correct
7 Correct 32 ms 2632 KB Output is correct
8 Correct 44 ms 4340 KB Output is correct
9 Correct 46 ms 4168 KB Output is correct
10 Correct 30 ms 2640 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 4424 KB Output is correct
2 Correct 64 ms 3528 KB Output is correct
3 Correct 61 ms 4432 KB Output is correct
4 Correct 60 ms 4424 KB Output is correct
5 Correct 61 ms 4424 KB Output is correct
6 Correct 66 ms 4568 KB Output is correct
7 Correct 62 ms 4432 KB Output is correct
8 Correct 62 ms 3400 KB Output is correct
9 Correct 62 ms 4432 KB Output is correct
10 Correct 62 ms 4444 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 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

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 3144 KB Output is correct
2 Correct 52 ms 4432 KB Output is correct
3 Correct 37 ms 4412 KB Output is correct
4 Correct 39 ms 4308 KB Output is correct
5 Correct 37 ms 4424 KB Output is correct
6 Correct 38 ms 4176 KB Output is correct
7 Correct 38 ms 4176 KB Output is correct
8 Correct 43 ms 4424 KB Output is correct
9 Correct 38 ms 4176 KB Output is correct
10 Correct 38 ms 4176 KB Output is correct
11 Correct 49 ms 2812 KB Output is correct
12 Correct 35 ms 2640 KB Output is correct
13 Correct 35 ms 2640 KB Output is correct
14 Correct 34 ms 2640 KB Output is correct
15 Correct 41 ms 3912 KB Output is correct
16 Correct 33 ms 2640 KB Output is correct
17 Correct 32 ms 2632 KB Output is correct
18 Correct 44 ms 4340 KB Output is correct
19 Correct 46 ms 4168 KB Output is correct
20 Correct 30 ms 2640 KB Output is correct
21 Correct 68 ms 4424 KB Output is correct
22 Correct 64 ms 3528 KB Output is correct
23 Correct 61 ms 4432 KB Output is correct
24 Correct 60 ms 4424 KB Output is correct
25 Correct 61 ms 4424 KB Output is correct
26 Correct 66 ms 4568 KB Output is correct
27 Correct 62 ms 4432 KB Output is correct
28 Correct 62 ms 3400 KB Output is correct
29 Correct 62 ms 4432 KB Output is correct
30 Correct 62 ms 4444 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Incorrect 1 ms 336 KB Output isn't correct
33 Halted 0 ms 0 KB -