oj.uz

Submission #885816

# Submission time Handle Problem Language Result Execution time Memory
885816 2023-12-10T19:23:38 Z EJIC_B_KEDAX Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 1038952 KB 
#ifdef LOCAL
    //#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <random>

#ifndef LOCAL
    //#pragma GCC optimize("O3")
    //#pragma GCC optimize("Ofast")
    //#pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937_64 mt(418);

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    // srand(time(0));
    init();
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
    if (a.y < b.y) {
        return true;
    }
    if (a.y > b.y) {
        return false;
    }
    return a.x < b.x;
}

double dp[510][510][510]{};

void solve() {
    int n, k;
    cin >> n >> k;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].x >> a[i].y;
        if (a[i].y == -1) {
            a[i].y = INT32_MAX / 2;
        }
    }
    double ans = 2e18;
    double dell[510];
    for (int i = 1; i < 510; i++) {
        dell[i] = 1.0 / i;
    }
    // vector<vector<vector<double>>> dp(n + 1, vector<vector<double>>(k + 1, vector<double>(n + 1, 2e18)));
    for (int i = 0; i < 510; i++) {
        for (int j = 0; j < 510; j++) {
            for (int l = 0; l < 510; l++) {
                dp[i][j][l] = 2e18;
            }
        }
    }
    for (int ll = 0; ll <= n; ll++) {
        sort(all(a), cmp);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= k; j++) {
                if (i == j - 1) {
                    for (int l = 0; l <= n; l++) {
                        dp[i + 1][j][l] = 3e18;
                    }
                } else {
                    dp[i + 1][j][ll] = 3e18;
                }
            }
        }
        dp[0][0][0] = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= k; j++) {
                if (i == j - 1) {
                    for (int l = 0; l <= n; l++) {
                        dp[i + 1][j][l] = min(dp[i + 1][j][l], dp[i][j][l]);
                        if (j > 0) {
                            dp[i + 1][j][l] = min(dp[i + 1][j][l], dp[i][j - 1][l] + a[i].x * dell[ll + 1]);
                            if (l > 0) {
                                dp[i + 1][j][l] = min(dp[i + 1][j][l], dp[i][j - 1][l - 1] + a[i].y * dell[l]);
                            }
                        }
                    }
                } else {
                    dp[i + 1][j][ll] = min(dp[i + 1][j][ll], dp[i][j][ll]);
                    if (j > 0) {
                        dp[i + 1][j][ll] = min(dp[i + 1][j][ll], dp[i][j - 1][ll] + a[i].x * dell[ll + 1]);
                    }
                }
            }
        }
        for (int i = ll; i <= n; i++) {
            ans = min(ans, dp[n][k][i]);
        }
    }
    cout << ans << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 1038604 KB Output is correct
