oj.uz

답안 #1097191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097191 2024-10-06T11:55:42 Z crafticat Feast (NOI19_feast) C++17
12 / 100
 604 ms 26700 KB 
#include "bits/stdc++.h"

using namespace std;
template<typename T>
using V = vector<T>;
using ll = long long;
using pi = pair<ll, ll>;
#define ckmax(a,b) a= max(a,b)

inline std::pair<long long, long long> operator-(const std::pair<long long, long long>& p1, const std::pair<long long, long long>& p2) {
    return {p1.first - p2.first, p1.second - p2.second};
}

pi solve(V<ll>&arr, ll k, ll p) {
    V<V<pi>> dp(arr.size() + 1, V<pi>(2, {-1e18,0}));
    dp[0][0] = {0,0};

    for (ll i = 1; i <= arr.size(); ++i) {
        dp[i][0] = {0,0};
        for (ll l = 0; l < 2; ++l) {
            ckmax(dp[i][l], max(dp[i - 1][1] - make_pair(p,-1), dp[i - 1][1]));
            if (l == 0) ckmax(dp[i][l], dp[i - 1][0]);
            ckmax(dp[i][l], dp[i - 1][0] - make_pair(p,-1));
            if (l == 1) dp[i][l].first += arr[i - 1];
        }
    }

    return max(dp[arr.size()][0], dp[arr.size()][1]);
}

int main() {
    ll n, k; cin >> n >> k;

    V<ll> arr(n);
    for (ll i = 0; i < n; ++i) {
        cin >> arr[i];
    }


    ll l = 0, r = 1e9;
    int iter = 0;
    while (r > l) {
        ll mid = l + (r - l + 1) / 2;
        if (solve(arr, k, mid).second >= k)
            l = mid;
        else
            r = mid - 1;

        iter++;
        if (iter > 62) exit(5);
    }

    cout << solve(arr,k,l).first + l * k << "\n";
}

Compilation message

feast.cpp: In function 'pi solve(V<long long int>&, ll, ll)':
feast.cpp:18:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (ll i = 1; i <= arr.size(); ++i) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 23248 KB Output is correct
2 Correct 580 ms 23696 KB Output is correct
3 Correct 548 ms 23932 KB Output is correct
4 Correct 524 ms 26700 KB Output is correct
5 Correct 506 ms 26488 KB Output is correct
6 Correct 497 ms 26056 KB Output is correct
7 Correct 490 ms 26028 KB Output is correct
8 Correct 528 ms 26552 KB Output is correct
9 Correct 547 ms 26128 KB Output is correct
10 Correct 560 ms 26340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 520 ms 23412 KB Output is correct
2 Correct 526 ms 24000 KB Output is correct
3 Correct 534 ms 23332 KB Output is correct
4 Correct 485 ms 23556 KB Output is correct
5 Correct 561 ms 23376 KB Output is correct
6 Correct 591 ms 23328 KB Output is correct
7 Correct 506 ms 23940 KB Output is correct
8 Correct 536 ms 23836 KB Output is correct
9 Correct 523 ms 26124 KB Output is correct
10 Correct 515 ms 24912 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 572 ms 23248 KB Output is correct
2 Correct 580 ms 23696 KB Output is correct
3 Correct 548 ms 23932 KB Output is correct
4 Correct 524 ms 26700 KB Output is correct
5 Correct 506 ms 26488 KB Output is correct
6 Correct 497 ms 26056 KB Output is correct
7 Correct 490 ms 26028 KB Output is correct
8 Correct 528 ms 26552 KB Output is correct
9 Correct 547 ms 26128 KB Output is correct
10 Correct 560 ms 26340 KB Output is correct
11 Correct 520 ms 23412 KB Output is correct
12 Correct 526 ms 24000 KB Output is correct
13 Correct 534 ms 23332 KB Output is correct
14 Correct 485 ms 23556 KB Output is correct
15 Correct 561 ms 23376 KB Output is correct
16 Correct 591 ms 23328 KB Output is correct
17 Correct 506 ms 23940 KB Output is correct
18 Correct 536 ms 23836 KB Output is correct
19 Correct 523 ms 26124 KB Output is correct
20 Correct 515 ms 24912 KB Output is correct
21 Incorrect 604 ms 23696 KB Output isn't correct
22 Halted 0 ms 0 KB -