oj.uz

Submission #1042897

# Submission time Handle Problem Language Result Execution time Memory
1042897 2024-08-03T14:15:01 Z LOLOLO Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 140 ms 4464 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 500 + 10;
double a[N], b[N];
double f[N][N], cost[N][N];
int order[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        if (b[i] < 0)
            b[i] = 1e9;

        order[i] = i;
    }

    sort(order + 1, order + 1 + n, [&] (int x, int y) {return b[x] < b[y];});

    vector <double> lst;
    for (int i = n; i >= 1; i--) {
        lst.pb(a[order[i]]);
        sort(all(lst));
        double sum = 0;
        cost[i][0] = 0;

        for (int j = 0; j < sz(lst); j++) {
            sum += lst[j];
            cost[i][j + 1] = sum;
        }
    }

    double ans = cost[1][k];

    for (int num = 0; num <= k; num++) {
        for (int i = 0; i <= k; i++) {
            for (int j = 0; j <= k; j++)
                f[i][j] = 1e9;
        }

        f[0][0] = 0;

        for (int i = 1; i <= k; i++) {
            for (int j = 0; j <= i; j++) {
                f[i][j] = f[i - 1][j] + a[order[i]] / double(num + 1);

                if (j > 0) {
                    f[i][j] = min(f[i][j], f[i - 1][j - 1] + b[order[i]] / double(j));
                }

                if (j == num) {
                    int r = k - i;
                    ans = min(ans, f[i][j] + cost[i + 1][r] / double(num + 1));
                }
            }
        }
    }

    cout << fixed << setprecision(10) << ans << '\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 4 ms 2904 KB Output is correct
7 Correct 19 ms 3416 KB Output is correct
8 Correct 52 ms 3932 KB Output is correct
9 Correct 119 ms 4232 KB Output is correct
10 Correct 43 ms 3672 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 4 ms 2904 KB Output is correct
7 Correct 19 ms 3416 KB Output is correct
8 Correct 52 ms 3932 KB Output is correct
9 Correct 119 ms 4232 KB Output is correct
10 Correct 43 ms 3672 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 2908 KB Output is correct
13 Correct 6 ms 2908 KB Output is correct
14 Correct 7 ms 2904 KB Output is correct
15 Correct 45 ms 3676 KB Output is correct
16 Correct 45 ms 3928 KB Output is correct
17 Correct 44 ms 3676 KB Output is correct
18 Correct 124 ms 4456 KB Output is correct
19 Correct 126 ms 4444 KB Output is correct
20 Correct 118 ms 4460 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 500 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 400 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 0 ms 980 KB Output is correct
44 Correct 0 ms 976 KB Output is correct
45 Correct 1 ms 860 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 2 ms 1120 KB Output is correct
50 Correct 1 ms 1124 KB Output is correct
51 Correct 2 ms 1248 KB Output is correct
52 Correct 2 ms 1124 KB Output is correct
53 Correct 1 ms 1128 KB Output is correct
54 Correct 1 ms 1120 KB Output is correct
55 Correct 1 ms 1124 KB Output is correct
56 Correct 1 ms 1128 KB Output is correct
57 Correct 1 ms 1128 KB Output is correct
58 Correct 1 ms 1124 KB Output is correct
59 Correct 1 ms 1124 KB Output is correct
60 Correct 1 ms 1112 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 4440 KB Output is correct
2 Correct 124 ms 4444 KB Output is correct
3 Correct 121 ms 4452 KB Output is correct
4 Correct 120 ms 4456 KB Output is correct
5 Correct 124 ms 4444 KB Output is correct
6 Correct 120 ms 4464 KB Output is correct
7 Correct 140 ms 4460 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 4 ms 2904 KB Output is correct
7 Correct 19 ms 3416 KB Output is correct
8 Correct 52 ms 3932 KB Output is correct
9 Correct 119 ms 4232 KB Output is correct
10 Correct 43 ms 3672 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 2908 KB Output is correct
13 Correct 6 ms 2908 KB Output is correct
14 Correct 7 ms 2904 KB Output is correct
15 Correct 45 ms 3676 KB Output is correct
16 Correct 45 ms 3928 KB Output is correct
17 Correct 44 ms 3676 KB Output is correct
18 Correct 124 ms 4456 KB Output is correct
19 Correct 126 ms 4444 KB Output is correct
20 Correct 118 ms 4460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 ms 604 KB Output is correct
42 Correct 1 ms 500 KB Output is correct
43 Correct 0 ms 604 KB Output is correct
44 Correct 0 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 604 KB Output is correct
47 Correct 0 ms 604 KB Output is correct
48 Correct 0 ms 600 KB Output is correct
49 Correct 0 ms 604 KB Output is correct
50 Correct 0 ms 604 KB Output is correct
51 Correct 0 ms 400 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 0 ms 604 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 0 ms 604 KB Output is correct
57 Correct 0 ms 604 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 0 ms 604 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 1 ms 860 KB Output is correct
62 Correct 1 ms 860 KB Output is correct
63 Correct 0 ms 980 KB Output is correct
64 Correct 0 ms 976 KB Output is correct
65 Correct 1 ms 860 KB Output is correct
66 Correct 1 ms 860 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 1 ms 1116 KB Output is correct
69 Correct 2 ms 1120 KB Output is correct
70 Correct 1 ms 1124 KB Output is correct
71 Correct 2 ms 1248 KB Output is correct
72 Correct 2 ms 1124 KB Output is correct
73 Correct 1 ms 1128 KB Output is correct
74 Correct 1 ms 1120 KB Output is correct
75 Correct 1 ms 1124 KB Output is correct
76 Correct 1 ms 1128 KB Output is correct
77 Correct 1 ms 1128 KB Output is correct
78 Correct 1 ms 1124 KB Output is correct
79 Correct 1 ms 1124 KB Output is correct
80 Correct 1 ms 1112 KB Output is correct
81 Correct 120 ms 4440 KB Output is correct
82 Correct 124 ms 4444 KB Output is correct
83 Correct 121 ms 4452 KB Output is correct
84 Correct 120 ms 4456 KB Output is correct
85 Correct 124 ms 4444 KB Output is correct
86 Correct 120 ms 4464 KB Output is correct
87 Correct 140 ms 4460 KB Output is correct
88 Correct 4 ms 2648 KB Output is correct
89 Correct 4 ms 2652 KB Output is correct
90 Correct 5 ms 2908 KB Output is correct
91 Correct 6 ms 2908 KB Output is correct
92 Correct 19 ms 3420 KB Output is correct
93 Correct 21 ms 3488 KB Output is correct
94 Correct 54 ms 3932 KB Output is correct
95 Correct 54 ms 3932 KB Output is correct
96 Correct 90 ms 4188 KB Output is correct
97 Correct 110 ms 4184 KB Output is correct
98 Correct 44 ms 3672 KB Output is correct
99 Correct 44 ms 3676 KB Output is correct
100 Correct 44 ms 3860 KB Output is correct
101 Correct 45 ms 3860 KB Output is correct
102 Correct 44 ms 3672 KB Output is correct
103 Correct 47 ms 3676 KB Output is correct
104 Correct 46 ms 3792 KB Output is correct
105 Correct 44 ms 3864 KB Output is correct