oj.uz

답안 #1084616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084616 2024-09-06T14:05:35 Z GasmaskChan Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 264 ms 4444 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long

const int MAX = 5e2 + 5;

pair<int, int> state[MAX];
double f[2][MAX][MAX];
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout);
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> state[i].first >> state[i].second;

    sort(state + 1, state + n + 1, [](const pair<int, int> &a, const pair<int, int> &b) -> bool {
        if (a.second != -1 && b.second != -1) {
            if (a.second != b.second) return a.second < b.second;
            return a.first > b.first;
        }
        return a.second > b.second;
    });

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n + 1; j++) {
            for (int z = 0; z <= k; z++) {
                f[i & 1][j][z] = 1e9;
            }
        }
    }

    f[0][1][0] = 0.0;

    for (int i = 1; i <= n; i++) {

        for (int j = 1; j <= i + 1; j++) {
            for (int z = 0; z <= k; z++) {
                f[i & 1][j][z] = 1e9;
            }
        }

        for (int j = 1; j <= i + 1; j++) {
            for (int z = 0; z <= k; z++) {
                f[i & 1][j][z] = f[(i - 1) & 1][j][z];

                if (z) f[i & 1][j][z] = min(f[i & 1][j][z], f[(i - 1) & 1][j][z - 1] + (1.0 * state[i].first / j));

                if (j > 1 && z && state[i].second != -1) {
                    f[i & 1][j][z] = min(f[i & 1][j][z], f[(i - 1) & 1][j - 1][z - 1] + (1.0 * state[i].second / (j - 1)));
                }
            }
        }
    }

    double ans = 1e9;
    for (int j = 1; j <= n + 1; j++) {
        ans = min(ans, f[n & 1][j][k]);
    }

    cout << fixed << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 27 ms 4184 KB Output is correct
6 Correct 48 ms 4188 KB Output is correct
7 Correct 88 ms 4440 KB Output is correct
8 Correct 121 ms 4188 KB Output is correct
9 Correct 158 ms 4420 KB Output is correct
10 Correct 127 ms 4444 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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 27 ms 4184 KB Output is correct
6 Correct 48 ms 4188 KB Output is correct
7 Correct 88 ms 4440 KB Output is correct
8 Correct 121 ms 4188 KB Output is correct
9 Correct 158 ms 4420 KB Output is correct
10 Correct 127 ms 4444 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 83 ms 4420 KB Output is correct
13 Correct 66 ms 4440 KB Output is correct
14 Correct 57 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Correct 147 ms 4444 KB Output is correct
17 Correct 116 ms 4444 KB Output is correct
18 Correct 264 ms 4440 KB Output is correct
19 Correct 204 ms 4444 KB Output is correct
20 Correct 161 ms 4440 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2512 KB Output is correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2512 KB Output is correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2512 KB Output is correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 253 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 27 ms 4184 KB Output is correct
6 Correct 48 ms 4188 KB Output is correct
7 Correct 88 ms 4440 KB Output is correct
8 Correct 121 ms 4188 KB Output is correct
9 Correct 158 ms 4420 KB Output is correct
10 Correct 127 ms 4444 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 83 ms 4420 KB Output is correct
13 Correct 66 ms 4440 KB Output is correct
14 Correct 57 ms 4444 KB Output is correct
15 Correct 181 ms 4440 KB Output is correct
16 Correct 147 ms 4444 KB Output is correct
17 Correct 116 ms 4444 KB Output is correct
18 Correct 264 ms 4440 KB Output is correct
19 Correct 204 ms 4444 KB Output is correct
20 Correct 161 ms 4440 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 0 ms 2392 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 0 ms 2512 KB Output is correct
29 Incorrect 1 ms 2392 KB Output isn't correct
30 Halted 0 ms 0 KB -