oj.uz

답안 #1115332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115332 2024-11-20T10:43:07 Z vjudge1 Feast (NOI19_feast) C++17
30 / 100
 90 ms 3408 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(1e18)}, 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 38 ms 1360 KB Output is correct
2 Correct 42 ms 1616 KB Output is correct
3 Correct 38 ms 1784 KB Output is correct
4 Correct 39 ms 1784 KB Output is correct
5 Correct 38 ms 1460 KB Output is correct
6 Correct 39 ms 1360 KB Output is correct
7 Correct 48 ms 1372 KB Output is correct
8 Correct 42 ms 3408 KB Output is correct
9 Correct 45 ms 1360 KB Output is correct
10 Correct 38 ms 1784 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 1592 KB Output is correct
2 Correct 38 ms 2152 KB Output is correct
3 Correct 36 ms 1360 KB Output is correct
4 Correct 34 ms 2384 KB Output is correct
5 Correct 57 ms 3072 KB Output is correct
6 Correct 35 ms 1360 KB Output is correct
7 Correct 34 ms 1616 KB Output is correct
8 Correct 47 ms 3040 KB Output is correct
9 Correct 42 ms 1428 KB Output is correct
10 Correct 34 ms 1616 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 3212 KB Output is correct
2 Correct 90 ms 2864 KB Output is correct
3 Correct 69 ms 1616 KB Output is correct
4 Correct 71 ms 3144 KB Output is correct
5 Correct 72 ms 1608 KB Output is correct
6 Correct 88 ms 1616 KB Output is correct
7 Correct 71 ms 1564 KB Output is correct
8 Correct 83 ms 1608 KB Output is correct
9 Correct 71 ms 1508 KB Output is correct
10 Correct 73 ms 1612 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1360 KB Output is correct
2 Correct 42 ms 1616 KB Output is correct
3 Correct 38 ms 1784 KB Output is correct
4 Correct 39 ms 1784 KB Output is correct
5 Correct 38 ms 1460 KB Output is correct
6 Correct 39 ms 1360 KB Output is correct
7 Correct 48 ms 1372 KB Output is correct
8 Correct 42 ms 3408 KB Output is correct
9 Correct 45 ms 1360 KB Output is correct
10 Correct 38 ms 1784 KB Output is correct
11 Correct 35 ms 1592 KB Output is correct
12 Correct 38 ms 2152 KB Output is correct
13 Correct 36 ms 1360 KB Output is correct
14 Correct 34 ms 2384 KB Output is correct
15 Correct 57 ms 3072 KB Output is correct
16 Correct 35 ms 1360 KB Output is correct
17 Correct 34 ms 1616 KB Output is correct
18 Correct 47 ms 3040 KB Output is correct
19 Correct 42 ms 1428 KB Output is correct
20 Correct 34 ms 1616 KB Output is correct
21 Correct 76 ms 3212 KB Output is correct
22 Correct 90 ms 2864 KB Output is correct
23 Correct 69 ms 1616 KB Output is correct
24 Correct 71 ms 3144 KB Output is correct
25 Correct 72 ms 1608 KB Output is correct
26 Correct 88 ms 1616 KB Output is correct
27 Correct 71 ms 1564 KB Output is correct
28 Correct 83 ms 1608 KB Output is correct
29 Correct 71 ms 1508 KB Output is correct
30 Correct 73 ms 1612 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 -