oj.uz

Submission #907989

# Submission time Handle Problem Language Result Execution time Memory
907989 2024-01-16T06:55:36 Z gaga999 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 2466 ms 2560 KB 
#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];
double dp[N][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);
    double ans = 1e12;
    auto slv = [&](int t) -> double
    {
        for (int i = 0; i <= t; i++)
            fill(dp[i], dp[i] + k + 1, 1e12);
        dp[0][0] = 0;
        for (int p = 0; p < n; p++)
        {
            for (int j = min(k, p + 1); j > 0; j--)
            {
                for (int i = min(t, p + 1); i >= 0; i--)
                {
                    if (i)
                        tmin(dp[i][j], dp[i - 1][j - 1] + ar[p].F / double(i));
                    tmin(dp[i][j], dp[i][j - 1] + ar[p].S / double(t + 1));
                }
            }
        }
        tmin(ans, dp[t][k]);
        return dp[t][k];
    };
    int l = 0, r = k;
    while (l < r - 2)
    {
        int m1 = (l * 2 + r) / 3, m2 = (l + r * 2) / 3;
        if (slv(m1) < slv(m2))
            r = m2;
        else
            l = m1;
    }
    for (int i = l; i <= r; i++)
        slv(i);
    printf("%.10lf\n", ans);
}

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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 34 ms 776 KB Output is correct
7 Correct 118 ms 1084 KB Output is correct
8 Correct 228 ms 1412 KB Output is correct
9 Correct 305 ms 1616 KB Output is correct
10 Correct 217 ms 1360 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 34 ms 776 KB Output is correct
7 Correct 118 ms 1084 KB Output is correct
8 Correct 228 ms 1412 KB Output is correct
9 Correct 305 ms 1616 KB Output is correct
10 Correct 217 ms 1360 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 377 ms 912 KB Output is correct
13 Correct 237 ms 1108 KB Output is correct
14 Correct 135 ms 604 KB Output is correct
15 Correct 1777 ms 2044 KB Output is correct
16 Correct 1216 ms 1508 KB Output is correct
17 Correct 534 ms 1348 KB Output is correct
18 Correct 2466 ms 2560 KB Output is correct
19 Correct 1746 ms 1748 KB Output is correct
20 Correct 645 ms 1620 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 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 3 ms 344 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 7 ms 604 KB Output is correct
49 Correct 10 ms 720 KB Output is correct
50 Correct 8 ms 604 KB Output is correct
51 Correct 11 ms 600 KB Output is correct
52 Correct 13 ms 604 KB Output is correct
53 Correct 3 ms 612 KB Output is correct
54 Correct 4 ms 604 KB Output is correct
55 Correct 6 ms 604 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 7 ms 600 KB Output is correct
58 Correct 8 ms 604 KB Output is correct
59 Correct 8 ms 604 KB Output is correct
60 Correct 7 ms 604 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1715 ms 2000 KB Output is correct
2 Correct 1762 ms 2136 KB Output is correct
3 Correct 1971 ms 2116 KB Output is correct
4 Correct 2040 ms 2216 KB Output is correct
5 Correct 2166 ms 2268 KB Output is correct
6 Correct 1543 ms 1756 KB Output is correct
7 Correct 2170 ms 2272 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 604 KB Output is correct
6 Correct 34 ms 776 KB Output is correct
7 Correct 118 ms 1084 KB Output is correct
8 Correct 228 ms 1412 KB Output is correct
9 Correct 305 ms 1616 KB Output is correct
10 Correct 217 ms 1360 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 377 ms 912 KB Output is correct
13 Correct 237 ms 1108 KB Output is correct
14 Correct 135 ms 604 KB Output is correct
15 Correct 1777 ms 2044 KB Output is correct
16 Correct 1216 ms 1508 KB Output is correct
17 Correct 534 ms 1348 KB Output is correct
18 Correct 2466 ms 2560 KB Output is correct
19 Correct 1746 ms 1748 KB Output is correct
20 Correct 645 ms 1620 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 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 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 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 344 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 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 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 0 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 3 ms 344 KB Output is correct
65 Correct 5 ms 604 KB Output is correct
66 Correct 3 ms 348 KB Output is correct
67 Correct 5 ms 604 KB Output is correct
68 Correct 7 ms 604 KB Output is correct
69 Correct 10 ms 720 KB Output is correct
70 Correct 8 ms 604 KB Output is correct
71 Correct 11 ms 600 KB Output is correct
72 Correct 13 ms 604 KB Output is correct
73 Correct 3 ms 612 KB Output is correct
74 Correct 4 ms 604 KB Output is correct
75 Correct 6 ms 604 KB Output is correct
76 Correct 3 ms 604 KB Output is correct
77 Correct 7 ms 600 KB Output is correct
78 Correct 8 ms 604 KB Output is correct
79 Correct 8 ms 604 KB Output is correct
80 Correct 7 ms 604 KB Output is correct
81 Correct 1715 ms 2000 KB Output is correct
82 Correct 1762 ms 2136 KB Output is correct
83 Correct 1971 ms 2116 KB Output is correct
84 Correct 2040 ms 2216 KB Output is correct
85 Correct 2166 ms 2268 KB Output is correct
86 Correct 1543 ms 1756 KB Output is correct
87 Correct 2170 ms 2272 KB Output is correct
88 Correct 12 ms 344 KB Output is correct
89 Correct 30 ms 604 KB Output is correct
90 Correct 92 ms 780 KB Output is correct
91 Correct 223 ms 872 KB Output is correct
92 Correct 415 ms 1084 KB Output is correct
93 Correct 793 ms 1268 KB Output is correct
94 Correct 931 ms 1420 KB Output is correct
95 Correct 1471 ms 1692 KB Output is correct
96 Correct 1555 ms 1812 KB Output is correct
97 Correct 1817 ms 1948 KB Output is correct
98 Correct 620 ms 1352 KB Output is correct
99 Correct 318 ms 1348 KB Output is correct
100 Correct 891 ms 1352 KB Output is correct
101 Correct 1177 ms 1504 KB Output is correct
102 Correct 1408 ms 1676 KB Output is correct
103 Correct 1362 ms 1676 KB Output is correct
104 Correct 1438 ms 1608 KB Output is correct
105 Correct 238 ms 1356 KB Output is correct