oj.uz

Submission #1067440

# Submission time Handle Problem Language Result Execution time Memory
1067440 2024-08-20T17:01:53 Z vjudge1 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 164 ms 4444 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                 505
int N, K;
double A[MAX], B[MAX];

double dp[MAX][MAX], cost[MAX][MAX];
void process(void){
    cin >> N >> K;
    for (int i = 1; i <= N; ++i){
        cin >> A[i] >> B[i];
        if(B[i] == -1) B[i] = 1e9;
    }
    vector<int> order(N + 1);
    iota(order.begin(), order.end(), 0);

    sort(order.begin() + 1, order.end(), [&](int i, int j){
        return B[i] < B[j];
    });

    vector<double> vals;
    FOR(i, 0, N) FOR(j, 0, N) cost[i][j] = 1e9;
    for (int i = N; i >= 1; --i){
        vals.push_back(A[order[i]]);
        sort(vals.begin(), vals.end());
        double sm = 0;
        cost[i][0] = 0;
        for (int j = 0; j < (int)vals.size(); ++j){
            sm += vals[j];
            cost[i][j + 1] = sm;
        }
    }
    double ans = cost[1][K];
    for (int tak = 0; tak <= K; ++tak){
        for (int i = 0; i <= K; ++i){
            for (int j = 0; j <= K; ++j){
                dp[i][j] = 1e9;
            }
        }
        dp[0][0] = 0;
        for (int i = 1; i <= K; ++i){
            for (int j = 0; j <= i; ++j){
                dp[i][j] = dp[i - 1][j] + (double)A[order[i]] / (double)(tak + 1);
                if(j > 0)
                    minimize(dp[i][j], dp[i - 1][j - 1] + (double)B[order[i]] / (double)(j));
                if(j == tak){
                    int need = K - i;
                    minimize(ans, dp[i][j] + (double)cost[i + 1][need] / (double)(tak + 1));
                }
            }
        }
    }
    cout << setprecision(10) << fixed << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
5.0 / 5.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 3 ms 2652 KB Output is correct
6 Correct 6 ms 2908 KB Output is correct
7 Correct 22 ms 3464 KB Output is correct
8 Correct 65 ms 3928 KB Output is correct
9 Correct 144 ms 4444 KB Output is correct
10 Correct 53 ms 3676 KB Output is correct

Subtask #2
5.0 / 5.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 3 ms 2652 KB Output is correct
6 Correct 6 ms 2908 KB Output is correct
7 Correct 22 ms 3464 KB Output is correct
8 Correct 65 ms 3928 KB Output is correct
9 Correct 144 ms 4444 KB Output is correct
10 Correct 53 ms 3676 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 3068 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 8 ms 2980 KB Output is correct
15 Correct 56 ms 3832 KB Output is correct
16 Correct 55 ms 3832 KB Output is correct
17 Correct 65 ms 3676 KB Output is correct
18 Correct 150 ms 4444 KB Output is correct
19 Correct 150 ms 4440 KB Output is correct
20 Correct 149 ms 4444 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 1 ms 856 KB Output is correct
42 Correct 0 ms 860 KB Output is correct
43 Correct 1 ms 856 KB Output is correct
44 Correct 1 ms 860 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 1 ms 1116 KB Output is correct
50 Correct 1 ms 1116 KB Output is correct
51 Correct 2 ms 1112 KB Output is correct
52 Correct 2 ms 1112 KB Output is correct
53 Correct 1 ms 1116 KB Output is correct
54 Correct 1 ms 1116 KB Output is correct
55 Correct 1 ms 1120 KB Output is correct
56 Correct 1 ms 1120 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 1 ms 1116 KB Output is correct
59 Correct 1 ms 1116 KB Output is correct
60 Correct 1 ms 1116 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 4444 KB Output is correct
2 Correct 150 ms 4444 KB Output is correct
3 Correct 164 ms 4444 KB Output is correct
4 Correct 151 ms 4444 KB Output is correct
5 Correct 156 ms 4444 KB Output is correct
6 Correct 149 ms 4440 KB Output is correct
7 Correct 151 ms 4444 KB Output is correct

Subtask #7
23.0 / 23.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 3 ms 2652 KB Output is correct
6 Correct 6 ms 2908 KB Output is correct
7 Correct 22 ms 3464 KB Output is correct
8 Correct 65 ms 3928 KB Output is correct
9 Correct 144 ms 4444 KB Output is correct
10 Correct 53 ms 3676 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 3068 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 8 ms 2980 KB Output is correct
15 Correct 56 ms 3832 KB Output is correct
16 Correct 55 ms 3832 KB Output is correct
17 Correct 65 ms 3676 KB Output is correct
18 Correct 150 ms 4444 KB Output is correct
19 Correct 150 ms 4440 KB Output is correct
20 Correct 149 ms 4444 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 0 ms 604 KB Output is correct
42 Correct 0 ms 604 KB Output is correct
43 Correct 0 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 0 ms 604 KB Output is correct
48 Correct 0 ms 604 KB Output is correct
49 Correct 0 ms 604 KB Output is correct
50 Correct 0 ms 604 KB Output is correct
51 Correct 0 ms 604 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 0 ms 604 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 0 ms 604 KB Output is correct
57 Correct 0 ms 604 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 0 ms 604 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 1 ms 856 KB Output is correct
62 Correct 0 ms 860 KB Output is correct
63 Correct 1 ms 856 KB Output is correct
64 Correct 1 ms 860 KB Output is correct
65 Correct 1 ms 860 KB Output is correct
66 Correct 1 ms 860 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 1 ms 1116 KB Output is correct
69 Correct 1 ms 1116 KB Output is correct
70 Correct 1 ms 1116 KB Output is correct
71 Correct 2 ms 1112 KB Output is correct
72 Correct 2 ms 1112 KB Output is correct
73 Correct 1 ms 1116 KB Output is correct
74 Correct 1 ms 1116 KB Output is correct
75 Correct 1 ms 1120 KB Output is correct
76 Correct 1 ms 1120 KB Output is correct
77 Correct 1 ms 1116 KB Output is correct
78 Correct 1 ms 1116 KB Output is correct
79 Correct 1 ms 1116 KB Output is correct
80 Correct 1 ms 1116 KB Output is correct
81 Correct 160 ms 4444 KB Output is correct
82 Correct 150 ms 4444 KB Output is correct
83 Correct 164 ms 4444 KB Output is correct
84 Correct 151 ms 4444 KB Output is correct
85 Correct 156 ms 4444 KB Output is correct
86 Correct 149 ms 4440 KB Output is correct
87 Correct 151 ms 4444 KB Output is correct
88 Correct 4 ms 2648 KB Output is correct
89 Correct 4 ms 2652 KB Output is correct
90 Correct 6 ms 2968 KB Output is correct
91 Correct 6 ms 2908 KB Output is correct
92 Correct 24 ms 3420 KB Output is correct
93 Correct 24 ms 3464 KB Output is correct
94 Correct 68 ms 3936 KB Output is correct
95 Correct 71 ms 3928 KB Output is correct
96 Correct 113 ms 4188 KB Output is correct
97 Correct 114 ms 4184 KB Output is correct
98 Correct 55 ms 3672 KB Output is correct
99 Correct 57 ms 3676 KB Output is correct
100 Correct 55 ms 3928 KB Output is correct
101 Correct 57 ms 3672 KB Output is correct
102 Correct 57 ms 3676 KB Output is correct
103 Correct 57 ms 3672 KB Output is correct
104 Correct 57 ms 3676 KB Output is correct
105 Correct 53 ms 3672 KB Output is correct