oj.uz

Submission #593763

# Submission time Handle Problem Language Result Execution time Memory
593763 2022-07-11T14:52:03 Z piOOE Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 47 ms 2300 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using db = double;

const int N = 501;

db dp[N][N]; //id, # of b's

db solved[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, K;
    cin >> n >> K;
    vector<int> a(n), b(n), ob(n), oa(n);
    int cntb = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
        if (b[i] != -1) {
            cntb += 1;
        }
    }
    iota(oa.begin(), oa.end(), 0), iota(ob.begin(), ob.end(), 0);
    sort(oa.begin(), oa.end(), [&a](int i, int j) {
        return a[i] < a[j];
    });
    sort(ob.begin(), ob.end(), [&](int i, int j) {
        if (b[i] == -1) return false;
        if (b[j] == -1) return true;
        return b[i] < b[j];
    });
    const db inf = 1e12;
    auto solve = [&](int mx) -> db {
        if (solved[mx] == 0) {
            for (int i = 0; i <= n; ++i) for (int j = 0; j <= n; ++j) dp[i][j] = inf;
            dp[0][0] = 0;
            db ans = inf;
            vector<bool> used(n);
            auto relax = [&](int cnt, db start) {
                int done = cnt;
                if (done > K) {
                    return;
                }
                db now = start;
                for (int j: oa) {
                    if (done < K && !used[j]) {
                        done += 1;
                        now += a[j] / db(mx + 1);
                    }
                }
                ans = min(ans, now);
            };
            for (int i = 1; i <= n; ++i) {
                int idx = ob[i - 1];
                relax(i - 1, dp[i - 1][mx]);
                if (b[idx] == -1) {
                    break;
                }
                for (int k = 0; k <= min(mx, i); ++k) {
                    int x = i - k;
                    if (x < 0 || dp[i - 1][k] == inf || x + k > K) {
                        continue;
                    }
                    dp[i][k] = min(dp[i][k], dp[i - 1][k] + a[idx] / db(mx + 1));
                    if (k != mx) {
                        dp[i][k + 1] = min(dp[i][k + 1], dp[i - 1][k] + b[idx] / db(k + 1));
                    } else {
                        relax(k + x - 1, dp[i - 1][k]);
                    }
                }
                used[idx] = true;
                relax(i, dp[i][mx]);
            }
            solved[mx] = ans;
        }
        return solved[mx];
    };
    int r = min(K, cntb);
    int x = r / 2;
    for (int k = 9; k > -1; --k) {
        db ansL = (x >= (1 << k) ? solve(x - (1 << k)) : inf);
        db ans = solve(x);
        db ansR = (x + (1 << k) <= r ? solve(x + (1 << k)) : inf);
        if (ansL <= ans && ansL <= ansR) {
            x -= (1 << k);
        } else if (ansR <= ans) {
            x += (1 << k);
        }
    }
    cout << fixed << setprecision(3) << solve(x);
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2248 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2248 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 2260 KB Output is correct
13 Correct 7 ms 2260 KB Output is correct
14 Correct 5 ms 2260 KB Output is correct
15 Correct 15 ms 2260 KB Output is correct
16 Correct 14 ms 2300 KB Output is correct
17 Correct 4 ms 2260 KB Output is correct
18 Correct 24 ms 2260 KB Output is correct
19 Correct 12 ms 2260 KB Output is correct
20 Correct 5 ms 2260 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 324 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 724 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 708 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 1 ms 716 KB Output is correct
47 Correct 2 ms 716 KB Output is correct
48 Correct 2 ms 724 KB Output is correct
49 Correct 2 ms 712 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 1 ms 724 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 724 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2260 KB Output is correct
2 Correct 37 ms 2260 KB Output is correct
3 Correct 47 ms 2260 KB Output is correct
4 Correct 34 ms 2260 KB Output is correct
5 Correct 33 ms 2260 KB Output is correct
6 Correct 32 ms 2260 KB Output is correct
7 Correct 33 ms 2260 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2248 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 2260 KB Output is correct
13 Correct 7 ms 2260 KB Output is correct
14 Correct 5 ms 2260 KB Output is correct
15 Correct 15 ms 2260 KB Output is correct
16 Correct 14 ms 2300 KB Output is correct
17 Correct 4 ms 2260 KB Output is correct
18 Correct 24 ms 2260 KB Output is correct
19 Correct 12 ms 2260 KB Output is correct
20 Correct 5 ms 2260 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 328 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 324 KB Output is correct
61 Correct 1 ms 724 KB Output is correct
62 Correct 1 ms 596 KB Output is correct
63 Correct 1 ms 724 KB Output is correct
64 Correct 1 ms 708 KB Output is correct
65 Correct 2 ms 724 KB Output is correct
66 Correct 1 ms 716 KB Output is correct
67 Correct 2 ms 716 KB Output is correct
68 Correct 2 ms 724 KB Output is correct
69 Correct 2 ms 712 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 2 ms 596 KB Output is correct
72 Correct 1 ms 724 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 596 KB Output is correct
76 Correct 1 ms 596 KB Output is correct
77 Correct 1 ms 596 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 724 KB Output is correct
81 Correct 38 ms 2260 KB Output is correct
82 Correct 37 ms 2260 KB Output is correct
83 Correct 47 ms 2260 KB Output is correct
84 Correct 34 ms 2260 KB Output is correct
85 Correct 33 ms 2260 KB Output is correct
86 Correct 32 ms 2260 KB Output is correct
87 Correct 33 ms 2260 KB Output is correct
88 Correct 4 ms 2260 KB Output is correct
89 Correct 4 ms 2260 KB Output is correct
90 Correct 6 ms 2296 KB Output is correct
91 Correct 8 ms 2260 KB Output is correct
92 Correct 13 ms 2260 KB Output is correct
93 Correct 13 ms 2296 KB Output is correct
94 Correct 25 ms 2260 KB Output is correct
95 Correct 22 ms 2300 KB Output is correct
96 Correct 33 ms 2260 KB Output is correct
97 Correct 29 ms 2260 KB Output is correct
98 Correct 16 ms 2296 KB Output is correct
99 Correct 14 ms 2260 KB Output is correct
100 Correct 16 ms 2300 KB Output is correct
101 Correct 20 ms 2260 KB Output is correct
102 Correct 18 ms 2260 KB Output is correct
103 Correct 18 ms 2260 KB Output is correct
104 Correct 19 ms 2296 KB Output is correct
105 Correct 14 ms 2296 KB Output is correct