oj.uz

Submission #891058

# Submission time Handle Problem Language Result Execution time Memory
891058 2023-12-22T07:02:59 Z irmuun Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 1008552 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

bool comp(pair<ll,ll>a,pair<ll,ll>b){
    if(a.ss<b.ss) return true;
    if(a.ss>b.ss) return false;
    return a.ff<b.ff;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll N,K;
    cin>>N>>K;
    pair<ll,ll>p[N+5];
    for(ll i=1;i<=N;i++){
        cin>>p[i].ff>>p[i].ss;
        if(p[i].ss==-1) p[i].ss=1e6;
    }
    sort(p+1,p+N+1,comp);
    double dp[N+5][N+5][N+5],ans=1e9;
    for(ll goal=0;goal<=K;goal++){
        for(ll i=0;i<=N;i++){
            for(ll j=0;j<=N;j++){
                for(ll k=0;k<=N;k++){
                    dp[i][j][k]=1e9;
                }
            }
        }
        dp[0][0][0]=0;
        for(ll i=0;i<N;i++){
            for(ll j=0;j<=K;j++){
                for(ll k=0;k<=goal;k++){
                    dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k]);
                    dp[i+1][j+1][k]=min(dp[i+1][j+1][k],dp[i][j][k]+(double)p[i+1].ff/(goal+1));
                    dp[i+1][j+1][k+1]=min(dp[i+1][j+1][k+1],dp[i][j][k]+(double)p[i+1].ss/(k+1));
                }
            }
        }
        ans=min(ans,dp[N][K][goal]);
    }
    printf("%.10f",ans);
}

Subtask #1
0 / 5.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 0 ms 344 KB Output is correct
5 Execution timed out 2588 ms 1008552 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.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 0 ms 344 KB Output is correct
5 Execution timed out 2588 ms 1008552 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 448 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 448 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 576 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 448 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 576 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 13 ms 9304 KB Output is correct
42 Correct 12 ms 9520 KB Output is correct
43 Correct 20 ms 9308 KB Output is correct
44 Correct 20 ms 9308 KB Output is correct
45 Correct 39 ms 9308 KB Output is correct
46 Correct 44 ms 9472 KB Output is correct
47 Correct 55 ms 9308 KB Output is correct
48 Correct 54 ms 9304 KB Output is correct
49 Correct 82 ms 9308 KB Output is correct
50 Correct 79 ms 9308 KB Output is correct
51 Correct 130 ms 9304 KB Output is correct
52 Correct 132 ms 9488 KB Output is correct
53 Correct 54 ms 9308 KB Output is correct
54 Correct 57 ms 9308 KB Output is correct
55 Correct 53 ms 9304 KB Output is correct
56 Correct 55 ms 9308 KB Output is correct
57 Correct 56 ms 9308 KB Output is correct
58 Correct 61 ms 9504 KB Output is correct
59 Correct 67 ms 9488 KB Output is correct
60 Correct 58 ms 9304 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.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 0 ms 344 KB Output is correct
5 Execution timed out 2588 ms 1008552 KB Time limit exceeded
6 Halted 0 ms 0 KB -