oj.uz

Submission #888148

# Submission time Handle Problem Language Result Execution time Memory
888148 2023-12-16T08:41:41 Z Asamai Feast (NOI19_feast) C++17
45 / 100
 1000 ms 5720 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-6;

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;
    while (low + eps < high) {
        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 125 ms 5456 KB Output is correct
2 Correct 128 ms 5608 KB Output is correct
3 Correct 137 ms 5664 KB Output is correct
4 Correct 128 ms 5632 KB Output is correct
5 Correct 128 ms 5460 KB Output is correct
6 Correct 126 ms 5456 KB Output is correct
7 Correct 127 ms 5524 KB Output is correct
8 Correct 128 ms 5720 KB Output is correct
9 Correct 126 ms 5536 KB Output is correct
10 Correct 130 ms 5464 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 3676 KB Output is correct
2 Correct 115 ms 3928 KB Output is correct
3 Correct 112 ms 3676 KB Output is correct
4 Correct 117 ms 3880 KB Output is correct
5 Execution timed out 1087 ms 5456 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1054 ms 5604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 0 ms 348 KB Output is correct
10 Correct 1 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 0 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 0 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 476 KB Output is correct
22 Correct 1 ms 500 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 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 2 ms 348 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 5456 KB Output is correct
2 Correct 128 ms 5608 KB Output is correct
3 Correct 137 ms 5664 KB Output is correct
4 Correct 128 ms 5632 KB Output is correct
5 Correct 128 ms 5460 KB Output is correct
6 Correct 126 ms 5456 KB Output is correct
7 Correct 127 ms 5524 KB Output is correct
8 Correct 128 ms 5720 KB Output is correct
9 Correct 126 ms 5536 KB Output is correct
10 Correct 130 ms 5464 KB Output is correct
11 Correct 114 ms 3676 KB Output is correct
12 Correct 115 ms 3928 KB Output is correct
13 Correct 112 ms 3676 KB Output is correct
14 Correct 117 ms 3880 KB Output is correct
15 Execution timed out 1087 ms 5456 KB Time limit exceeded
16 Halted 0 ms 0 KB -