oj.uz

Submission #890646

# Submission time Handle Problem Language Result Execution time Memory
890646 2023-12-21T17:55:51 Z arbuzick Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 1048576 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

constexpr int maxn = 101, inf = 1e9 + 7;

double dp[maxn][maxn][maxn][maxn];

void solve() {
    int n, k;
    cin >> n >> k;
    vector<double> a(n), b(n);
    vector<pair<double, int>> s_b;
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
        if (b[i] > 0) {
            s_b.emplace_back(b[i], i);
        } else {
            s_b.emplace_back(inf, i);
        }
    }
    sort(s_b.begin(), s_b.end());
    for (int i = 0; i <= n; ++i) {
        for (int cnt_all = 0; cnt_all < k; ++cnt_all) {
            for (int cnt_nw = 0; cnt_nw <= i && cnt_nw <= cnt_all; ++cnt_nw) {
                for (int cnt_used = 0; cnt_used <= k; ++cnt_used) {
                    dp[i][cnt_all][cnt_nw][cnt_used] = inf;
                }
            }
        }
    }
    for (int cnt_all = 0; cnt_all < k; ++cnt_all) {
        dp[0][cnt_all][0][0] = 0;
    }
    double ans = inf;
    for (int i = 0; i < n; ++i) {
        for (int cnt_all = 0; cnt_all < k; ++cnt_all) {
            for (int cnt_nw = 0; cnt_nw <= i && cnt_nw <= cnt_all; ++cnt_nw) {
                for (int cnt_used = 0; cnt_used < k; ++cnt_used) {
                    if (s_b[i].first < 10000 && cnt_nw < cnt_all) {
                        dp[i + 1][cnt_all][cnt_nw + 1][cnt_used + 1] = min(dp[i + 1][cnt_all][cnt_nw + 1][cnt_used + 1], dp[i][cnt_all][cnt_nw][cnt_used] + s_b[i].first / (cnt_nw + 1));
                        if (cnt_used + 1 == k && cnt_nw + 1 == cnt_all) {
                            ans = min(ans, dp[i + 1][cnt_all][cnt_nw + 1][cnt_used + 1]);
                        }
                    }
                    dp[i + 1][cnt_all][cnt_nw][cnt_used + 1] = min(dp[i + 1][cnt_all][cnt_nw][cnt_used + 1], dp[i][cnt_all][cnt_nw][cnt_used] + a[s_b[i].second] / (cnt_all + 1));
                    if (cnt_used + 1 == k && cnt_nw == cnt_all) {
                        ans = min(ans, dp[i + 1][cnt_all][cnt_nw][cnt_used + 1]);
                    }
                    dp[i + 1][cnt_all][cnt_nw][cnt_used] = min(dp[i + 1][cnt_all][cnt_nw][cnt_used], dp[i][cnt_all][cnt_nw][cnt_used]);
                }
            }
        }
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(25);
    cout << fixed;
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Runtime error 367 ms 995784 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Runtime error 367 ms 995784 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18936 KB Output is correct
7 Correct 3 ms 20828 KB Output is correct
8 Correct 2 ms 18780 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 2 ms 18928 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 20956 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18936 KB Output is correct
7 Correct 3 ms 20828 KB Output is correct
8 Correct 2 ms 18780 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 2 ms 18928 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 20956 KB Output is correct
16 Correct 5 ms 43356 KB Output is correct
17 Correct 7 ms 57692 KB Output is correct
18 Correct 6 ms 57692 KB Output is correct
19 Correct 7 ms 66116 KB Output is correct
20 Correct 7 ms 65884 KB Output is correct
21 Correct 7 ms 66004 KB Output is correct
22 Correct 8 ms 70236 KB Output is correct
23 Correct 9 ms 70236 KB Output is correct
24 Correct 7 ms 70236 KB Output is correct
25 Correct 10 ms 76348 KB Output is correct
26 Correct 8 ms 76296 KB Output is correct
27 Correct 7 ms 65896 KB Output is correct
28 Correct 7 ms 70236 KB Output is correct
29 Correct 7 ms 65884 KB Output is correct
30 Correct 7 ms 70236 KB Output is correct
31 Correct 8 ms 65980 KB Output is correct
32 Correct 7 ms 70236 KB Output is correct
33 Correct 7 ms 66140 KB Output is correct
34 Correct 7 ms 65884 KB Output is correct
35 Correct 7 ms 70172 KB Output is correct
36 Correct 7 ms 66116 KB Output is correct
37 Correct 7 ms 70236 KB Output is correct
38 Correct 7 ms 66108 KB Output is correct
39 Correct 8 ms 70392 KB Output is correct
40 Correct 7 ms 66024 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18936 KB Output is correct
7 Correct 3 ms 20828 KB Output is correct
8 Correct 2 ms 18780 KB Output is correct
9 Correct 2 ms 18780 KB Output is correct
10 Correct 2 ms 18780 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 2 ms 18928 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 20956 KB Output is correct
16 Correct 5 ms 43356 KB Output is correct
17 Correct 7 ms 57692 KB Output is correct
18 Correct 6 ms 57692 KB Output is correct
19 Correct 7 ms 66116 KB Output is correct
20 Correct 7 ms 65884 KB Output is correct
21 Correct 7 ms 66004 KB Output is correct
22 Correct 8 ms 70236 KB Output is correct
23 Correct 9 ms 70236 KB Output is correct
24 Correct 7 ms 70236 KB Output is correct
25 Correct 10 ms 76348 KB Output is correct
26 Correct 8 ms 76296 KB Output is correct
27 Correct 7 ms 65896 KB Output is correct
28 Correct 7 ms 70236 KB Output is correct
29 Correct 7 ms 65884 KB Output is correct
30 Correct 7 ms 70236 KB Output is correct
31 Correct 8 ms 65980 KB Output is correct
32 Correct 7 ms 70236 KB Output is correct
33 Correct 7 ms 66140 KB Output is correct
34 Correct 7 ms 65884 KB Output is correct
35 Correct 7 ms 70172 KB Output is correct
36 Correct 7 ms 66116 KB Output is correct
37 Correct 7 ms 70236 KB Output is correct
38 Correct 7 ms 66108 KB Output is correct
39 Correct 8 ms 70392 KB Output is correct
40 Correct 7 ms 66024 KB Output is correct
41 Correct 36 ms 320432 KB Output is correct
42 Correct 33 ms 320336 KB Output is correct
43 Correct 48 ms 441428 KB Output is correct
44 Correct 47 ms 441416 KB Output is correct
45 Correct 73 ms 603728 KB Output is correct
46 Correct 73 ms 603732 KB Output is correct
47 Correct 93 ms 674644 KB Output is correct
48 Correct 91 ms 673788 KB Output is correct
49 Correct 134 ms 717020 KB Output is correct
50 Correct 121 ms 721024 KB Output is correct
51 Correct 168 ms 749904 KB Output is correct
52 Correct 151 ms 762192 KB Output is correct
53 Correct 93 ms 711700 KB Output is correct
54 Correct 93 ms 712880 KB Output is correct
55 Correct 94 ms 724744 KB Output is correct
56 Correct 93 ms 724588 KB Output is correct
57 Correct 92 ms 724564 KB Output is correct
58 Correct 94 ms 724908 KB Output is correct
59 Correct 105 ms 724900 KB Output is correct
60 Correct 95 ms 724808 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Runtime error 367 ms 995784 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -