oj.uz

Submission #888153

# Submission time Handle Problem Language Result Execution time Memory
888153 2023-12-16T08:44:56 Z Asamai Feast (NOI19_feast) C++17
63 / 100
 1000 ms 2900 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;
    while (low + eps < high) {
        db mid = (low + high) / 2;
        if (check(mid) >= k) {
            low = mid;
        }
        else {
            high = mid;
        }
    }

    db ans = low;
    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 138 ms 2652 KB Output is correct
2 Correct 114 ms 2648 KB Output is correct
3 Correct 116 ms 2652 KB Output is correct
4 Correct 116 ms 2652 KB Output is correct
5 Correct 123 ms 2752 KB Output is correct
6 Correct 113 ms 2652 KB Output is correct
7 Correct 118 ms 2716 KB Output is correct
8 Correct 114 ms 2652 KB Output is correct
9 Correct 121 ms 2648 KB Output is correct
10 Correct 113 ms 2648 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 2648 KB Output is correct
2 Correct 106 ms 2780 KB Output is correct
3 Correct 100 ms 2724 KB Output is correct
4 Correct 105 ms 2648 KB Output is correct
5 Execution timed out 1065 ms 2648 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 2900 KB Output is correct
2 Correct 176 ms 2648 KB Output is correct
3 Correct 153 ms 2752 KB Output is correct
4 Correct 152 ms 2648 KB Output is correct
5 Correct 152 ms 2676 KB Output is correct
6 Correct 155 ms 2764 KB Output is correct
7 Correct 183 ms 2776 KB Output is correct
8 Correct 153 ms 2748 KB Output is correct
9 Correct 155 ms 2652 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 1 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 372 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 1 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 372 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 464 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 372 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 464 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 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 480 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 138 ms 2652 KB Output is correct
2 Correct 114 ms 2648 KB Output is correct
3 Correct 116 ms 2652 KB Output is correct
4 Correct 116 ms 2652 KB Output is correct
5 Correct 123 ms 2752 KB Output is correct
6 Correct 113 ms 2652 KB Output is correct
7 Correct 118 ms 2716 KB Output is correct
8 Correct 114 ms 2652 KB Output is correct
9 Correct 121 ms 2648 KB Output is correct
10 Correct 113 ms 2648 KB Output is correct
11 Correct 100 ms 2648 KB Output is correct
12 Correct 106 ms 2780 KB Output is correct
13 Correct 100 ms 2724 KB Output is correct
14 Correct 105 ms 2648 KB Output is correct
15 Execution timed out 1065 ms 2648 KB Time limit exceeded
16 Halted 0 ms 0 KB -