oj.uz

Submission #1025649

# Submission time Handle Problem Language Result Execution time Memory
1025649 2024-07-17T08:27:25 Z Gr1sen Feast (NOI19_feast) C++17
39 / 100
 1000 ms 148048 KB 
#include<iostream>
#include<vector>
#include<iomanip>
#include<algorithm>

using namespace std;

#define ll long long
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define pi pair<ld, ll>
#define ppi pair<ld, pi>
#define vp vector<ppi>
#define vvp vector<vp>

ll n, k;
vi L;
vvp M;

ppi oink(ld c, ll p = 0, bool q = 0) {
    if (p == n) return {0, {0, 0}};
    if (M[p][q].first != -1) return M[p][q];
    if (q) {
        if (L[p] >= 0) {
            ppi a = oink(c, p+1, 1);
            a.first += L[p];
            a.second.second += L[p];
            return M[p][q] = a;
        }
        ppi a = oink(c, p+1, 1);
        a.first += L[p];
        a.second.second += L[p];
        ppi b = oink(c, p+1, 0);
        return M[p][q] = max(a, b);
    }
    ppi a = oink(c, p+1, 1);
    a.first += L[p] - c;
    a.second.second += L[p];
    a.second.first++;
    ppi b = oink(c, p+1, 0);
    return M[p][q] = max(a, b);
}

/*pi oinkoink(ld c, ll p = 0, bool q = 0) {
    if (p == n) return {0, 0};
    if (M[p][q].first != -1) return M[p][q];
    if (q) {
        if (L[p] >= 0) {
            pi a = oink(c, p+1, 1);
            a.first += L[p];
            a.second += L[p];
            return M[p][q] = a;
        }
        pi a = oink(c, p+1, 1);
        a.first += L[p];
        a.second += L[p];
        pi b = oink(c, p+1, 0);
        return M[p][q] = max(a, b);
    }
    pi a = oink(c, p+1, 1);
    a.first += L[p] - c;
    a.second += L[p];
    pi b = oink(c, p+1, 0);
    return M[p][q] = max(a, b);
}
*/

int main() {
    cin >> n >> k;
    L = vi(n);
    for (auto &i : L) cin >> i;

    ld l = 0, r = 1000000000000000;
    ll ans;
    while (l < r) {
        //cerr << l << " " << r << endl;
        M = vvp(n, vp(2, {-1, {-1, -1}}));
        ld m = (l+r)/2;
        ppi a = oink(m);
        if (a.second.first == k) {
            ans = a.second.second;
            break;
        }
        if (a.second.first > k) {
            l = m;
            continue;
        }
        r = m;
    }
    cout << ans << "\n";
}

/*
6 1
1 -2 3 -1 5 -6

6 2
1 2 3 -10 5 6

6 4
-1 -2 -1 0 -5 -1
*/

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 912 ms 146672 KB Output is correct
2 Correct 966 ms 144768 KB Output is correct
3 Correct 899 ms 146008 KB Output is correct
4 Correct 770 ms 144824 KB Output is correct
5 Correct 832 ms 146004 KB Output is correct
6 Correct 886 ms 147028 KB Output is correct
7 Correct 998 ms 147612 KB Output is correct
8 Correct 958 ms 146096 KB Output is correct
9 Correct 725 ms 148048 KB Output is correct
10 Correct 975 ms 147656 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 137 ms 440 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 137 ms 440 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 137 ms 440 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 9 ms 1384 KB Output is correct
22 Execution timed out 1080 ms 1368 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

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