oj.uz

Submission #871096

# Submission time Handle Problem Language Result Execution time Memory
871096 2023-11-09T21:39:13 Z HorizonWest Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 828 ms 1002584 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void printdb(double ans, int k)
{
    cout << setiosflags(ios::fixed)
         << setiosflags(ios::showpoint)
         << setprecision(k) << ans << endl;
}

void solve()
{
    int n, m; cin >> n >> m; 
    vector <pair<db, db>> v(n); 
    for(auto& u : v) 
    {
        cin >> u.sd >> u.fs;
        if(u.fs == -1) u.fs = Inf;  
    } 
    sort(all(v)); 

    vector <vector<vector<db>>> dp(n + 2, vector <vector<db>> (
        m + 2, vector <db> (m + 2, Inf)
    )); 

    db ans = Inf; dp[0][1][0] = 0.000; 

    for(db i = 0; i < n; i++)
    {
        for(db j = 1; j <= m; j++)
        {
            for(db k = 0; k <= m; k++)
            {
                dp[i+1][j][k] = min(dp[i+1][j][k], dp[i][j][k]);  
                dp[i+1][j][k+1] = min(dp[i+1][j][k+1], dp[i][j][k] + v[i].sd / j); 
                if(v[i].fs != Inf)
                {
                    dp[i+1][j+1][k+1] = min(dp[i+1][j+1][k+1], dp[i][j][k] + v[i].fs / j); 
                } 
            }
            ans = min(ans, dp[i+1][j][m]); 
        }
    }

    printdb(ans, 5); 
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 11 ms 12156 KB Output is correct
6 Correct 57 ms 65960 KB Output is correct
7 Correct 225 ms 255312 KB Output is correct
8 Correct 444 ms 566008 KB Output is correct
9 Correct 818 ms 1002400 KB Output is correct
10 Correct 394 ms 495080 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 11 ms 12156 KB Output is correct
6 Correct 57 ms 65960 KB Output is correct
7 Correct 225 ms 255312 KB Output is correct
8 Correct 444 ms 566008 KB Output is correct
9 Correct 818 ms 1002400 KB Output is correct
10 Correct 394 ms 495080 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 83 ms 94424 KB Output is correct
13 Correct 83 ms 94348 KB Output is correct
14 Correct 81 ms 94192 KB Output is correct
15 Correct 412 ms 495256 KB Output is correct
16 Correct 402 ms 495188 KB Output is correct
17 Correct 401 ms 495188 KB Output is correct
18 Correct 813 ms 1002584 KB Output is correct
19 Correct 793 ms 1002584 KB Output is correct
20 Correct 783 ms 1002584 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 11 ms 12156 KB Output is correct
6 Correct 57 ms 65960 KB Output is correct
7 Correct 225 ms 255312 KB Output is correct
8 Correct 444 ms 566008 KB Output is correct
9 Correct 818 ms 1002400 KB Output is correct
10 Correct 394 ms 495080 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 83 ms 94424 KB Output is correct
13 Correct 83 ms 94348 KB Output is correct
14 Correct 81 ms 94192 KB Output is correct
15 Correct 412 ms 495256 KB Output is correct
16 Correct 402 ms 495188 KB Output is correct
17 Correct 401 ms 495188 KB Output is correct
18 Correct 813 ms 1002584 KB Output is correct
19 Correct 793 ms 1002584 KB Output is correct
20 Correct 783 ms 1002584 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Incorrect 0 ms 344 KB Output isn't correct
30 Halted 0 ms 0 KB -