oj.uz

Submission #1067407

# Submission time Handle Problem Language Result Execution time Memory
1067407 2024-08-20T16:34:08 Z Whisper Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 436 ms 6488 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                 505
int N, K;
int A[MAX], B[MAX];

double dp[2][MAX][MAX];

int cost[MAX][MAX];
void process(void){
    cin >> N >> K;
    for (int i = 1; i <= N; ++i){
        cin >> A[i] >> B[i];
        if(B[i] == -1) B[i] = 1e9;
    }
    vector<int> order(N);
    iota(order.begin(), order.end(), 1);

    sort(order.begin(), order.end(), [&](int &i, int &j){
        return B[i] < B[j];
    });

    vector<int> vals;
    FOR(i, 0, N) FOR(j, 0, N) cost[i][j] = 1e9;
    for (int i = N - 1; i >= 0; --i){
        vals.push_back(A[order[i]]);
        sort(vals.begin(), vals.end());
        int sm = 0;
        for (int j = 0; j < (int)vals.size(); ++j){
            sm += vals[j];
            cost[i][j + 1] = sm;
        }
    }
    FOR(j, 0, K) FOR(k, 0, K) dp[0][j][k] = dp[1][j][k] = 1e9;
    double ans = cost[0][K];
    dp[0][0][0] = 0;
    for (int i = 0; i < N; ++i){
        for (int j = 0; j <= K; ++j){
            for (int k = 0; k <= K; ++k){
                dp[1][j][k] = 1e15;
            }
        }

        for (int j = 0; j <= K; ++j){
            for (int k = 0; k <= j; ++k){
                minimize(dp[1][j][k], dp[0][j][k]);
                if(j > 0)
                    minimize(dp[1][j][k], dp[0][j - 1][k] + (double)A[order[i]] / (double)(k + 1));
                if(j > 0 && k > 0)
                    minimize(dp[1][j][k], dp[0][j - 1][k - 1] + (double)B[order[i]] / (double)(k));

                int need = K - j;
                minimize(ans, dp[1][j][k] + (double)cost[i + 1][need] / (double)(k + 1));
            }
        }
        swap(dp[0], dp[1]);
    }
    cout << setprecision(10) << fixed << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 97 ms 6236 KB Output is correct
6 Correct 116 ms 6236 KB Output is correct
7 Correct 179 ms 6436 KB Output is correct
8 Correct 322 ms 6436 KB Output is correct
9 Correct 425 ms 6236 KB Output is correct
10 Correct 260 ms 6232 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 97 ms 6236 KB Output is correct
6 Correct 116 ms 6236 KB Output is correct
7 Correct 179 ms 6436 KB Output is correct
8 Correct 322 ms 6436 KB Output is correct
9 Correct 425 ms 6236 KB Output is correct
10 Correct 260 ms 6232 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 126 ms 6236 KB Output is correct
13 Correct 146 ms 6436 KB Output is correct
14 Correct 124 ms 6236 KB Output is correct
15 Correct 256 ms 6232 KB Output is correct
16 Correct 257 ms 6232 KB Output is correct
17 Correct 268 ms 6436 KB Output is correct
18 Correct 419 ms 6432 KB Output is correct
19 Correct 425 ms 6232 KB Output is correct
20 Correct 436 ms 6444 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4280 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Incorrect 4 ms 4444 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4280 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Incorrect 4 ms 4444 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 3 ms 4280 KB Output is correct
8 Correct 3 ms 4444 KB Output is correct
9 Incorrect 4 ms 4444 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 435 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 3 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 97 ms 6236 KB Output is correct
6 Correct 116 ms 6236 KB Output is correct
7 Correct 179 ms 6436 KB Output is correct
8 Correct 322 ms 6436 KB Output is correct
9 Correct 425 ms 6236 KB Output is correct
10 Correct 260 ms 6232 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 126 ms 6236 KB Output is correct
13 Correct 146 ms 6436 KB Output is correct
14 Correct 124 ms 6236 KB Output is correct
15 Correct 256 ms 6232 KB Output is correct
16 Correct 257 ms 6232 KB Output is correct
17 Correct 268 ms 6436 KB Output is correct
18 Correct 419 ms 6432 KB Output is correct
19 Correct 425 ms 6232 KB Output is correct
20 Correct 436 ms 6444 KB Output is correct
21 Correct 3 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 3 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 3 ms 4280 KB Output is correct
28 Correct 3 ms 4444 KB Output is correct
29 Incorrect 4 ms 4444 KB Output isn't correct
30 Halted 0 ms 0 KB -