oj.uz

답안 #534265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534265 2022-03-08T02:53:05 Z PixelCat Let's Win the Election (JOI22_ho_t3) C++14
22 / 100
 561 ms 1004412 KB 
#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forr(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define INF (LL)(9e18)
#define int LL
using namespace std;
using LL=long long;
using pii=pair<int,int>;

template<typename T>
void chmin(T &_a,const T &_b){
    if(_a>_b) _a=_b;
}

const int MAXN=510;

double p[MAXN];
pii a[MAXN];
double dp[MAXN][MAXN][MAXN];

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    // OAO
    int n,K; cin>>n>>K;
    For(i,1,n) cin>>a[i].F>>a[i].S;
    sort(a+1,a+n+1,[](pii &pa,pii &pb){
        return pa.S<pb.S;
    });
    // For(i,1,n) cerr<<a[i].F<<" "<<a[i].S<<"\n";
    p[0]=1;
    For(i,1,n) p[i]=1.0/(i+1);
    For(i,0,n) For(j,0,n) For(k,0,n) dp[i][j][k]=INF;
    dp[0][0][0]=0;
    if(n==K){
        double ans=INF;
        For(nc,0,n){
            For(i,1,n) For(j,0,min(i,nc)){
                dp[0][i][j]=dp[0][i-1][j]+a[i].F*p[nc];
                if(j){
                    chmin(dp[0][i][j],dp[0][i-1][j-1]+a[i].S*p[j-1]);
                }
            }
            chmin(ans,dp[0][n][nc]);
        }
        cout<<fixed<<setprecision(15);
        cout<<ans<<"\n";
        return 0;
    }
    double ans=INF;
    For(nc,0,K){
        For(i,1,n) For(j,0,min(i,K)) For(k,0,min(j,nc)){
            dp[i][j][k]=dp[i-1][j][k];
            if(j){
                chmin(dp[i][j][k],dp[i-1][j-1][k]+a[i].F*p[nc]);
            }
            if(a[i].S!=-1 && k){
                chmin(dp[i][j][k],dp[i-1][j-1][k-1]+a[i].S*p[k-1]);
            }
        }
        // if(nc==3){
        //     For(i,1,n) For(j,0,K) For(k,0,nc){
        //         cerr<<dp[i][j][k]<<"\t\n"[k==nc];
        //         if(j==K && k==nc) cerr<<"\n";
        //     }
        // }
        // cerr<<nc<<" "<<dp[n][K][nc]<<"\n";
        chmin(ans,dp[n][K][nc]);
    }
    cout<<fixed<<setprecision(15);
    cout<<ans<<"\n";
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 588 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 588 KB Output is correct
16 Correct 1 ms 2124 KB Output is correct
17 Correct 1 ms 2124 KB Output is correct
18 Correct 2 ms 2124 KB Output is correct
19 Correct 1 ms 2124 KB Output is correct
20 Correct 1 ms 2124 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 1 ms 2124 KB Output is correct
23 Correct 1 ms 2124 KB Output is correct
24 Correct 1 ms 2124 KB Output is correct
25 Correct 1 ms 2124 KB Output is correct
26 Incorrect 1 ms 2124 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 0 ms 588 KB Output is correct
16 Correct 1 ms 2124 KB Output is correct
17 Correct 1 ms 2124 KB Output is correct
18 Correct 2 ms 2124 KB Output is correct
19 Correct 1 ms 2124 KB Output is correct
20 Correct 1 ms 2124 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 1 ms 2124 KB Output is correct
23 Correct 1 ms 2124 KB Output is correct
24 Correct 1 ms 2124 KB Output is correct
25 Correct 1 ms 2124 KB Output is correct
26 Incorrect 1 ms 2124 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 561 ms 1004348 KB Output is correct
2 Correct 480 ms 1004332 KB Output is correct
3 Correct 482 ms 1004228 KB Output is correct
4 Correct 496 ms 1004412 KB Output is correct
5 Correct 478 ms 1004280 KB Output is correct
6 Correct 521 ms 1004296 KB Output is correct
7 Correct 500 ms 1004344 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -