oj.uz

Submission #734446

# Submission time Handle Problem Language Result Execution time Memory
734446 2023-05-02T12:10:47 Z Josia Let's Win the Election (JOI22_ho_t3) C++17
0 / 100
 2500 ms 994512 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t

int n, k;


vector<int> a, b;


signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin >> n >> k;

    a.assign(n, 0);
    b.assign(n, 0);

    vector<pair<int, int>> blub(n);

    for (int i = 0; i<n; i++) {
        cin >> blub[i].second;
        cin >> blub[i].first;

        if (blub[i].first == -1) blub[i].first = 1e18;
    }

    sort(blub.begin(), blub.end());

    for (int i=0; i<n; i++) {
        a[i] = blub[i].second;
        b[i] = blub[i].first;
    }



    vector<vector<vector<double>>> dp(n+1, vector<vector<double>>(n+1, vector<double>(n+1, 1e18)));

    dp[0][0][0] = 0;

    for (int i = 0; i<n; i++) {
        for (int votes = 0; votes<=n; votes++) {
            for (int colab = 0; colab<=n; colab++) {
                vector<double> options;
                options.push_back(dp[i][votes][colab]);
                if (votes > 0) options.push_back(dp[i][votes-1][colab] + ((double)a[i]/(colab+1)));
                if (votes > 0 && colab > 0 && b[i] != 1e18) options.push_back(dp[i][votes-1][colab-1] + ((double)b[i]/colab));
                dp[i+1][votes][colab] = *min_element(options.begin(), options.end());
                // cerr << dp[i+1][votes][colab] << "\n";
            }
        }
    }

    cout.precision(100);
    cout << *min_element(dp[n][k].begin(), dp[n][k].end()) << "\n";


    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2617 ms 994512 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2617 ms 994512 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2592 ms 994436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2617 ms 994512 KB Time limit exceeded
6 Halted 0 ms 0 KB -