oj.uz

답안 #908027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
908027 2024-01-16T07:14:02 Z gaga999 Let's Win the Election (JOI22_ho_t3) C++17
72 / 100
 2500 ms 2752 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], ans = 1e12;
int n, k;

double slv(int t)
{
    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];
}

signed main()
{
    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);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 35 ms 772 KB Output is correct
7 Correct 119 ms 1084 KB Output is correct
8 Correct 223 ms 1204 KB Output is correct
9 Correct 318 ms 1740 KB Output is correct
10 Correct 201 ms 1352 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 35 ms 772 KB Output is correct
7 Correct 119 ms 1084 KB Output is correct
8 Correct 223 ms 1204 KB Output is correct
9 Correct 318 ms 1740 KB Output is correct
10 Correct 201 ms 1352 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 384 ms 1156 KB Output is correct
13 Correct 244 ms 892 KB Output is correct
14 Correct 133 ms 600 KB Output is correct
15 Correct 1713 ms 1720 KB Output is correct
16 Correct 1227 ms 1508 KB Output is correct
17 Correct 551 ms 1152 KB Output is correct
18 Execution timed out 2529 ms 2752 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 432 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 432 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 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 2 ms 756 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 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 2 ms 512 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 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 0 ms 348 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 0 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 432 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 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 2 ms 756 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 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 2 ms 512 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 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 0 ms 348 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 2 ms 348 KB Output is correct
45 Correct 4 ms 604 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 4 ms 604 KB Output is correct
48 Correct 7 ms 604 KB Output is correct
49 Correct 13 ms 860 KB Output is correct
50 Correct 7 ms 652 KB Output is correct
51 Correct 10 ms 756 KB Output is correct
52 Correct 12 ms 604 KB Output is correct
53 Correct 3 ms 608 KB Output is correct
54 Correct 6 ms 608 KB Output is correct
55 Correct 7 ms 608 KB Output is correct
56 Correct 3 ms 616 KB Output is correct
57 Correct 7 ms 612 KB Output is correct
58 Correct 7 ms 604 KB Output is correct
59 Correct 8 ms 616 KB Output is correct
60 Correct 7 ms 616 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1812 ms 1960 KB Output is correct
2 Correct 1840 ms 1960 KB Output is correct
3 Correct 1980 ms 2108 KB Output is correct
4 Correct 2131 ms 2208 KB Output is correct
5 Correct 2332 ms 2268 KB Output is correct
6 Correct 1629 ms 1740 KB Output is correct
7 Correct 2268 ms 2480 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 35 ms 772 KB Output is correct
7 Correct 119 ms 1084 KB Output is correct
8 Correct 223 ms 1204 KB Output is correct
9 Correct 318 ms 1740 KB Output is correct
10 Correct 201 ms 1352 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 384 ms 1156 KB Output is correct
13 Correct 244 ms 892 KB Output is correct
14 Correct 133 ms 600 KB Output is correct
15 Correct 1713 ms 1720 KB Output is correct
16 Correct 1227 ms 1508 KB Output is correct
17 Correct 551 ms 1152 KB Output is correct
18 Execution timed out 2529 ms 2752 KB Time limit exceeded
19 Halted 0 ms 0 KB -