답안 #995959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995959	2024-06-10T06:03:49 Z	vyshniak_n	Let's Win the Election (JOI22_ho_t3)	C++17	56 / 100	2500 ms	1008980 KB

Main

//#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];
// dp is (pos, cooperator, votes)

ld calc(ll x) {
    for (ll i = 1; i <= n; i++) {
        for (ll j = 0; j <= x; j++) {
            for (ll votes = 0; votes <= n - j; votes++) {
                dp[i][j][votes + j] = dp[i - 1][j][votes + j];

                if (j != 0 && b[order[i]] != inf) {
                    dp[i][j][votes + j] = min(dp[i][j][votes + j], 
                                              dp[i - 1][j - 1][votes + j - 1] + (double)b[order[i]] / (double)(j));
                }
                if (votes != 0) {
                    dp[i][j][votes + j] = min(dp[i][j][votes + j], 
                                              dp[i - 1][j][votes + j - 1] + (double)a[order[i]] / (double)(x + 1));
                }
            }
        }
    }

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

    for (ll i = 1; i <= n; i++)
        for (ll j = 0; j <= x; j++)
            for (ll votes = 0; votes < n - j; votes++)
                dp[i][j][votes + j] = 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
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	4564 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1166 ms	1007940 KB	Output is correct
6	Execution timed out	2580 ms	1008976 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	4564 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1166 ms	1007940 KB	Output is correct
6	Execution timed out	2580 ms	1008976 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14680 KB	Output is correct
2	Correct	2 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	14684 KB	Output is correct
9	Correct	2 ms	14684 KB	Output is correct
10	Correct	1 ms	14684 KB	Output is correct
11	Correct	2 ms	14868 KB	Output is correct
12	Correct	2 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	2 ms	14680 KB	Output is correct
2	Correct	2 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	14684 KB	Output is correct
9	Correct	2 ms	14684 KB	Output is correct
10	Correct	1 ms	14684 KB	Output is correct
11	Correct	2 ms	14868 KB	Output is correct
12	Correct	2 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	41596 KB	Output is correct
17	Correct	4 ms	41560 KB	Output is correct
18	Correct	4 ms	41564 KB	Output is correct
19	Correct	5 ms	41564 KB	Output is correct
20	Correct	4 ms	41560 KB	Output is correct
21	Correct	4 ms	41564 KB	Output is correct
22	Correct	4 ms	41548 KB	Output is correct
23	Correct	4 ms	41556 KB	Output is correct
24	Correct	4 ms	41572 KB	Output is correct
25	Correct	5 ms	41560 KB	Output is correct
26	Correct	4 ms	41564 KB	Output is correct
27	Correct	4 ms	41560 KB	Output is correct
28	Correct	4 ms	41564 KB	Output is correct
29	Correct	4 ms	41600 KB	Output is correct
30	Correct	4 ms	41564 KB	Output is correct
31	Correct	4 ms	41560 KB	Output is correct
32	Correct	4 ms	41564 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	41572 KB	Output is correct
36	Correct	4 ms	41564 KB	Output is correct
37	Correct	4 ms	41600 KB	Output is correct
38	Correct	4 ms	41564 KB	Output is correct
39	Correct	5 ms	41564 KB	Output is correct
40	Correct	4 ms	41564 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14680 KB	Output is correct
2	Correct	2 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	14684 KB	Output is correct
9	Correct	2 ms	14684 KB	Output is correct
10	Correct	1 ms	14684 KB	Output is correct
11	Correct	2 ms	14868 KB	Output is correct
12	Correct	2 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	41596 KB	Output is correct
17	Correct	4 ms	41560 KB	Output is correct
18	Correct	4 ms	41564 KB	Output is correct
19	Correct	5 ms	41564 KB	Output is correct
20	Correct	4 ms	41560 KB	Output is correct
21	Correct	4 ms	41564 KB	Output is correct
22	Correct	4 ms	41548 KB	Output is correct
23	Correct	4 ms	41556 KB	Output is correct
24	Correct	4 ms	41572 KB	Output is correct
25	Correct	5 ms	41560 KB	Output is correct
26	Correct	4 ms	41564 KB	Output is correct
27	Correct	4 ms	41560 KB	Output is correct
28	Correct	4 ms	41564 KB	Output is correct
29	Correct	4 ms	41600 KB	Output is correct
30	Correct	4 ms	41564 KB	Output is correct
31	Correct	4 ms	41560 KB	Output is correct
32	Correct	4 ms	41564 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	41572 KB	Output is correct
36	Correct	4 ms	41564 KB	Output is correct
37	Correct	4 ms	41600 KB	Output is correct
38	Correct	4 ms	41564 KB	Output is correct
39	Correct	5 ms	41564 KB	Output is correct
40	Correct	4 ms	41564 KB	Output is correct
41	Correct	24 ms	205632 KB	Output is correct
42	Correct	26 ms	205660 KB	Output is correct
43	Correct	34 ms	205808 KB	Output is correct
44	Correct	35 ms	205660 KB	Output is correct
45	Correct	57 ms	205660 KB	Output is correct
46	Correct	62 ms	205656 KB	Output is correct
47	Correct	81 ms	205576 KB	Output is correct
48	Correct	76 ms	205656 KB	Output is correct
49	Correct	114 ms	205656 KB	Output is correct
50	Correct	97 ms	205656 KB	Output is correct
51	Correct	149 ms	205656 KB	Output is correct
52	Correct	141 ms	205656 KB	Output is correct
53	Correct	87 ms	205816 KB	Output is correct
54	Correct	80 ms	205656 KB	Output is correct
55	Correct	79 ms	205656 KB	Output is correct
56	Correct	88 ms	205820 KB	Output is correct
57	Correct	82 ms	205656 KB	Output is correct
58	Correct	83 ms	205752 KB	Output is correct
59	Correct	82 ms	205816 KB	Output is correct
60	Correct	93 ms	205648 KB	Output is correct

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2581 ms	1008980 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	4564 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1166 ms	1007940 KB	Output is correct
6	Execution timed out	2580 ms	1008976 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-

답안 #995959

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 33.0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
0 / 5.0

Subtask #2
0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
33.0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0