oj.uz

Submission #761506

# Submission time Handle Problem Language Result Execution time Memory
761506 2023-06-19T21:08:38 Z raysh07 Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 477 ms 4528 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, k; cin >> n >> k;
    vector <pair<int, int>> a(n);
    for (auto &x : a){
        cin >> x.f >> x.s;
        swap(x.f, x.s);
        if (x.f == -1) x.f = INF;
    }
    
    sort(a.begin(), a.end());
    
    vector<vector<double>> dp(k + 1, vector<double>(k + 1, INF));
    dp[0][0] = 0;
    for (auto x : a){
       // cout << x.f << " " << x.s << "\n";
        vector<vector<double>> ndp(k + 1, vector<double>(k + 1, INF));
        for (int i = 0; i <= k; i++){
            for (int j = 0; j <= i; j++){
                ndp[i][j] = min(ndp[i][j], dp[i][j]);
                if (i != k){
                    ndp[i + 1][j] = min(ndp[i + 1][j], dp[i][j] + (double)x.s / (j + 1));
                    ndp[i + 1][j + 1] = min(ndp[i + 1][j + 1], dp[i][j] + (double)x.f / (j + 1));
                }
            }
        }
        
        dp = ndp;
        
        // for (int i = 0; i <= k; i++){
        //     for (int j = 0; j <= k; j++){
        //         cout << dp[i][j] << " ";
        //     }
        //     cout << "\n";
        // }
        // cout << "\n";
    }
    
    double mn = INF;
    for (int i = 0; i <= k; i++) mn = min(mn, dp[k][i]);
    
    cout << fixed << setprecision(10) << mn << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
5.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 Correct 4 ms 340 KB Output is correct
6 Correct 17 ms 592 KB Output is correct
7 Correct 110 ms 1452 KB Output is correct
8 Correct 253 ms 2572 KB Output is correct
9 Correct 474 ms 4448 KB Output is correct
10 Correct 229 ms 2284 KB Output is correct

Subtask #2
5.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 Correct 4 ms 340 KB Output is correct
6 Correct 17 ms 592 KB Output is correct
7 Correct 110 ms 1452 KB Output is correct
8 Correct 253 ms 2572 KB Output is correct
9 Correct 474 ms 4448 KB Output is correct
10 Correct 229 ms 2284 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 33 ms 692 KB Output is correct
13 Correct 33 ms 700 KB Output is correct
14 Correct 33 ms 692 KB Output is correct
15 Correct 218 ms 2596 KB Output is correct
16 Correct 217 ms 2608 KB Output is correct
17 Correct 220 ms 2284 KB Output is correct
18 Correct 474 ms 4528 KB Output is correct
19 Correct 477 ms 4520 KB Output is correct
20 Correct 472 ms 4496 KB Output is correct

Subtask #3
0 / 11.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 324 KB Output is correct
5 Correct 1 ms 216 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 1 ms 216 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 324 KB Output is correct
5 Correct 1 ms 216 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 1 ms 216 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.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 324 KB Output is correct
5 Correct 1 ms 216 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 1 ms 216 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 465 ms 4488 KB Output isn't correct
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 Correct 4 ms 340 KB Output is correct
6 Correct 17 ms 592 KB Output is correct
7 Correct 110 ms 1452 KB Output is correct
8 Correct 253 ms 2572 KB Output is correct
9 Correct 474 ms 4448 KB Output is correct
10 Correct 229 ms 2284 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 33 ms 692 KB Output is correct
13 Correct 33 ms 700 KB Output is correct
14 Correct 33 ms 692 KB Output is correct
15 Correct 218 ms 2596 KB Output is correct
16 Correct 217 ms 2608 KB Output is correct
17 Correct 220 ms 2284 KB Output is correct
18 Correct 474 ms 4528 KB Output is correct
19 Correct 477 ms 4520 KB Output is correct
20 Correct 472 ms 4496 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 216 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Incorrect 1 ms 216 KB Output isn't correct
30 Halted 0 ms 0 KB -