oj.uz

답안 #638630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638630 2022-09-06T14:38:59 Z browntoad Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 213 ms 4420 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=505;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}

//=======================================================================================

int n, k;
vector<pii> vc;
bool cmp(pii a, pii b){
    if (a.s==-1&&b.s==-1){
        return a.f<b.f;
    }
    if (a.s==-1||b.s==-1){
        return a.s>b.s;
    }
    return a.s<b.s;
}

double dp[maxn][maxn], sf[maxn][maxn];
signed main (){
    IOS();
    cout<<fixed<<setprecision(15);
    cin>>n>>k;
    REP(i, n){
        int x, y; cin>>x>>y;
        vc.pb({x, y});
    }
    sort(ALL(vc), cmp);

    REP(i, maxn){
        REP(j, maxn){
            if (j==0) sf[i][j]=0;
            else sf[i][j]=inf;
        }
    }
    RREP(i, n){
        vector<int> cur;
        FOR(j, i, n){
            cur.pb(vc[j].f);
        }
        sort(ALL(cur));
        REP1(j, k){
            if (j>SZ(cur)) break;
            else sf[i][j]=sf[i][j-1]+cur[j-1];
        }
    }
    double res=sf[0][k];
    REP1(t, k){
        REP(i, n){
            REP(j, t+1){
                dp[i][j]=inf;
            }
        }
        REP(i, n){
            if (i==0){
                dp[i][0]=(0.0+vc[i].f)/(t+1);
                if (vc[i].s!=-1) dp[i][1]=(0.0+vc[i].s);
                continue;
            }
            REP(j, t+1){
                if (j>i+1) break;
                if (j==0){
                    dp[i][0]=dp[i-1][0]+(0.0+vc[i].f)/(t+1);
                }
                else dp[i][j]=min(dp[i-1][j]+(0.0+vc[i].f)/(t+1), ((vc[i].s!=-1)?(dp[i-1][j-1]+(0.0+vc[i].s)/(j)):(0.0+inf)));
            }
        }
        REP(i, n){
            res=min(res, dp[i][t]+sf[i+1][k-t]/(t+1));
        }
        //res=min(res, dp[t-1][t]+(0.0+sf[t][k-t])/(t+1)); // 0 base
    }
    cout<<res<<endl;

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 21 ms 4316 KB Output is correct
7 Correct 59 ms 4308 KB Output is correct
8 Correct 114 ms 4420 KB Output is correct
9 Correct 173 ms 4292 KB Output is correct
10 Correct 89 ms 4292 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 21 ms 4316 KB Output is correct
7 Correct 59 ms 4308 KB Output is correct
8 Correct 114 ms 4420 KB Output is correct
9 Correct 173 ms 4292 KB Output is correct
10 Correct 89 ms 4292 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 31 ms 4308 KB Output is correct
13 Correct 27 ms 4304 KB Output is correct
14 Correct 27 ms 4308 KB Output is correct
15 Correct 107 ms 4308 KB Output is correct
16 Correct 95 ms 4180 KB Output is correct
17 Correct 89 ms 4180 KB Output is correct
18 Correct 213 ms 4292 KB Output is correct
19 Correct 213 ms 4292 KB Output is correct
20 Correct 185 ms 4292 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2244 KB Output is correct
9 Incorrect 1 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2244 KB Output is correct
9 Incorrect 1 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2244 KB Output is correct
9 Incorrect 1 ms 2260 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 21 ms 4316 KB Output is correct
7 Correct 59 ms 4308 KB Output is correct
8 Correct 114 ms 4420 KB Output is correct
9 Correct 173 ms 4292 KB Output is correct
10 Correct 89 ms 4292 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 31 ms 4308 KB Output is correct
13 Correct 27 ms 4304 KB Output is correct
14 Correct 27 ms 4308 KB Output is correct
15 Correct 107 ms 4308 KB Output is correct
16 Correct 95 ms 4180 KB Output is correct
17 Correct 89 ms 4180 KB Output is correct
18 Correct 213 ms 4292 KB Output is correct
19 Correct 213 ms 4292 KB Output is correct
20 Correct 185 ms 4292 KB Output is correct
21 Correct 1 ms 2260 KB Output is correct
22 Correct 1 ms 2260 KB Output is correct
23 Correct 1 ms 2260 KB Output is correct
24 Correct 1 ms 2260 KB Output is correct
25 Correct 1 ms 2260 KB Output is correct
26 Correct 1 ms 2260 KB Output is correct
27 Correct 1 ms 2260 KB Output is correct
28 Correct 1 ms 2244 KB Output is correct
29 Incorrect 1 ms 2260 KB Output isn't correct
30 Halted 0 ms 0 KB -