oj.uz

Submission #888151

# Submission time Handle Problem Language Result Execution time Memory
888151 2023-12-16T08:44:22 Z Asamai Feast (NOI19_feast) C++17
71 / 100
 238 ms 2940 KB 
#include <bits/stdc++.h>

using namespace std;

template<class A, class B> bool maximize(A& x, B y) {if (x < y) return x = y, true; else return false;}
template<class A, class B> bool minimize(A& x, B y) {if (x > y) return x = y, true; else return false;}

#define     all(a)                a.begin(), a.end()
#define     pb                    push_back
#define     pf                    push_front
#define     fi                    first
#define     se                    second
#define     int                   long long

typedef     long long             ll;
typedef     unsigned long long    ull;
typedef     double                db;
typedef     long double           ld;
typedef     pair<db, db>          pdb;
typedef     pair<ld, ld>          pld;
typedef     pair<int, int>        pii;
typedef     pair<ll, ll>          pll;
typedef     pair<ll, int>         plli;
typedef     pair<int, ll>         pill;

const int MAX_N = 3e5 + 5;
const db inf = 3e14;
const db eps = 1e-3;

int n, k;
int a[MAX_N];
pair<db, int> dp[2][2];
bool curr, nxt;

int check(db lamda) {
    curr = 0, nxt = 1;
    for (int i = 0; i <= 1; i++) {
        for (int j = 0; j <= 1; j++) {
            dp[i][j] = {-inf, -inf};
        }
    }
    dp[curr][0] = {0, 0};
    for (int i = 0; i < n; i++, swap(curr, nxt)) {
        // 0
        maximize(dp[nxt][0], dp[curr][0]);
        maximize(dp[nxt][1], pair<db, int>(dp[curr][0].fi - lamda + (db) a[i + 1], dp[curr][0].se + 1));

        // 1
        maximize(dp[nxt][1], pair<db, int>(dp[curr][1].fi + (db) a[i + 1], dp[curr][1].se));
        maximize(dp[nxt][0], dp[curr][1]);

        for (int j = 0; j <= 1; j++) {
            dp[curr][j] = {-inf, -inf};
        }
    }
    return max(dp[curr][1], dp[curr][0]).se;
}

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

    if (fopen("FEAS.inp", "r")) {
        freopen("FEAS.inp", "r", stdin);
        freopen("FEAS.out", "w", stdout);
    }

    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    db low = 0, high = inf, ans = 0;
    for (int time = 1; time <= 70 && low <= high; time++) {
        db mid = (low + high) / 2;
        if (check(mid) >= k) {
            ans = mid;
            low = mid + eps;
        }
        else {
            high = mid - eps;
        }
    }

    check(ans);
    cout << (ll) round(max(dp[curr][0], dp[curr][1]).fi + ans * k);

    return 0;
}

/*


Saturday, 16 December 2023
14:53:03
*/

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen("FEAS.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen("FEAS.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 2716 KB Output is correct
2 Correct 109 ms 2652 KB Output is correct
3 Correct 111 ms 2780 KB Output is correct
4 Correct 124 ms 2768 KB Output is correct
5 Correct 134 ms 2760 KB Output is correct
6 Correct 107 ms 2652 KB Output is correct
7 Correct 107 ms 2712 KB Output is correct
8 Correct 109 ms 2768 KB Output is correct
9 Correct 108 ms 2652 KB Output is correct
10 Correct 116 ms 2744 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 2732 KB Output is correct
2 Correct 104 ms 2780 KB Output is correct
3 Correct 98 ms 2732 KB Output is correct
4 Correct 103 ms 2652 KB Output is correct
5 Correct 122 ms 2712 KB Output is correct
6 Correct 99 ms 2724 KB Output is correct
7 Correct 103 ms 2692 KB Output is correct
8 Correct 135 ms 2940 KB Output is correct
9 Correct 155 ms 2900 KB Output is correct
10 Correct 101 ms 2648 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 2756 KB Output is correct
2 Correct 158 ms 2728 KB Output is correct
3 Correct 156 ms 2652 KB Output is correct
4 Correct 150 ms 2732 KB Output is correct
5 Correct 158 ms 2752 KB Output is correct
6 Correct 152 ms 2652 KB Output is correct
7 Correct 155 ms 2772 KB Output is correct
8 Correct 154 ms 2752 KB Output is correct
9 Correct 153 ms 2648 KB Output is correct
10 Correct 155 ms 2780 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 2716 KB Output is correct
2 Correct 109 ms 2652 KB Output is correct
3 Correct 111 ms 2780 KB Output is correct
4 Correct 124 ms 2768 KB Output is correct
5 Correct 134 ms 2760 KB Output is correct
6 Correct 107 ms 2652 KB Output is correct
7 Correct 107 ms 2712 KB Output is correct
8 Correct 109 ms 2768 KB Output is correct
9 Correct 108 ms 2652 KB Output is correct
10 Correct 116 ms 2744 KB Output is correct
11 Correct 99 ms 2732 KB Output is correct
12 Correct 104 ms 2780 KB Output is correct
13 Correct 98 ms 2732 KB Output is correct
14 Correct 103 ms 2652 KB Output is correct
15 Correct 122 ms 2712 KB Output is correct
16 Correct 99 ms 2724 KB Output is correct
17 Correct 103 ms 2692 KB Output is correct
18 Correct 135 ms 2940 KB Output is correct
19 Correct 155 ms 2900 KB Output is correct
20 Correct 101 ms 2648 KB Output is correct
21 Correct 153 ms 2756 KB Output is correct
22 Correct 158 ms 2728 KB Output is correct
23 Correct 156 ms 2652 KB Output is correct
24 Correct 150 ms 2732 KB Output is correct
25 Correct 158 ms 2752 KB Output is correct
26 Correct 152 ms 2652 KB Output is correct
27 Correct 155 ms 2772 KB Output is correct
28 Correct 154 ms 2752 KB Output is correct
29 Correct 153 ms 2648 KB Output is correct
30 Correct 155 ms 2780 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Incorrect 238 ms 2716 KB Output isn't correct
62 Halted 0 ms 0 KB -