oj.uz

Submission #638642

# Submission time Handle Problem Language Result Execution time Memory
638642 2022-09-06T15:20:12 Z browntoad Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 1630 ms 8436 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;
long double dp[maxn][maxn], sf[maxn][maxn];
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;
}

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]=iinf;
        }
    }
    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];
        }
    }
    long double res=sf[0][k];
    REP1(t, k){
        REP(i, n){
            REP(j, t+1){
                dp[i][j]=iinf;
            }
        }
        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==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+iinf)));
            }
        }
        REP(i, n){
            res=min(res, dp[i][t]+sf[i+1][k-t]/(t+1));
        }
    }
    cout<<res<<endl;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 2 ms 4320 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 20 ms 6728 KB Output is correct
6 Correct 100 ms 7372 KB Output is correct
7 Correct 375 ms 8152 KB Output is correct
8 Correct 790 ms 8264 KB Output is correct
9 Correct 1416 ms 8328 KB Output is correct
10 Correct 692 ms 8268 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 2 ms 4320 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 20 ms 6728 KB Output is correct
6 Correct 100 ms 7372 KB Output is correct
7 Correct 375 ms 8152 KB Output is correct
8 Correct 790 ms 8264 KB Output is correct
9 Correct 1416 ms 8328 KB Output is correct
10 Correct 692 ms 8268 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 159 ms 7460 KB Output is correct
13 Correct 148 ms 7460 KB Output is correct
14 Correct 154 ms 7456 KB Output is correct
15 Correct 797 ms 8412 KB Output is correct
16 Correct 756 ms 8344 KB Output is correct
17 Correct 716 ms 8436 KB Output is correct
18 Correct 1621 ms 8392 KB Output is correct
19 Correct 1527 ms 8268 KB Output is correct
20 Correct 1462 ms 8276 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 3 ms 4280 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Incorrect 2 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 3 ms 4280 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Incorrect 2 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 3 ms 4280 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Incorrect 2 ms 4308 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1630 ms 8272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4308 KB Output is correct
2 Correct 2 ms 4320 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 20 ms 6728 KB Output is correct
6 Correct 100 ms 7372 KB Output is correct
7 Correct 375 ms 8152 KB Output is correct
8 Correct 790 ms 8264 KB Output is correct
9 Correct 1416 ms 8328 KB Output is correct
10 Correct 692 ms 8268 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 159 ms 7460 KB Output is correct
13 Correct 148 ms 7460 KB Output is correct
14 Correct 154 ms 7456 KB Output is correct
15 Correct 797 ms 8412 KB Output is correct
16 Correct 756 ms 8344 KB Output is correct
17 Correct 716 ms 8436 KB Output is correct
18 Correct 1621 ms 8392 KB Output is correct
19 Correct 1527 ms 8268 KB Output is correct
20 Correct 1462 ms 8276 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 3 ms 4280 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 3 ms 4308 KB Output is correct
29 Incorrect 2 ms 4308 KB Output isn't correct
30 Halted 0 ms 0 KB -