답안 #908066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
908066	2024-01-16T07:40:58 Z	gaga999	Let's Win the Election (JOI22_ho_t3)	C++17	100 / 100	104 ms	604 KB

Main

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 505;
pii ar[N];
int ps[N];
double dp[N];

signed main()
{
    int n, k;
    rd(n, k);
    for (int i = 0; i < n; i++)
    {
        rd(ar[i].S, ar[i].F);
        if (!~ar[i].F)
            ar[i].F = INF;
    }
    sort(ar, ar + n);
    {
        priority_queue<int, vector<int>, greater<int>> pq;
        for (int i = n - 1; i >= k; i--)
            pq.push(ar[i].S);
        for (int i = k - 1; i >= 0; i--)
            pq.push(ar[i].S), ps[i] = ps[i + 1] + pq.top(), pq.pop();
    }
    double ans = ps[0];
    for (int t = 1; t < k; t++)
    {
        fill(dp, dp + k + 1, 1e12), dp[0] = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = t; j >= 0; j--)
            {
                dp[j] += ar[i].S / double(t + 1);
                if (j)
                    tmin(dp[j], dp[j - 1] + ar[i].F / double(j));
            }
            tmin(ans, dp[t] + ps[i + 1] / double(t + 1));
        }
    }
    printf("%.10lf\n", ans);
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	7 ms	348 KB	Output is correct
7	Correct	25 ms	348 KB	Output is correct
8	Correct	58 ms	344 KB	Output is correct
9	Correct	104 ms	424 KB	Output is correct
10	Correct	48 ms	348 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	7 ms	348 KB	Output is correct
7	Correct	25 ms	348 KB	Output is correct
8	Correct	58 ms	344 KB	Output is correct
9	Correct	104 ms	424 KB	Output is correct
10	Correct	48 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	10 ms	348 KB	Output is correct
13	Correct	9 ms	348 KB	Output is correct
14	Correct	10 ms	604 KB	Output is correct
15	Correct	54 ms	348 KB	Output is correct
16	Correct	52 ms	424 KB	Output is correct
17	Correct	58 ms	348 KB	Output is correct
18	Correct	97 ms	348 KB	Output is correct
19	Correct	98 ms	432 KB	Output is correct
20	Correct	98 ms	428 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	440 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	440 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	1 ms	512 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	600 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 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	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	440 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	1 ms	512 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	600 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 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	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	344 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct

Subtask #6
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	97 ms	424 KB	Output is correct
2	Correct	97 ms	424 KB	Output is correct
3	Correct	97 ms	348 KB	Output is correct
4	Correct	96 ms	352 KB	Output is correct
5	Correct	98 ms	348 KB	Output is correct
6	Correct	96 ms	428 KB	Output is correct
7	Correct	97 ms	424 KB	Output is correct

Subtask #7
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	7 ms	348 KB	Output is correct
7	Correct	25 ms	348 KB	Output is correct
8	Correct	58 ms	344 KB	Output is correct
9	Correct	104 ms	424 KB	Output is correct
10	Correct	48 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	10 ms	348 KB	Output is correct
13	Correct	9 ms	348 KB	Output is correct
14	Correct	10 ms	604 KB	Output is correct
15	Correct	54 ms	348 KB	Output is correct
16	Correct	52 ms	424 KB	Output is correct
17	Correct	58 ms	348 KB	Output is correct
18	Correct	97 ms	348 KB	Output is correct
19	Correct	98 ms	432 KB	Output is correct
20	Correct	98 ms	428 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	440 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	1 ms	512 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	600 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	344 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	1 ms	348 KB	Output is correct
58	Correct	1 ms	344 KB	Output is correct
59	Correct	1 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	1 ms	348 KB	Output is correct
66	Correct	1 ms	348 KB	Output is correct
67	Correct	1 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	1 ms	348 KB	Output is correct
72	Correct	1 ms	348 KB	Output is correct
73	Correct	1 ms	348 KB	Output is correct
74	Correct	1 ms	348 KB	Output is correct
75	Correct	1 ms	348 KB	Output is correct
76	Correct	1 ms	348 KB	Output is correct
77	Correct	1 ms	348 KB	Output is correct
78	Correct	1 ms	348 KB	Output is correct
79	Correct	1 ms	348 KB	Output is correct
80	Correct	1 ms	348 KB	Output is correct
81	Correct	97 ms	424 KB	Output is correct
82	Correct	97 ms	424 KB	Output is correct
83	Correct	97 ms	348 KB	Output is correct
84	Correct	96 ms	352 KB	Output is correct
85	Correct	98 ms	348 KB	Output is correct
86	Correct	96 ms	428 KB	Output is correct
87	Correct	97 ms	424 KB	Output is correct
88	Correct	2 ms	348 KB	Output is correct
89	Correct	2 ms	348 KB	Output is correct
90	Correct	7 ms	348 KB	Output is correct
91	Correct	7 ms	460 KB	Output is correct
92	Correct	25 ms	452 KB	Output is correct
93	Correct	25 ms	504 KB	Output is correct
94	Correct	55 ms	344 KB	Output is correct
95	Correct	55 ms	344 KB	Output is correct
96	Correct	81 ms	432 KB	Output is correct
97	Correct	80 ms	428 KB	Output is correct
98	Correct	48 ms	348 KB	Output is correct
99	Correct	48 ms	344 KB	Output is correct
100	Correct	48 ms	428 KB	Output is correct
101	Correct	48 ms	348 KB	Output is correct
102	Correct	48 ms	596 KB	Output is correct
103	Correct	48 ms	344 KB	Output is correct
104	Correct	52 ms	348 KB	Output is correct
105	Correct	48 ms	348 KB	Output is correct

답안 #908066

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 5.0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 33.0 / 33.0

Subtask #6 11.0 / 11.0

Subtask #7 23.0 / 23.0

Subtask #1
5.0 / 5.0

Subtask #2
5.0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
33.0 / 33.0

Subtask #6
11.0 / 11.0

Subtask #7
23.0 / 23.0