oj.uz

Submission #534685

# Submission time Handle Problem Language Result Execution time Memory
534685 2022-03-08T14:00:53 Z browntoad Let's Win the Election (JOI22_ho_t3) C++14
66 / 100
 143 ms 18788 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 pdd pair<double ,double>
#define pii pair<int, int>
#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=105;
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);
}

//=======================================================================================
double dp[maxn][maxn][maxn];
bool cmp(pdd x, pdd y){
    if (x.s==y.s&&x.s==-1){
        return x.f<y.f;
    }
    if (x.s==-1||y.s==-1){
        return x.s>y.s;
    }
    return x.s<y.s;
}
signed main (){
    IOS();
    cout<<fixed<<setprecision(9);
    int n, K; cin>>n>>K;
    vector<pdd> vc(n+1), ov(n);
    REP1(i,n){
        cin>>vc[i].f>>vc[i].s;
        ov[i-1]=vc[i];
    }
    sort(ALL(vc), cmp);
    bool ok=1;
    REP1(i,n){
        if (vc[i].s==-1||vc[i].f==vc[i].s){
            
        }
        else ok=0;
    }
    if (ok){
        int k=K;
        int pos=0;
        double res=inf;
        sort(ALL(ov), cmp);
        if (ov[0].s==ov[n-1].s&&ov[0].s==-1){
            int res=0;
            REP(i,k){
                res+=ov[i].f;
            }
            cout<<res<<endl;
            return 0;
        }
        REP(i,n){
            if (ov[i].s==-1){
                break;
            }
            pos++;
        }
        
        REP(i,min(k+1, pos+1)){
            //cout<<i<<endl;
            double cur=0;
            REP(j,i){
                //cout<<j<<endl;
                //cout<<vc[i].f/(j+1)<<endl;
                cur+=ov[j].f/(0.0+j+1);
                //cout<<cur<<endl;
            }
            //cout<<cur<<endl;
            if (cur==inf||pos+(k-i)-1>=n) continue;
            REP(j, k-i){
                //cout<<j+pos<<endl;
                cur+=ov[pos+j].f/(0.0+i+1);
                //cout<<cur<<endl;
            }
            res=min(res, cur);
        }
        cout<<res<<endl;
        return 0;
    }
    double ans=inf;
    REP(k, K+1){
        /*if (k==0){
            vector<double> cur;
            REP1(i,n) cur.pb(vc[i].f);
            sort(ALL(cur));
            REP1(i, K){
                ans+=cur[i];
            }
            continue;
        }
        */
        /*dp[1][1][1]=vc[1].s;
        dp[1][1][0]=vc[1].f/k;
        dp[1][0][0]=0;
        */
        REP(i,maxn){
            REP(j,maxn){
                REP(l,maxn){
                    dp[i][j][l]=inf;
                }
            }
        }
        dp[1][1][1]=vc[1].s;
        dp[1][1][0]=vc[1].f/(k+1);
        dp[1][0][0]=0;
        FOR(i,2,n+1){
            dp[i][0][0]=0.0;
            FOR(j, 1, i+1){
                dp[i][j][0]=min(dp[i-1][j-1][0]+vc[i].f/(k+1), dp[i-1][j][0]);
                FOR(l, 1, j+1){
                    if (vc[i].s==-1){
                        dp[i][j][l]=min(dp[i-1][j-1][l]+vc[i].f/(k+1), dp[i-1][j][l]);
                    }
                    else dp[i][j][l]=min({dp[i-1][j-1][l-1]+vc[i].s/l, dp[i-1][j-1][l]+vc[i].f/(k+1), dp[i-1][j][l]});
                }
            }
        }
        ans=min(ans, dp[n][K][k]);
    }
    cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 336 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9292 KB Output is correct
2 Correct 6 ms 9372 KB Output is correct
3 Correct 7 ms 9292 KB Output is correct
4 Correct 8 ms 9372 KB Output is correct
5 Correct 9 ms 9292 KB Output is correct
6 Correct 12 ms 9292 KB Output is correct
7 Correct 9 ms 9292 KB Output is correct
8 Correct 8 ms 9292 KB Output is correct
9 Correct 9 ms 9292 KB Output is correct
10 Correct 11 ms 9372 KB Output is correct
11 Correct 9 ms 9292 KB Output is correct
12 Correct 7 ms 9292 KB Output is correct
13 Correct 8 ms 9372 KB Output is correct
14 Correct 10 ms 9292 KB Output is correct
15 Correct 11 ms 9292 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9292 KB Output is correct
2 Correct 6 ms 9372 KB Output is correct
3 Correct 7 ms 9292 KB Output is correct
4 Correct 8 ms 9372 KB Output is correct
5 Correct 9 ms 9292 KB Output is correct
6 Correct 12 ms 9292 KB Output is correct
7 Correct 9 ms 9292 KB Output is correct
8 Correct 8 ms 9292 KB Output is correct
9 Correct 9 ms 9292 KB Output is correct
10 Correct 11 ms 9372 KB Output is correct
11 Correct 9 ms 9292 KB Output is correct
12 Correct 7 ms 9292 KB Output is correct
13 Correct 8 ms 9372 KB Output is correct
14 Correct 10 ms 9292 KB Output is correct
15 Correct 11 ms 9292 KB Output is correct
16 Correct 6 ms 9292 KB Output is correct
17 Correct 11 ms 9292 KB Output is correct
18 Correct 11 ms 9292 KB Output is correct
19 Correct 16 ms 9300 KB Output is correct
20 Correct 20 ms 9372 KB Output is correct
21 Correct 18 ms 9376 KB Output is correct
22 Correct 17 ms 9292 KB Output is correct
23 Correct 16 ms 9292 KB Output is correct
24 Correct 19 ms 9372 KB Output is correct
25 Correct 20 ms 9368 KB Output is correct
26 Correct 20 ms 9292 KB Output is correct
27 Correct 17 ms 9372 KB Output is correct
28 Correct 14 ms 9292 KB Output is correct
29 Correct 13 ms 9372 KB Output is correct
30 Correct 16 ms 9376 KB Output is correct
31 Correct 14 ms 9372 KB Output is correct
32 Correct 15 ms 9292 KB Output is correct
33 Correct 15 ms 9292 KB Output is correct
34 Correct 15 ms 9376 KB Output is correct
35 Correct 16 ms 9372 KB Output is correct
36 Correct 15 ms 9292 KB Output is correct
37 Correct 16 ms 9368 KB Output is correct
38 Correct 16 ms 9292 KB Output is correct
39 Correct 17 ms 9364 KB Output is correct
40 Correct 15 ms 9292 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9292 KB Output is correct
2 Correct 6 ms 9372 KB Output is correct
3 Correct 7 ms 9292 KB Output is correct
4 Correct 8 ms 9372 KB Output is correct
5 Correct 9 ms 9292 KB Output is correct
6 Correct 12 ms 9292 KB Output is correct
7 Correct 9 ms 9292 KB Output is correct
8 Correct 8 ms 9292 KB Output is correct
9 Correct 9 ms 9292 KB Output is correct
10 Correct 11 ms 9372 KB Output is correct
11 Correct 9 ms 9292 KB Output is correct
12 Correct 7 ms 9292 KB Output is correct
13 Correct 8 ms 9372 KB Output is correct
14 Correct 10 ms 9292 KB Output is correct
15 Correct 11 ms 9292 KB Output is correct
16 Correct 6 ms 9292 KB Output is correct
17 Correct 11 ms 9292 KB Output is correct
18 Correct 11 ms 9292 KB Output is correct
19 Correct 16 ms 9300 KB Output is correct
20 Correct 20 ms 9372 KB Output is correct
21 Correct 18 ms 9376 KB Output is correct
22 Correct 17 ms 9292 KB Output is correct
23 Correct 16 ms 9292 KB Output is correct
24 Correct 19 ms 9372 KB Output is correct
25 Correct 20 ms 9368 KB Output is correct
26 Correct 20 ms 9292 KB Output is correct
27 Correct 17 ms 9372 KB Output is correct
28 Correct 14 ms 9292 KB Output is correct
29 Correct 13 ms 9372 KB Output is correct
30 Correct 16 ms 9376 KB Output is correct
31 Correct 14 ms 9372 KB Output is correct
32 Correct 15 ms 9292 KB Output is correct
33 Correct 15 ms 9292 KB Output is correct
34 Correct 15 ms 9376 KB Output is correct
35 Correct 16 ms 9372 KB Output is correct
36 Correct 15 ms 9292 KB Output is correct
37 Correct 16 ms 9368 KB Output is correct
38 Correct 16 ms 9292 KB Output is correct
39 Correct 17 ms 9364 KB Output is correct
40 Correct 15 ms 9292 KB Output is correct
41 Correct 29 ms 9380 KB Output is correct
42 Correct 26 ms 9292 KB Output is correct
43 Correct 50 ms 9284 KB Output is correct
44 Correct 47 ms 9352 KB Output is correct
45 Correct 79 ms 9356 KB Output is correct
46 Correct 82 ms 9292 KB Output is correct
47 Correct 100 ms 9292 KB Output is correct
48 Correct 90 ms 9356 KB Output is correct
49 Correct 121 ms 9348 KB Output is correct
50 Correct 114 ms 9352 KB Output is correct
51 Correct 143 ms 9292 KB Output is correct
52 Correct 139 ms 9368 KB Output is correct
53 Correct 108 ms 9292 KB Output is correct
54 Correct 122 ms 9352 KB Output is correct
55 Correct 94 ms 9292 KB Output is correct
56 Correct 96 ms 9356 KB Output is correct
57 Correct 124 ms 9360 KB Output is correct
58 Correct 102 ms 9292 KB Output is correct
59 Correct 95 ms 9292 KB Output is correct
60 Correct 98 ms 9352 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 18788 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 5 ms 9292 KB Output is correct
22 Correct 6 ms 9372 KB Output is correct
23 Correct 7 ms 9292 KB Output is correct
24 Correct 8 ms 9372 KB Output is correct
25 Correct 9 ms 9292 KB Output is correct
26 Correct 12 ms 9292 KB Output is correct
27 Correct 9 ms 9292 KB Output is correct
28 Correct 8 ms 9292 KB Output is correct
29 Correct 9 ms 9292 KB Output is correct
30 Correct 11 ms 9372 KB Output is correct
31 Correct 9 ms 9292 KB Output is correct
32 Correct 7 ms 9292 KB Output is correct
33 Correct 8 ms 9372 KB Output is correct
34 Correct 10 ms 9292 KB Output is correct
35 Correct 11 ms 9292 KB Output is correct
36 Correct 6 ms 9292 KB Output is correct
37 Correct 11 ms 9292 KB Output is correct
38 Correct 11 ms 9292 KB Output is correct
39 Correct 16 ms 9300 KB Output is correct
40 Correct 20 ms 9372 KB Output is correct
41 Correct 18 ms 9376 KB Output is correct
42 Correct 17 ms 9292 KB Output is correct
43 Correct 16 ms 9292 KB Output is correct
44 Correct 19 ms 9372 KB Output is correct
45 Correct 20 ms 9368 KB Output is correct
46 Correct 20 ms 9292 KB Output is correct
47 Correct 17 ms 9372 KB Output is correct
48 Correct 14 ms 9292 KB Output is correct
49 Correct 13 ms 9372 KB Output is correct
50 Correct 16 ms 9376 KB Output is correct
51 Correct 14 ms 9372 KB Output is correct
52 Correct 15 ms 9292 KB Output is correct
53 Correct 15 ms 9292 KB Output is correct
54 Correct 15 ms 9376 KB Output is correct
55 Correct 16 ms 9372 KB Output is correct
56 Correct 15 ms 9292 KB Output is correct
57 Correct 16 ms 9368 KB Output is correct
58 Correct 16 ms 9292 KB Output is correct
59 Correct 17 ms 9364 KB Output is correct
60 Correct 15 ms 9292 KB Output is correct
61 Correct 29 ms 9380 KB Output is correct
62 Correct 26 ms 9292 KB Output is correct
63 Correct 50 ms 9284 KB Output is correct
64 Correct 47 ms 9352 KB Output is correct
65 Correct 79 ms 9356 KB Output is correct
66 Correct 82 ms 9292 KB Output is correct
67 Correct 100 ms 9292 KB Output is correct
68 Correct 90 ms 9356 KB Output is correct
69 Correct 121 ms 9348 KB Output is correct
70 Correct 114 ms 9352 KB Output is correct
71 Correct 143 ms 9292 KB Output is correct
72 Correct 139 ms 9368 KB Output is correct
73 Correct 108 ms 9292 KB Output is correct
74 Correct 122 ms 9352 KB Output is correct
75 Correct 94 ms 9292 KB Output is correct
76 Correct 96 ms 9356 KB Output is correct
77 Correct 124 ms 9360 KB Output is correct
78 Correct 102 ms 9292 KB Output is correct
79 Correct 95 ms 9292 KB Output is correct
80 Correct 98 ms 9352 KB Output is correct
81 Runtime error 16 ms 18788 KB Execution killed with signal 11
82 Halted 0 ms 0 KB -