제출 #527066

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
527066	2022-02-16 21:39:30	couplefire	Let's Win the Election (JOI22_ho_t3)	C++17	100 / 100	15 ms	2404 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define f first
#define s second
const int N = 505;
const int INF = 0x3f3f3f3f;
int n, k;
pii a[N];
double dp[N][N];
double s(int mid){
    for(int i = 1; i<=n; ++i)
        for(int j = 0; j<=i; ++j)
            dp[i][j] = min(dp[i-1][j]+(i-1-j>=mid?0:(.0+a[i].s)/(.0+i-j)), (j>=1?dp[i-1][j-1]+(.0+a[i].f)/(.0+mid+1):INF));
    double ans = INF;
    for(int i = k-mid; i<=n; ++i)
        if(n-i>=mid) ans = min(ans, dp[n][i]);
    return ans;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout << setprecision(12) << fixed;
    cin >> n >> k;
    for(int i = 1; i<=n; ++i)
        cin >> a[i].f >> a[i].s;
    int mx = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 33 / 33
• Subtask 6: 11 / 11
• Subtask 7: 23 / 23