oj.uz

답안 #1103041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1103041 2024-10-19T14:59:44 Z rastervc Feast (NOI19_feast) C++17
18 / 100
 88 ms 13916 KB 
#include <iostream>

constexpr long long INF = 1e18;
constexpr int MAX_N = 3e5 + 5;
int N, K, a[MAX_N];
std::pair<long long, int> dp[MAX_N][2];

std::pair<long long, int> check(long long lambda) {
    dp[1][0] = { 0, 0 };
    dp[1][1] = { a[1] - lambda, 1 };

    for (int i = 2; i <= N; ++i) {
        dp[i][0] = std::max(dp[i - 1][0], dp[i - 1][1]);
        dp[i][1] = std::max(
            std::make_pair(dp[i - 1][0].first + a[i] - lambda, dp[i - 1][0].second + 1),
            std::make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second)
        );
    }

    return std::max(dp[N][0], dp[N][1]);
}

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> N >> K;
    for (int i = 1; i <= N; ++i)
        std::cin >> a[i];
    
    long long l = 0, r = INF, ans = 0;
    while (l <= r) {
        long long mid = (l + r) >> 1;
        std::pair<long long, int> res = check(mid);
        if (res.second >= K) { 
            ans = res.first + mid * res.second;
            l = mid + 1;
        } else r = mid - 1;
    }

    std::cout << ans;

    return 0;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 11216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 11344 KB Output is correct
2 Correct 43 ms 11088 KB Output is correct
3 Correct 41 ms 10984 KB Output is correct
4 Incorrect 42 ms 11240 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 12616 KB Output is correct
2 Correct 84 ms 12900 KB Output is correct
3 Correct 79 ms 12624 KB Output is correct
4 Correct 76 ms 13916 KB Output is correct
5 Correct 76 ms 13908 KB Output is correct
6 Correct 83 ms 13896 KB Output is correct
7 Correct 86 ms 12616 KB Output is correct
8 Correct 79 ms 12716 KB Output is correct
9 Correct 88 ms 12988 KB Output is correct
10 Correct 84 ms 13904 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 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 2384 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 2384 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 Incorrect 51 ms 11216 KB Output isn't correct
2 Halted 0 ms 0 KB -