oj.uz

답안 #995987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995987 2024-06-10T06:38:30 Z vyshniak_n Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 835 ms 1010204 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")
 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
using namespace std;
 
#include <random>
mt19937 rnd(time(0));
 
const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 5e2 + 10;
const ll mod = 998244353;
const ll LOG = 20;
const ll K = 1e3 + 20;

double dp[N][N][N];
ll n, k, a[N], b[N], order[N];

ld calc(ll x) {
    for (ll i = 1; i <= n; i++) {
        for (ll j = 0; j <= min(i, k); j++) {
            if (i == j) {
                for (ll cnt = 0; cnt <= min(j, x); cnt++) {
                    if (j) {
                        dp[i][j][cnt] = min(dp[i][j][cnt],
                                            dp[i - 1][j - 1][cnt] + (double)a[order[i]] / (double)(x + 1));
                    }
                    if (cnt && b[order[i]] != inf) {
                        dp[i][j][cnt] = min(dp[i][j][cnt],
                                            dp[i - 1][j - 1][cnt - 1] + (double)b[order[i]] / (double)(cnt));
                    }
                } 
            } else {
                dp[i][j][x] = dp[i - 1][j][x];
                if (j)
                    dp[i][j][x] = min(dp[i][j][x], dp[i - 1][j - 1][x] + (double)a[order[i]] / (double)(x + 1));
            }
        }
    }

    ld res = dp[n][k][x];

    for (ll i = 1; i <= n; i++) {
        for (ll j = 0; j <= min(i, k); j++) {
            if (i == j) {
                for (ll cnt = 0; cnt <= min(j, x); cnt++)
                    dp[i][j][cnt] = inf;
            } else {
                dp[i][j][x] = inf;
            }
        }
    }
    return res;
}
 