2 Correct 185 ms 1038772 KB Output is correct
3 Correct 188 ms 1038568 KB Output is correct
4 Correct 185 ms 1038788 KB Output is correct
5 Correct 380 ms 1038804 KB Output is correct
6 Correct 598 ms 1038808 KB Output is correct
7 Correct 1222 ms 1038808 KB Output is correct
8 Correct 1999 ms 1038804 KB Output is correct
9 Execution timed out 2542 ms 1038572 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 1038604 KB Output is correct
2 Correct 185 ms 1038772 KB Output is correct
3 Correct 188 ms 1038568 KB Output is correct
4 Correct 185 ms 1038788 KB Output is correct
5 Correct 380 ms 1038804 KB Output is correct
6 Correct 598 ms 1038808 KB Output is correct
7 Correct 1222 ms 1038808 KB Output is correct
8 Correct 1999 ms 1038804 KB Output is correct
9 Execution timed out 2542 ms 1038572 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 1038636 KB Output is correct
2 Correct 198 ms 1038660 KB Output is correct
3 Correct 188 ms 1038680 KB Output is correct
4 Correct 184 ms 1038620 KB Output is correct
5 Correct 186 ms 1038676 KB Output is correct
6 Correct 186 ms 1038640 KB Output is correct
7 Correct 218 ms 1038752 KB Output is correct
8 Correct 186 ms 1038728 KB Output is correct
9 Correct 189 ms 1038676 KB Output is correct
10 Correct 187 ms 1038668 KB Output is correct
11 Correct 186 ms 1038672 KB Output is correct
12 Correct 207 ms 1038612 KB Output is correct
13 Correct 184 ms 1038560 KB Output is correct
14 Correct 188 ms 1038624 KB Output is correct
15 Correct 209 ms 1038672 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 1038636 KB Output is correct
2 Correct 198 ms 1038660 KB Output is correct
3 Correct 188 ms 1038680 KB Output is correct
4 Correct 184 ms 1038620 KB Output is correct
5 Correct 186 ms 1038676 KB Output is correct
6 Correct 186 ms 1038640 KB Output is correct
7 Correct 218 ms 1038752 KB Output is correct
8 Correct 186 ms 1038728 KB Output is correct
9 Correct 189 ms 1038676 KB Output is correct
10 Correct 187 ms 1038668 KB Output is correct
11 Correct 186 ms 1038672 KB Output is correct
12 Correct 207 ms 1038612 KB Output is correct
13 Correct 184 ms 1038560 KB Output is correct
14 Correct 188 ms 1038624 KB Output is correct
15 Correct 209 ms 1038672 KB Output is correct
16 Correct 184 ms 1038672 KB Output is correct
17 Correct 222 ms 1038664 KB Output is correct
18 Correct 187 ms 1038812 KB Output is correct
19 Correct 193 ms 1038628 KB Output is correct
20 Correct 204 ms 1038676 KB Output is correct
21 Correct 192 ms 1038780 KB Output is correct
22 Correct 192 ms 1038672 KB Output is correct
23 Correct 184 ms 1038552 KB Output is correct
24 Correct 196 ms 1038672 KB Output is correct
25 Correct 214 ms 1038668 KB Output is correct
26 Correct 185 ms 1038676 KB Output is correct
27 Correct 188 ms 1038588 KB Output is correct
28 Correct 187 ms 1038744 KB Output is correct
29 Correct 189 ms 1038704 KB Output is correct
30 Correct 218 ms 1038676 KB Output is correct
31 Correct 184 ms 1038640 KB Output is correct
32 Correct 186 ms 1038564 KB Output is correct
33 Correct 224 ms 1038864 KB Output is correct
34 Correct 185 ms 1038640 KB Output is correct
35 Correct 184 ms 1038556 KB Output is correct
36 Correct 186 ms 1038740 KB Output is correct
37 Correct 188 ms 1038676 KB Output is correct
38 Correct 187 ms 1038680 KB Output is correct
39 Correct 185 ms 1038584 KB Output is correct
40 Correct 190 ms 1038672 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 1038636 KB Output is correct
2 Correct 198 ms 1038660 KB Output is correct
3 Correct 188 ms 1038680 KB Output is correct
4 Correct 184 ms 1038620 KB Output is correct
5 Correct 186 ms 1038676 KB Output is correct
6 Correct 186 ms 1038640 KB Output is correct
7 Correct 218 ms 1038752 KB Output is correct
8 Correct 186 ms 1038728 KB Output is correct
9 Correct 189 ms 1038676 KB Output is correct
10 Correct 187 ms 1038668 KB Output is correct
11 Correct 186 ms 1038672 KB Output is correct
12 Correct 207 ms 1038612 KB Output is correct
13 Correct 184 ms 1038560 KB Output is correct
14 Correct 188 ms 1038624 KB Output is correct
15 Correct 209 ms 1038672 KB Output is correct
16 Correct 184 ms 1038672 KB Output is correct
17 Correct 222 ms 1038664 KB Output is correct
18 Correct 187 ms 1038812 KB Output is correct
19 Correct 193 ms 1038628 KB Output is correct
20 Correct 204 ms 1038676 KB Output is correct
21 Correct 192 ms 1038780 KB Output is correct
22 Correct 192 ms 1038672 KB Output is correct
23 Correct 184 ms 1038552 KB Output is correct
24 Correct 196 ms 1038672 KB Output is correct
25 Correct 214 ms 1038668 KB Output is correct
26 Correct 185 ms 1038676 KB Output is correct
27 Correct 188 ms 1038588 KB Output is correct
28 Correct 187 ms 1038744 KB Output is correct
29 Correct 189 ms 1038704 KB Output is correct
30 Correct 218 ms 1038676 KB Output is correct
31 Correct 184 ms 1038640 KB Output is correct
32 Correct 186 ms 1038564 KB Output is correct
33 Correct 224 ms 1038864 KB Output is correct
34 Correct 185 ms 1038640 KB Output is correct
35 Correct 184 ms 1038556 KB Output is correct
36 Correct 186 ms 1038740 KB Output is correct
37 Correct 188 ms 1038676 KB Output is correct
38 Correct 187 ms 1038680 KB Output is correct
39 Correct 185 ms 1038584 KB Output is correct
40 Correct 190 ms 1038672 KB Output is correct
41 Correct 187 ms 1038672 KB Output is correct
42 Correct 194 ms 1038560 KB Output is correct
43 Correct 189 ms 1038676 KB Output is correct
44 Correct 187 ms 1038668 KB Output is correct
45 Correct 211 ms 1038952 KB Output is correct
46 Correct 190 ms 1038676 KB Output is correct
47 Correct 201 ms 1038568 KB Output is correct
48 Correct 209 ms 1038676 KB Output is correct
49 Correct 194 ms 1038700 KB Output is correct
50 Correct 193 ms 1038792 KB Output is correct
51 Correct 220 ms 1038592 KB Output is correct
52 Correct 197 ms 1038560 KB Output is correct
53 Correct 192 ms 1038676 KB Output is correct
54 Correct 196 ms 1038820 KB Output is correct
55 Correct 215 ms 1038592 KB Output is correct
56 Correct 191 ms 1038592 KB Output is correct
57 Correct 200 ms 1038616 KB Output is correct
58 Correct 192 ms 1038676 KB Output is correct
59 Correct 201 ms 1038672 KB Output is correct
60 Correct 195 ms 1038832 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 1038604 KB Output is correct
2 Correct 185 ms 1038772 KB Output is correct
3 Correct 188 ms 1038568 KB Output is correct
4 Correct 185 ms 1038788 KB Output is correct
5 Correct 380 ms 1038804 KB Output is correct
6 Correct 598 ms 1038808 KB Output is correct
7 Correct 1222 ms 1038808 KB Output is correct
8 Correct 1999 ms 1038804 KB Output is correct
9 Execution timed out 2542 ms 1038572 KB Time limit exceeded
10 Halted 0 ms 0 KB -