oj.uz

Submission #890648

# Submission time Handle Problem Language Result Execution time Memory
890648 2023-12-21T17:57:22 Z arbuzick Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 1048576 KB 
#pragma GCC optimize("O3")
#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 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Runtime error 376 ms 995692 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 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Runtime error 376 ms 995692 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 14684 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 16728 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18776 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 3 ms 18776 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 3 ms 18780 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 3 ms 20828 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 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 16728 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18776 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 3 ms 18776 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 3 ms 18780 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 3 ms 20828 KB Output is correct
16 Correct 4 ms 43356 KB Output is correct
17 Correct 6 ms 57692 KB Output is correct
18 Correct 6 ms 57688 KB Output is correct
19 Correct 7 ms 65884 KB Output is correct
20 Correct 7 ms 66140 KB Output is correct
21 Correct 7 ms 66140 KB Output is correct
22 Correct 8 ms 70244 KB Output is correct
23 Correct 7 ms 70232 KB Output is correct
24 Correct 7 ms 70488 KB Output is correct
25 Correct 8 ms 76380 KB Output is correct
26 Correct 8 ms 76380 KB Output is correct
27 Correct 7 ms 66100 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 70124 KB Output is correct
31 Correct 7 ms 66140 KB Output is correct
32 Correct 7 ms 70236 KB Output is correct
33 Correct 7 ms 65884 KB Output is correct
34 Correct 7 ms 66000 KB Output is correct
35 Correct 9 ms 70236 KB Output is correct
36 Correct 7 ms 65884 KB Output is correct
37 Correct 7 ms 70236 KB Output is correct
38 Correct 7 ms 65884 KB Output is correct
39 Correct 7 ms 70236 KB Output is correct
40 Correct 7 ms 65884 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 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 16728 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18776 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 3 ms 18776 KB Output is correct
11 Correct 2 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 3 ms 18780 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 3 ms 20828 KB Output is correct
16 Correct 4 ms 43356 KB Output is correct
17 Correct 6 ms 57692 KB Output is correct
18 Correct 6 ms 57688 KB Output is correct
19 Correct 7 ms 65884 KB Output is correct
20 Correct 7 ms 66140 KB Output is correct
21 Correct 7 ms 66140 KB Output is correct
22 Correct 8 ms 70244 KB Output is correct
23 Correct 7 ms 70232 KB Output is correct
24 Correct 7 ms 70488 KB Output is correct
25 Correct 8 ms 76380 KB Output is correct
26 Correct 8 ms 76380 KB Output is correct
27 Correct 7 ms 66100 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 70124 KB Output is correct
31 Correct 7 ms 66140 KB Output is correct
32 Correct 7 ms 70236 KB Output is correct
33 Correct 7 ms 65884 KB Output is correct
34 Correct 7 ms 66000 KB Output is correct
35 Correct 9 ms 70236 KB Output is correct
36 Correct 7 ms 65884 KB Output is correct
37 Correct 7 ms 70236 KB Output is correct
38 Correct 7 ms 65884 KB Output is correct
39 Correct 7 ms 70236 KB Output is correct
40 Correct 7 ms 65884 KB Output is correct
41 Correct 31 ms 320468 KB Output is correct
42 Correct 31 ms 320416 KB Output is correct
43 Correct 47 ms 441432 KB Output is correct
44 Correct 49 ms 441684 KB Output is correct
45 Correct 71 ms 603728 KB Output is correct
46 Correct 82 ms 603728 KB Output is correct
47 Correct 106 ms 724748 KB Output is correct
48 Correct 89 ms 725072 KB Output is correct
49 Correct 113 ms 766920 KB Output is correct
50 Correct 113 ms 766108 KB Output is correct
51 Correct 138 ms 781140 KB Output is correct
52 Correct 145 ms 781140 KB Output is correct
53 Correct 88 ms 725012 KB Output is correct
54 Correct 93 ms 724632 KB Output is correct
55 Correct 88 ms 724752 KB Output is correct
56 Correct 90 ms 724716 KB Output is correct
57 Correct 88 ms 724560 KB Output is correct
58 Correct 87 ms 724580 KB Output is correct
59 Correct 89 ms 724560 KB Output is correct
60 Correct 98 ms 724564 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2896 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 4440 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Runtime error 376 ms 995692 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -