oj.uz

Submission #678435

# Submission time Handle Problem Language Result Execution time Memory
678435 2023-01-05T23:25:48 Z Pacybwoah Let's Win the Election (JOI22_ho_t3) C++14
21 / 100
 50 ms 4544 KB 
#include<iostream>
#include<vector>
#include<iomanip>
#include<utility>
#include<algorithm>
#define ld long double
using namespace std;
vector<pair<ld,ld>> vec;
int n,k;
ld solve(int m){
    vector<vector<ld>> dp(n+1,vector<ld>(k-m+1,1e9+7));
    dp[1][0]=(m>0?vec[1].first:0);
    if(k-m>0) dp[1][1]=vec[1].second;
    for(int i=2;i<=n;i++){
        for(int j=0;j<=min(k-m,i);j++){
            dp[i][j]=min(dp[i][j],dp[i-1][j]+(i-j>m?0:vec[i].first/(long double)(i-j)));
            if(j>0) dp[i][j]=min(dp[i][j],dp[i-1][j-1]+vec[i].second/(long double)(m+1));
        }
    }
    /*for(int i=1;i<=n;i++){
        for(int j=0;j<=k-m;j++) if(m==2) cout<<dp[i][j]<<" ";
        cout<<"\n";
    }*/
    return dp[n][k-m];
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    vec.resize(n+1);
    for(int i=1;i<=n;i++) cin>>vec[i].second>>vec[i].first;
    for(int i=1;i<=n;i++) if(vec[i].first==-1) vec[i].first=1e9;
    sort(next(vec.begin()),vec.end());
    int l=0,r=k;
    ld ans=1e9+7;
    while(l<r){
        int mid=(l+r)>>1;
        ld a=solve(max(mid,0)),b=solve(min(mid+1,r));
        ans=min(ans,min(a,b));
        if(a>b) l=min(mid+1,r);
        else r=(max(mid,0));
    }
    cout<<fixed<<setprecision(12)<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 776 KB Output is correct
6 Correct 11 ms 1344 KB Output is correct
7 Correct 24 ms 2380 KB Output is correct
8 Correct 39 ms 3340 KB Output is correct
9 Correct 50 ms 4544 KB Output is correct
10 Correct 36 ms 3136 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 776 KB Output is correct
6 Correct 11 ms 1344 KB Output is correct
7 Correct 24 ms 2380 KB Output is correct
8 Correct 39 ms 3340 KB Output is correct
9 Correct 50 ms 4544 KB Output is correct
10 Correct 36 ms 3136 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 4 ms 884 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 14 ms 1180 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 18 ms 1628 KB Output is correct
17 Correct 27 ms 2412 KB Output is correct
18 Correct 8 ms 2320 KB Output is correct
19 Correct 31 ms 2332 KB Output is correct
20 Correct 43 ms 3756 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2320 KB Output is correct
2 Correct 26 ms 2320 KB Output is correct
3 Correct 23 ms 2320 KB Output is correct
4 Correct 28 ms 2320 KB Output is correct
5 Correct 13 ms 2320 KB Output is correct
6 Correct 41 ms 3296 KB Output is correct
7 Correct 12 ms 2320 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 776 KB Output is correct
6 Correct 11 ms 1344 KB Output is correct
7 Correct 24 ms 2380 KB Output is correct
8 Correct 39 ms 3340 KB Output is correct
9 Correct 50 ms 4544 KB Output is correct
10 Correct 36 ms 3136 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 4 ms 884 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 14 ms 1180 KB Output is correct
15 Correct 7 ms 1748 KB Output is correct
16 Correct 18 ms 1628 KB Output is correct
17 Correct 27 ms 2412 KB Output is correct
18 Correct 8 ms 2320 KB Output is correct
19 Correct 31 ms 2332 KB Output is correct
20 Correct 43 ms 3756 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 1 ms 216 KB Output isn't correct
30 Halted 0 ms 0 KB -