oj.uz

답안 #938944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938944 2024-03-06T00:44:07 Z Pacybwoah Let's Win the Election (JOI22_ho_t3) C++17
21 / 100
 816 ms 4440 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++){
            if(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));
    }*/
    for(int i=0;i<=k;i++) ans=min(ans,solve(i));
    cout<<fixed<<setprecision(12)<<ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:34:9: warning: unused variable 'l' [-Wunused-variable]
   34 |     int l=0,r=k;
      |         ^
Main.cpp:34:13: warning: unused variable 'r' [-Wunused-variable]
   34 |     int l=0,r=k;
      |             ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 61 ms 1412 KB Output is correct
7 Correct 241 ms 2424 KB Output is correct
8 Correct 488 ms 3420 KB Output is correct
9 Correct 776 ms 4424 KB Output is correct
10 Correct 460 ms 3196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 61 ms 1412 KB Output is correct
7 Correct 241 ms 2424 KB Output is correct
8 Correct 488 ms 3420 KB Output is correct
9 Correct 776 ms 4424 KB Output is correct
10 Correct 460 ms 3196 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 84 ms 1624 KB Output is correct
13 Correct 84 ms 1628 KB Output is correct
14 Correct 85 ms 1628 KB Output is correct
15 Correct 419 ms 3228 KB Output is correct
16 Correct 407 ms 3260 KB Output is correct
17 Correct 418 ms 3260 KB Output is correct
18 Correct 771 ms 4440 KB Output is correct
19 Correct 764 ms 4424 KB Output is correct
20 Correct 775 ms 4440 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 774 ms 4388 KB Output is correct
2 Correct 779 ms 4424 KB Output is correct
3 Correct 772 ms 4440 KB Output is correct
4 Correct 765 ms 4424 KB Output is correct
5 Correct 767 ms 4428 KB Output is correct
6 Correct 779 ms 4380 KB Output is correct
7 Correct 816 ms 4416 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 11 ms 860 KB Output is correct
6 Correct 61 ms 1412 KB Output is correct
7 Correct 241 ms 2424 KB Output is correct
8 Correct 488 ms 3420 KB Output is correct
9 Correct 776 ms 4424 KB Output is correct
10 Correct 460 ms 3196 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 84 ms 1624 KB Output is correct
13 Correct 84 ms 1628 KB Output is correct
14 Correct 85 ms 1628 KB Output is correct
15 Correct 419 ms 3228 KB Output is correct
16 Correct 407 ms 3260 KB Output is correct
17 Correct 418 ms 3260 KB Output is correct
18 Correct 771 ms 4440 KB Output is correct
19 Correct 764 ms 4424 KB Output is correct
20 Correct 775 ms 4440 KB Output is correct
21 Correct 1 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 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Halted 0 ms 0 KB -