oj.uz

Submission #923766

# Submission time Handle Problem Language Result Execution time Memory
923766 2024-02-07T18:02:51 Z Karoot Feast (NOI19_feast) C++17
71 / 100
 968 ms 85724 KB 
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
#include <chrono>

#define all(x)  (x).begin(), (x).end()
#define rall(x)  (x).rbegin(), (x).rend()

using namespace std;

typedef long long ll;

ll linf = 1e15+1;

inline void scoobydoobydoo(){
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

const int MAXN = 3e5+3;
ll arr[MAXN];
pair<long double, ll> mem[MAXN][2];
ll n, k; 
bool isVisited[MAXN][2];

long double lambda;

pair<long double, ll> dp(ll index, int inInterval){
    if (index == n) return {0, 0};
    if (isVisited[index][inInterval])return mem[index][inInterval];
    isVisited[index][inInterval] = true;

    if (inInterval)return mem[index][inInterval] = max(make_pair(dp(index+1, 1).first+arr[index], dp(index+1, 1).second), make_pair(dp(index+1, 0).first, dp(index+1, 0).second));
    
    return mem[index][inInterval] = max(make_pair(dp(index+1, 0).first, dp(index+1, 0).second), make_pair(dp(index+1, 1).first + arr[index] - lambda, dp(index+1, 1).second+1));   
}

bool check(long double la){
    lambda = la;
    for (int i = 0; i < n; i++){
        isVisited[i][0] = false;
        isVisited[i][1] = false;
    }
    //cout << la << " " << dp(0, 0).first << " " << dp(0, 0).second << endl;
    return dp(0,0).second >= k; 
}

int main(){
    scoobydoobydoo();
    cin >> n >> k;
    for (int i = 0; i < n; i++)cin >> arr[i];

    long double b = 0;
    for (int i = 0; i < n; i++)b += abs(arr[i]);

    long double a = 0;

    chrono::time_point<chrono::system_clock> start, end;

    start = chrono::system_clock::now();

    while (a+(1e-3) < b){
        long double mid = (a+b)/2.0;
        if (check(mid)){
            a = mid;
        } else {
            b = mid;
        }
        end = chrono::system_clock::now();
        chrono::duration<double> elapsed_seconds = end - start;
        if (elapsed_seconds.count() > 0.9)break;
    }

    check(a);
    //cout << fixed << setprecision(5);
    //cout << a << endl;

    //cout << check(6.99) << endl;
    //cout << check(7.99) << endl;

    ll ans = round(a*k + mem[0][0].first);
    
    cout << ans << endl;


    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 81236 KB Output is correct
2 Correct 935 ms 82260 KB Output is correct
3 Correct 948 ms 83112 KB Output is correct
4 Correct 952 ms 82680 KB Output is correct
5 Correct 959 ms 82344 KB Output is correct
6 Correct 957 ms 81492 KB Output is correct
7 Correct 952 ms 81492 KB Output is correct
8 Correct 963 ms 82768 KB Output is correct
9 Correct 942 ms 81492 KB Output is correct
10 Correct 933 ms 82288 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 933 ms 81744 KB Output is correct
2 Correct 956 ms 83280 KB Output is correct
3 Correct 918 ms 81748 KB Output is correct
4 Correct 938 ms 82128 KB Output is correct
5 Correct 961 ms 81324 KB Output is correct
6 Correct 925 ms 81488 KB Output is correct
7 Correct 939 ms 83276 KB Output is correct
8 Correct 946 ms 82776 KB Output is correct
9 Correct 946 ms 81232 KB Output is correct
10 Correct 933 ms 82868 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 943 ms 82512 KB Output is correct
2 Correct 961 ms 81492 KB Output is correct
3 Correct 968 ms 82256 KB Output is correct
4 Correct 952 ms 81696 KB Output is correct
5 Correct 949 ms 82280 KB Output is correct
6 Correct 962 ms 82512 KB Output is correct
7 Correct 951 ms 82900 KB Output is correct
8 Correct 953 ms 82304 KB Output is correct
9 Correct 955 ms 83076 KB Output is correct
10 Correct 953 ms 82908 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4508 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4508 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4440 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 7 ms 4956 KB Output is correct
22 Correct 7 ms 4956 KB Output is correct
23 Correct 8 ms 4960 KB Output is correct
24 Correct 7 ms 4952 KB Output is correct
25 Correct 8 ms 4956 KB Output is correct
26 Correct 8 ms 4956 KB Output is correct
27 Correct 8 ms 4952 KB Output is correct
28 Correct 7 ms 4956 KB Output is correct
29 Correct 7 ms 4972 KB Output is correct
30 Correct 7 ms 4956 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 81236 KB Output is correct
2 Correct 935 ms 82260 KB Output is correct
3 Correct 948 ms 83112 KB Output is correct
4 Correct 952 ms 82680 KB Output is correct
5 Correct 959 ms 82344 KB Output is correct
6 Correct 957 ms 81492 KB Output is correct
7 Correct 952 ms 81492 KB Output is correct
8 Correct 963 ms 82768 KB Output is correct
9 Correct 942 ms 81492 KB Output is correct
10 Correct 933 ms 82288 KB Output is correct
11 Correct 933 ms 81744 KB Output is correct
12 Correct 956 ms 83280 KB Output is correct
13 Correct 918 ms 81748 KB Output is correct
14 Correct 938 ms 82128 KB Output is correct
15 Correct 961 ms 81324 KB Output is correct
16 Correct 925 ms 81488 KB Output is correct
17 Correct 939 ms 83276 KB Output is correct
18 Correct 946 ms 82776 KB Output is correct
19 Correct 946 ms 81232 KB Output is correct
20 Correct 933 ms 82868 KB Output is correct
21 Correct 943 ms 82512 KB Output is correct
22 Correct 961 ms 81492 KB Output is correct
23 Correct 968 ms 82256 KB Output is correct
24 Correct 952 ms 81696 KB Output is correct
25 Correct 949 ms 82280 KB Output is correct
26 Correct 962 ms 82512 KB Output is correct
27 Correct 951 ms 82900 KB Output is correct
28 Correct 953 ms 82304 KB Output is correct
29 Correct 955 ms 83076 KB Output is correct
30 Correct 953 ms 82908 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4508 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 2 ms 4440 KB Output is correct
42 Correct 2 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 2 ms 4444 KB Output is correct
46 Correct 2 ms 4440 KB Output is correct
47 Correct 2 ms 4444 KB Output is correct
48 Correct 2 ms 4444 KB Output is correct
49 Correct 2 ms 4444 KB Output is correct
50 Correct 2 ms 4444 KB Output is correct
51 Correct 7 ms 4956 KB Output is correct
52 Correct 7 ms 4956 KB Output is correct
53 Correct 8 ms 4960 KB Output is correct
54 Correct 7 ms 4952 KB Output is correct
55 Correct 8 ms 4956 KB Output is correct
56 Correct 8 ms 4956 KB Output is correct
57 Correct 8 ms 4952 KB Output is correct
58 Correct 7 ms 4956 KB Output is correct
59 Correct 7 ms 4972 KB Output is correct
60 Correct 7 ms 4956 KB Output is correct
61 Correct 952 ms 81592 KB Output is correct
62 Correct 960 ms 83172 KB Output is correct
63 Correct 965 ms 81428 KB Output is correct
64 Incorrect 967 ms 85724 KB Output isn't correct
65 Halted 0 ms 0 KB -