oj.uz

답안 #1097193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097193 2024-10-06T11:57:49 Z crafticat Feast (NOI19_feast) C++17
41 / 100
 1000 ms 26856 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};pi pa = make_pair(p,-1);


    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] - pa, dp[i - 1][1]));
            ckmax(dp[i][l], dp[i - 1][0] - pa);
        }
        ckmax(dp[i][0], dp[i - 1][0]);
        dp[i][1].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 = 1e18;
    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:19: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]
   19 |     for (ll i = 1; i <= arr.size(); ++i) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 906 ms 26032 KB Output is correct
2 Correct 960 ms 26524 KB Output is correct
3 Correct 958 ms 26856 KB Output is correct
4 Correct 977 ms 26628 KB Output is correct
5 Execution timed out 1000 ms 26508 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 966 ms 24648 KB Output is correct
2 Correct 975 ms 25076 KB Output is correct
3 Correct 985 ms 24468 KB Output is correct
4 Correct 976 ms 24704 KB Output is correct
5 Correct 965 ms 26080 KB Output is correct
6 Execution timed out 1029 ms 24432 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1010 ms 26756 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 6 ms 604 KB Output is correct
22 Correct 7 ms 600 KB Output is correct
23 Correct 5 ms 600 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 5 ms 608 KB Output is correct
27 Correct 5 ms 604 KB Output is correct
28 Correct 8 ms 604 KB Output is correct
29 Correct 6 ms 600 KB Output is correct
30 Correct 5 ms 344 KB Output is correct

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 906 ms 26032 KB Output is correct
2 Correct 960 ms 26524 KB Output is correct
3 Correct 958 ms 26856 KB Output is correct
4 Correct 977 ms 26628 KB Output is correct
5 Execution timed out 1000 ms 26508 KB Time limit exceeded
6 Halted 0 ms 0 KB -