void solve() {
    cin >> n >> k;

    for (ll i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        if (b[i] == -1)
            b[i] = inf;
    }

    for (ll i = 1; i <= n; i++)
        order[i] = i;

    sort(order + 1, order + n + 1, [&](const ll &i, const ll &j) -> bool {
        if (b[i] == b[j])
            return a[i] < a[j];
        return b[i] < b[j];
    });

    for (ll i = 0; i <= n; i++)
        for (ll j = 0; j <= n; j++)
            for (ll votes = 0; votes <= n; votes++)
                dp[i][j][votes] = inf;
    dp[0][0][0] = 0;

    ld ans = inf;
    for (ll i = 0; i <= k; i++)
        ans = min(ans, calc(i));

    cout << fixed << setprecision(10) << ans << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    int tests = 1;
    //cin >> tests;
 
    while (tests--) 
        solve();
    return 0;
}
/*
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 358 ms 1009748 KB Output is correct
6 Correct 334 ms 1010052 KB Output is correct
7 Correct 436 ms 1009752 KB Output is correct
8 Correct 612 ms 1009816 KB Output is correct
9 Correct 746 ms 1009744 KB Output is correct
10 Correct 622 ms 1009944 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 358 ms 1009748 KB Output is correct
6 Correct 334 ms 1010052 KB Output is correct
7 Correct 436 ms 1009752 KB Output is correct
8 Correct 612 ms 1009816 KB Output is correct
9 Correct 746 ms 1009744 KB Output is correct
10 Correct 622 ms 1009944 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 341 ms 1009820 KB Output is correct
13 Correct 349 ms 1009648 KB Output is correct
14 Correct 337 ms 1009844 KB Output is correct
15 Correct 590 ms 1009748 KB Output is correct
16 Correct 555 ms 1009748 KB Output is correct
17 Correct 543 ms 1009740 KB Output is correct
18 Correct 783 ms 1009880 KB Output is correct
19 Correct 742 ms 1009960 KB Output is correct
20 Correct 691 ms 1010000 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14932 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14932 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 4 ms 41564 KB Output is correct
17 Correct 4 ms 41568 KB Output is correct
18 Correct 4 ms 41564 KB Output is correct
19 Correct 4 ms 41564 KB Output is correct
20 Correct 4 ms 41564 KB Output is correct
21 Correct 4 ms 41592 KB Output is correct
22 Correct 4 ms 41564 KB Output is correct
23 Correct 4 ms 41564 KB Output is correct
24 Correct 4 ms 41564 KB Output is correct
25 Correct 4 ms 41564 KB Output is correct
26 Correct 3 ms 41564 KB Output is correct
27 Correct 4 ms 41564 KB Output is correct
28 Correct 4 ms 41552 KB Output is correct
29 Correct 4 ms 41564 KB Output is correct
30 Correct 4 ms 41564 KB Output is correct
31 Correct 4 ms 41564 KB Output is correct
32 Correct 4 ms 41560 KB Output is correct
33 Correct 4 ms 41564 KB Output is correct
34 Correct 4 ms 41564 KB Output is correct
35 Correct 4 ms 41564 KB Output is correct
36 Correct 4 ms 41548 KB Output is correct
37 Correct 5 ms 41564 KB Output is correct
38 Correct 4 ms 41564 KB Output is correct
39 Correct 4 ms 41564 KB Output is correct
40 Correct 4 ms 41552 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 14684 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 1 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14932 KB Output is correct
12 Correct 1 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 14684 KB Output is correct
16 Correct 4 ms 41564 KB Output is correct
17 Correct 4 ms 41568 KB Output is correct
18 Correct 4 ms 41564 KB Output is correct
19 Correct 4 ms 41564 KB Output is correct
20 Correct 4 ms 41564 KB Output is correct
21 Correct 4 ms 41592 KB Output is correct
22 Correct 4 ms 41564 KB Output is correct
23 Correct 4 ms 41564 KB Output is correct
24 Correct 4 ms 41564 KB Output is correct
25 Correct 4 ms 41564 KB Output is correct
26 Correct 3 ms 41564 KB Output is correct
27 Correct 4 ms 41564 KB Output is correct
28 Correct 4 ms 41552 KB Output is correct
29 Correct 4 ms 41564 KB Output is correct
30 Correct 4 ms 41564 KB Output is correct
31 Correct 4 ms 41564 KB Output is correct
32 Correct 4 ms 41560 KB Output is correct
33 Correct 4 ms 41564 KB Output is correct
34 Correct 4 ms 41564 KB Output is correct
35 Correct 4 ms 41564 KB Output is correct
36 Correct 4 ms 41548 KB Output is correct
37 Correct 5 ms 41564 KB Output is correct
38 Correct 4 ms 41564 KB Output is correct
39 Correct 4 ms 41564 KB Output is correct
40 Correct 4 ms 41552 KB Output is correct
41 Correct 17 ms 205736 KB Output is correct
42 Correct 17 ms 205660 KB Output is correct
43 Correct 17 ms 205660 KB Output is correct
44 Correct 17 ms 205660 KB Output is correct
45 Correct 17 ms 205660 KB Output is correct
46 Correct 18 ms 205676 KB Output is correct
47 Correct 19 ms 205656 KB Output is correct
48 Correct 19 ms 205828 KB Output is correct
49 Correct 19 ms 205728 KB Output is correct
50 Correct 20 ms 205660 KB Output is correct
51 Correct 21 ms 205660 KB Output is correct
52 Correct 21 ms 205648 KB Output is correct
53 Correct 18 ms 205568 KB Output is correct
54 Correct 19 ms 205648 KB Output is correct
55 Correct 18 ms 205656 KB Output is correct
56 Correct 20 ms 205652 KB Output is correct
57 Correct 18 ms 205820 KB Output is correct
58 Correct 19 ms 205656 KB Output is correct
59 Correct 20 ms 205656 KB Output is correct
60 Correct 18 ms 205660 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 1010000 KB Output is correct
2 Correct 814 ms 1009744 KB Output is correct
3 Correct 817 ms 1009748 KB Output is correct
4 Correct 808 ms 1009748 KB Output is correct
5 Correct 834 ms 1009744 KB Output is correct
6 Correct 814 ms 1009992 KB Output is correct
7 Correct 830 ms 1009960 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 358 ms 1009748 KB Output is correct
6 Correct 334 ms 1010052 KB Output is correct
7 Correct 436 ms 1009752 KB Output is correct
8 Correct 612 ms 1009816 KB Output is correct
9 Correct 746 ms 1009744 KB Output is correct
10 Correct 622 ms 1009944 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 341 ms 1009820 KB Output is correct
13 Correct 349 ms 1009648 KB Output is correct
14 Correct 337 ms 1009844 KB Output is correct
15 Correct 590 ms 1009748 KB Output is correct
16 Correct 555 ms 1009748 KB Output is correct
17 Correct 543 ms 1009740 KB Output is correct
18 Correct 783 ms 1009880 KB Output is correct
19 Correct 742 ms 1009960 KB Output is correct
20 Correct 691 ms 1010000 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 1 ms 14684 KB Output is correct
23 Correct 1 ms 14684 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 1 ms 14684 KB Output is correct
27 Correct 1 ms 14684 KB Output is correct
28 Correct 1 ms 14680 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14684 KB Output is correct
31 Correct 2 ms 14932 KB Output is correct
32 Correct 1 ms 14684 KB Output is correct
33 Correct 1 ms 14684 KB Output is correct
34 Correct 1 ms 10588 KB Output is correct
35 Correct 1 ms 14684 KB Output is correct
36 Correct 4 ms 41564 KB Output is correct
37 Correct 4 ms 41568 KB Output is correct
38 Correct 4 ms 41564 KB Output is correct
39 Correct 4 ms 41564 KB Output is correct
40 Correct 4 ms 41564 KB Output is correct
41 Correct 4 ms 41592 KB Output is correct
42 Correct 4 ms 41564 KB Output is correct
43 Correct 4 ms 41564 KB Output is correct
44 Correct 4 ms 41564 KB Output is correct
45 Correct 4 ms 41564 KB Output is correct
46 Correct 3 ms 41564 KB Output is correct
47 Correct 4 ms 41564 KB Output is correct
48 Correct 4 ms 41552 KB Output is correct
49 Correct 4 ms 41564 KB Output is correct
50 Correct 4 ms 41564 KB Output is correct
51 Correct 4 ms 41564 KB Output is correct
52 Correct 4 ms 41560 KB Output is correct
53 Correct 4 ms 41564 KB Output is correct
54 Correct 4 ms 41564 KB Output is correct
55 Correct 4 ms 41564 KB Output is correct
56 Correct 4 ms 41548 KB Output is correct
57 Correct 5 ms 41564 KB Output is correct
58 Correct 4 ms 41564 KB Output is correct
59 Correct 4 ms 41564 KB Output is correct
60 Correct 4 ms 41552 KB Output is correct
61 Correct 17 ms 205736 KB Output is correct
62 Correct 17 ms 205660 KB Output is correct
63 Correct 17 ms 205660 KB Output is correct
64 Correct 17 ms 205660 KB Output is correct
65 Correct 17 ms 205660 KB Output is correct
66 Correct 18 ms 205676 KB Output is correct
67 Correct 19 ms 205656 KB Output is correct
68 Correct 19 ms 205828 KB Output is correct
69 Correct 19 ms 205728 KB Output is correct
70 Correct 20 ms 205660 KB Output is correct
71 Correct 21 ms 205660 KB Output is correct
72 Correct 21 ms 205648 KB Output is correct
73 Correct 18 ms 205568 KB Output is correct
74 Correct 19 ms 205648 KB Output is correct
75 Correct 18 ms 205656 KB Output is correct
76 Correct 20 ms 205652 KB Output is correct
77 Correct 18 ms 205820 KB Output is correct
78 Correct 19 ms 205656 KB Output is correct
79 Correct 20 ms 205656 KB Output is correct
80 Correct 18 ms 205660 KB Output is correct
81 Correct 835 ms 1010000 KB Output is correct
82 Correct 814 ms 1009744 KB Output is correct
83 Correct 817 ms 1009748 KB Output is correct
84 Correct 808 ms 1009748 KB Output is correct
85 Correct 834 ms 1009744 KB Output is correct
86 Correct 814 ms 1009992 KB Output is correct
87 Correct 830 ms 1009960 KB Output is correct
88 Correct 291 ms 1009748 KB Output is correct
89 Correct 288 ms 1009748 KB Output is correct
90 Correct 333 ms 1009748 KB Output is correct
91 Correct 324 ms 1009744 KB Output is correct
92 Correct 462 ms 1010204 KB Output is correct
93 Correct 479 ms 1009788 KB Output is correct
94 Correct 623 ms 1009748 KB Output is correct
95 Correct 631 ms 1010004 KB Output is correct
96 Correct 751 ms 1009748 KB Output is correct
97 Correct 728 ms 1009748 KB Output is correct
98 Correct 587 ms 1009892 KB Output is correct
99 Correct 578 ms 1009996 KB Output is correct
100 Correct 591 ms 1010000 KB Output is correct
101 Correct 608 ms 1010000 KB Output is correct
102 Correct 591 ms 1010000 KB Output is correct
103 Correct 599 ms 1009748 KB Output is correct
104 Correct 576 ms 1010004 KB Output is correct
105 Correct 631 ms 1010000 KB Output is correct