oj.uz

Submission #593568

# Submission time Handle Problem Language Result Execution time Memory
593568 2022-07-11T11:59:29 Z oleh1421 Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 2500 ms 8404 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#define y2 y_2
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
const ll inf=1e18;
mt19937 rnd(time(NULL));
const ll mod=998244353;
const int N=510;
const int Lg=16;
ld pref[N][N];
ld suf[N][N];
ll sum[N];
void solve(){
    int n,k;cin>>n>>k;
    vector<pair<ll,ll> >v;
    for (int i=1;i<=n;i++){
        ll a,b;cin>>a>>b;
        if (b==-1) b=inf;
        v.push_back({b,a});
    }
    sort(v.begin(),v.end());
    ld res=inf;
    vector<ll>u;
    for (int i=n-1;i>=0;i--){
        sum[i]=0;
        for (int j=0;j<k-i-1;j++) sum[i]+=u[j];
        u.push_back(v[i].second);
        sort(u.begin(),u.end());
    }
    for (int l=0;l<k;l++){
        for (int i=0;i<=n+1;i++){
            for (int j=0;j<=n+1;j++){
                pref[i][j]=suf[i][j]=inf;
            }
        }
        pref[0][0]=0.0;
        for (int i=0;i<n;i++){
            for (int j=0;j<=i;j++){
                pref[i+1][j]=min(pref[i+1][j],pref[i][j]+(ld)v[i].second/(l+1.0));
                if (v[i].first<inf) pref[i+1][j+1]=min(pref[i+1][j+1],pref[i][j]+(ld)v[i].first/(j+1.0));
            }
        }
        vector<ll>u;
        for (int i=n-1;i>=0;i--){
            ld cur=pref[i+1][l];
            cur+=(ld)sum[i]/(l+1.0);
            res=min(res,cur);
//            cout<<l<<" "<<i+1<<" "<<cur<<" "<<v[i].second<<endl;
            u.push_back(v[i].second);
            sort(u.begin(),u.end());
        }
        ld cur=0.0;
        for (int i=0;i<k;i++) cur+=u[i];
        res=min(res,cur);
    }
    cout<<setprecision(10)<<fixed<<res<<endl;
}
int32_t main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt=1;
//    cin>>tt;
    while (tt--){
        solve();
    }
    return 0;

}


/**
3
5 2 7 3 1 6 8 4
**/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 320 ms 8372 KB Output is correct
6 Correct 791 ms 8404 KB Output is correct
7 Correct 1590 ms 8396 KB Output is correct
8 Correct 2428 ms 8356 KB Output is correct
9 Execution timed out 2575 ms 8276 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 320 ms 8372 KB Output is correct
6 Correct 791 ms 8404 KB Output is correct
7 Correct 1590 ms 8396 KB Output is correct
8 Correct 2428 ms 8356 KB Output is correct
9 Execution timed out 2575 ms 8276 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 456 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 456 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 4 ms 1492 KB Output is correct
42 Correct 4 ms 1492 KB Output is correct
43 Correct 7 ms 1492 KB Output is correct
44 Correct 6 ms 1488 KB Output is correct
45 Correct 10 ms 1496 KB Output is correct
46 Correct 9 ms 1560 KB Output is correct
47 Correct 13 ms 1560 KB Output is correct
48 Correct 12 ms 1492 KB Output is correct
49 Correct 16 ms 1492 KB Output is correct
50 Correct 14 ms 1564 KB Output is correct
51 Correct 20 ms 1560 KB Output is correct
52 Correct 18 ms 1568 KB Output is correct
53 Correct 11 ms 1560 KB Output is correct
54 Correct 10 ms 1492 KB Output is correct
55 Correct 12 ms 1484 KB Output is correct
56 Correct 10 ms 1560 KB Output is correct
57 Correct 14 ms 1564 KB Output is correct
58 Correct 13 ms 1560 KB Output is correct
59 Correct 14 ms 1560 KB Output is correct
60 Correct 14 ms 1492 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2587 ms 8276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 320 ms 8372 KB Output is correct
6 Correct 791 ms 8404 KB Output is correct
7 Correct 1590 ms 8396 KB Output is correct
8 Correct 2428 ms 8356 KB Output is correct
9 Execution timed out 2575 ms 8276 KB Time limit exceeded
10 Halted 0 ms 0 KB -