Submission #534267

#	Time	Username	Problem	Language	Result	Execution time	Memory
534267		browntoad	Let's Win the Election (JOI22_ho_t3)	C++14	10 / 100	1 ms	332 KiB

Main

#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 pdd

#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);
}

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

bool cmp(pdd x, pdd y){
    if(x.s==-1&&y.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(5);
    int n, k; cin>>n>>k;
    double res=inf;
    vector<pdd> vc(n);
    REP(i,n) cin>>vc[i].f>>vc[i].s;
    sort(ALL(vc), cmp);
    if (vc[0].s==vc[n-1].s&&vc[0].s==-1){
        int res=0;
        REP(i,k){
            res+=vc[i].f;
        }
        cout<<res<<endl;
        return 0;
    }
    int pos=0;
    REP(i,n){
        if (vc[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+=vc[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+=vc[pos+j].f/(0.0+i+1);
            //cout<<cur<<endl;
        }
        res=min(res, cur);
    }
    cout<<res<<endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23