oj.uz

Submission #923767

# Submission time Handle Problem Language Result Execution time Memory
923767 2024-02-07T18:06:01 Z Karoot Feast (NOI19_feast) C++17
71 / 100
 982 ms 134844 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;

    return mem[index][inInterval] = (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)) : 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);

    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 950 ms 131276 KB Output is correct
2 Correct 947 ms 133404 KB Output is correct
3 Correct 951 ms 134844 KB Output is correct
4 Correct 982 ms 134056 KB Output is correct
5 Correct 973 ms 133460 KB Output is correct
6 Correct 951 ms 131364 KB Output is correct
7 Correct 964 ms 131328 KB Output is correct
8 Correct 970 ms 133640 KB Output is correct
9 Correct 968 ms 131664 KB Output is correct
10 Correct 974 ms 132784 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 949 ms 132080 KB Output is correct
2 Correct 959 ms 134616 KB Output is correct
3 Correct 956 ms 131664 KB Output is correct
4 Correct 941 ms 133052 KB Output is correct
5 Correct 972 ms 131664 KB Output is correct
6 Correct 956 ms 131800 KB Output is correct
7 Correct 937 ms 134840 KB Output is correct
8 Correct 965 ms 134152 KB Output is correct
9 Correct 949 ms 131156 KB Output is correct
10 Correct 978 ms 134224 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 943 ms 133460 KB Output is correct
2 Correct 951 ms 131924 KB Output is correct
3 Correct 967 ms 133204 KB Output is correct
4 Correct 961 ms 132124 KB Output is correct
5 Correct 950 ms 133184 KB Output is correct
6 Correct 961 ms 133896 KB Output is correct
7 Correct 973 ms 134308 KB Output is correct
8 Correct 974 ms 133236 KB Output is correct
9 Correct 977 ms 134736 KB Output is correct
10 Correct 950 ms 134324 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 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 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 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 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 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 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 4440 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 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 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 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 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 4440 KB Output is correct
21 Correct 6 ms 5212 KB Output is correct
22 Correct 6 ms 5212 KB Output is correct
23 Correct 6 ms 5212 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 6 ms 5212 KB Output is correct
26 Correct 6 ms 5212 KB Output is correct
27 Correct 6 ms 5316 KB Output is correct
28 Correct 6 ms 5212 KB Output is correct
29 Correct 6 ms 5304 KB Output is correct
30 Correct 6 ms 5212 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 950 ms 131276 KB Output is correct
2 Correct 947 ms 133404 KB Output is correct
3 Correct 951 ms 134844 KB Output is correct
4 Correct 982 ms 134056 KB Output is correct
5 Correct 973 ms 133460 KB Output is correct
6 Correct 951 ms 131364 KB Output is correct
7 Correct 964 ms 131328 KB Output is correct
8 Correct 970 ms 133640 KB Output is correct
9 Correct 968 ms 131664 KB Output is correct
10 Correct 974 ms 132784 KB Output is correct
11 Correct 949 ms 132080 KB Output is correct
12 Correct 959 ms 134616 KB Output is correct
13 Correct 956 ms 131664 KB Output is correct
14 Correct 941 ms 133052 KB Output is correct
15 Correct 972 ms 131664 KB Output is correct
16 Correct 956 ms 131800 KB Output is correct
17 Correct 937 ms 134840 KB Output is correct
18 Correct 965 ms 134152 KB Output is correct
19 Correct 949 ms 131156 KB Output is correct
20 Correct 978 ms 134224 KB Output is correct
21 Correct 943 ms 133460 KB Output is correct
22 Correct 951 ms 131924 KB Output is correct
23 Correct 967 ms 133204 KB Output is correct
24 Correct 961 ms 132124 KB Output is correct
25 Correct 950 ms 133184 KB Output is correct
26 Correct 961 ms 133896 KB Output is correct
27 Correct 973 ms 134308 KB Output is correct
28 Correct 974 ms 133236 KB Output is correct
29 Correct 977 ms 134736 KB Output is correct
30 Correct 950 ms 134324 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 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 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 1 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 4440 KB Output is correct
51 Correct 6 ms 5212 KB Output is correct
52 Correct 6 ms 5212 KB Output is correct
53 Correct 6 ms 5212 KB Output is correct
54 Correct 6 ms 5212 KB Output is correct
55 Correct 6 ms 5212 KB Output is correct
56 Correct 6 ms 5212 KB Output is correct
57 Correct 6 ms 5316 KB Output is correct
58 Correct 6 ms 5212 KB Output is correct
59 Correct 6 ms 5304 KB Output is correct
60 Correct 6 ms 5212 KB Output is correct
61 Incorrect 959 ms 131936 KB Output isn't correct
62 Halted 0 ms 0 KB -