oj.uz

답안 #1115790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115790 2024-11-21T01:03:33 Z vjudge1 Feast (NOI19_feast) C++17
40 / 100
 80 ms 1628 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{0, 0};
        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 || !m){
            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 33 ms 1360 KB Output is correct
2 Correct 34 ms 1628 KB Output is correct
3 Correct 34 ms 1568 KB Output is correct
4 Correct 34 ms 1616 KB Output is correct
5 Correct 34 ms 1616 KB Output is correct
6 Correct 35 ms 1360 KB Output is correct
7 Correct 33 ms 1360 KB Output is correct
8 Correct 40 ms 1452 KB Output is correct
9 Correct 36 ms 1372 KB Output is correct
10 Correct 36 ms 1360 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1360 KB Output is correct
2 Correct 32 ms 1616 KB Output is correct
3 Correct 31 ms 1360 KB Output is correct
4 Correct 30 ms 1616 KB Output is correct
5 Correct 38 ms 1592 KB Output is correct
6 Correct 32 ms 1360 KB Output is correct
7 Correct 30 ms 1616 KB Output is correct
8 Correct 39 ms 1616 KB Output is correct
9 Correct 41 ms 1360 KB Output is correct
10 Correct 29 ms 1628 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1464 KB Output is correct
2 Correct 76 ms 1360 KB Output is correct
3 Correct 61 ms 1616 KB Output is correct
4 Correct 59 ms 1360 KB Output is correct
5 Correct 60 ms 1616 KB Output is correct
6 Correct 64 ms 1516 KB Output is correct
7 Correct 66 ms 1608 KB Output is correct
8 Correct 67 ms 1616 KB Output is correct
9 Correct 80 ms 1608 KB Output is correct
10 Correct 66 ms 1616 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 564 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 564 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 564 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1360 KB Output is correct
2 Correct 34 ms 1628 KB Output is correct
3 Correct 34 ms 1568 KB Output is correct
4 Correct 34 ms 1616 KB Output is correct
5 Correct 34 ms 1616 KB Output is correct
6 Correct 35 ms 1360 KB Output is correct
7 Correct 33 ms 1360 KB Output is correct
8 Correct 40 ms 1452 KB Output is correct
9 Correct 36 ms 1372 KB Output is correct
10 Correct 36 ms 1360 KB Output is correct
11 Correct 32 ms 1360 KB Output is correct
12 Correct 32 ms 1616 KB Output is correct
13 Correct 31 ms 1360 KB Output is correct
14 Correct 30 ms 1616 KB Output is correct
15 Correct 38 ms 1592 KB Output is correct
16 Correct 32 ms 1360 KB Output is correct
17 Correct 30 ms 1616 KB Output is correct
18 Correct 39 ms 1616 KB Output is correct
19 Correct 41 ms 1360 KB Output is correct
20 Correct 29 ms 1628 KB Output is correct
21 Correct 68 ms 1464 KB Output is correct
22 Correct 76 ms 1360 KB Output is correct
23 Correct 61 ms 1616 KB Output is correct
24 Correct 59 ms 1360 KB Output is correct
25 Correct 60 ms 1616 KB Output is correct
26 Correct 64 ms 1516 KB Output is correct
27 Correct 66 ms 1608 KB Output is correct
28 Correct 67 ms 1616 KB Output is correct
29 Correct 80 ms 1608 KB Output is correct
30 Correct 66 ms 1616 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 564 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Incorrect 1 ms 336 KB Output isn't correct
42 Halted 0 ms 0 KB -