oj.uz

Submission #593687

# Submission time Handle Problem Language Result Execution time Memory
593687 2022-07-11T13:43:31 Z piOOE Let's Win the Election (JOI22_ho_t3) C++17
61 / 100
 2500 ms 984608 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using db = double;

const int N = 501;

db dp[N][N][N]; //id, b, a

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), oa(n), ob(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 <= mx; ++j) {
                    for (int k = 0; k <= K - j; ++k) {
                        dp[i][j][k] = inf;
                    }
                }
            }
            dp[0][0][0] = 0;
            for (int i = 1; i <= n; ++i) {
                //don't take
                for (int j = 0; j <= mx; ++j) {
                    for (int k = 0; k <= min(i, K) - j; ++k) {
                        dp[i][j][k] = dp[i - 1][j][k];
                    }
                }
                //take a
                int idx = ob[i - 1];
                for (int j = 0; j <= min(i, mx); ++j) {
                    for (int k = 1; k <= min(i, K) - j; ++k) {
                        dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][k - 1] + a[idx] / db(mx + 1));
                    }
                }
                if (b[idx] != -1) {
                    for (int j = 1; j <= min(i, mx); ++j) {
                        for (int k = 0; k <= min(i, K) - j; ++k) {
                            dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k] + b[idx] / db(j));
                        }
                    }
                }
            }
            solved[mx] = dp[n][mx][K - mx];
        }
        return solved[mx];
    };
    int r = min(K, cntb);
    int x = 0;
    for (int k = 10; 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(20) << 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4564 KB Output is correct
6 Correct 3 ms 4692 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 5 ms 6120 KB Output is correct
10 Correct 3 ms 5620 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4564 KB Output is correct
6 Correct 3 ms 4692 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 5 ms 6120 KB Output is correct
10 Correct 3 ms 5620 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 495 ms 298384 KB Output is correct
13 Correct 458 ms 255332 KB Output is correct
14 Correct 271 ms 192672 KB Output is correct
15 Correct 2088 ms 690572 KB Output is correct
16 Correct 1679 ms 506608 KB Output is correct
17 Correct 435 ms 193484 KB Output is correct
18 Execution timed out 2637 ms 984608 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 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 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1452 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1364 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1620 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 1 ms 1364 KB Output is correct
34 Correct 1 ms 1364 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1364 KB Output is correct
37 Correct 1 ms 1620 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1620 KB Output is correct
40 Correct 1 ms 1364 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 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1364 KB Output is correct
24 Correct 1 ms 1452 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1364 KB Output is correct
29 Correct 1 ms 1364 KB Output is correct
30 Correct 1 ms 1620 KB Output is correct
31 Correct 1 ms 1364 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 1 ms 1364 KB Output is correct
34 Correct 1 ms 1364 KB Output is correct
35 Correct 1 ms 1364 KB Output is correct
36 Correct 1 ms 1364 KB Output is correct
37 Correct 1 ms 1620 KB Output is correct
38 Correct 1 ms 1364 KB Output is correct
39 Correct 1 ms 1620 KB Output is correct
40 Correct 1 ms 1364 KB Output is correct
41 Correct 3 ms 5844 KB Output is correct
42 Correct 3 ms 6612 KB Output is correct
43 Correct 6 ms 10580 KB Output is correct
44 Correct 7 ms 12116 KB Output is correct
45 Correct 15 ms 20052 KB Output is correct
46 Correct 16 ms 20040 KB Output is correct
47 Correct 22 ms 26316 KB Output is correct
48 Correct 22 ms 26324 KB Output is correct
49 Correct 29 ms 32724 KB Output is correct
50 Correct 20 ms 26400 KB Output is correct
51 Correct 34 ms 38988 KB Output is correct
52 Correct 32 ms 32728 KB Output is correct
53 Correct 15 ms 26324 KB Output is correct
54 Correct 19 ms 26324 KB Output is correct
55 Correct 26 ms 26324 KB Output is correct
56 Correct 18 ms 26424 KB Output is correct
57 Correct 27 ms 26420 KB Output is correct
58 Correct 23 ms 26396 KB Output is correct
59 Correct 25 ms 26396 KB Output is correct
60 Correct 26 ms 26404 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4564 KB Output is correct
6 Correct 3 ms 4692 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 5 ms 6120 KB Output is correct
10 Correct 3 ms 5620 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 495 ms 298384 KB Output is correct
13 Correct 458 ms 255332 KB Output is correct
14 Correct 271 ms 192672 KB Output is correct
15 Correct 2088 ms 690572 KB Output is correct
16 Correct 1679 ms 506608 KB Output is correct
17 Correct 435 ms 193484 KB Output is correct
18 Execution timed out 2637 ms 984608 KB Time limit exceeded
19 Halted 0 ms 0 KB -