oj.uz

답안 #678434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678434 2023-01-05T23:24:14 Z Pacybwoah Let's Win the Election (JOI22_ho_t3) C++14
11 / 100
 2500 ms 3284 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 if(a==b){

        }
        else r=(max(mid,0));
    }
    cout<<fixed<<setprecision(12)<<ans;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2574 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2574 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2320 KB Output is correct
2 Correct 26 ms 2320 KB Output is correct
3 Correct 22 ms 2320 KB Output is correct
4 Correct 18 ms 2320 KB Output is correct
5 Correct 21 ms 2320 KB Output is correct
6 Correct 34 ms 3284 KB Output is correct
7 Correct 13 ms 2320 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2574 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -