제출 #532769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532769		__Variatto	Hiring (IOI09_hiring)	C++17	80 / 100	1576 ms	23816 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const ll MAX=5e5+10, L=16;
const ll MAXV=1e18+10;
struct st{
    int i, s, q, s1, q1;
}t[MAX];
ll n, w;
int minipos;
bool spr(ll x){
    ll sum=0;
    multiset<ll>m;
    for(ll i=1; i<=x; i++)
        sum+=t[i].q, m.insert(t[i].q);
    long double mini=MAXV;
    bool udalo=false;
    for(ll i=x; i<=n; i++){
        if(i>x){
            auto it=m.end();
            it--;
            if(*it>t[i].q){
                sum-=*it, sum+=t[i].q;
                m.erase(it), m.insert(t[i].q);
            }
        }
        if(w*t[i].q>=sum*t[i].s){
            if(mini>(long double)sum*t[i].s/(long double)t[i].q)
                mini=(long double)sum*t[i].s/(long double)t[i].q, minipos=i;
            udalo=true;
        }
    }
    return udalo;
}
ll bin(){
    ll pocz=0, kon=n, sr, wyn=0;
    while(pocz<=kon){
        sr=(pocz+kon)/2;
        if(spr(sr))
            wyn=sr, pocz=sr+1;
        else
            kon=sr-1;
    }
    return wyn;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin>>n>>w;
    for(ll i=1; i<=n; i++){
        cin>>t[i].s>>t[i].q;
        int gcd=__gcd(t[i].s, t[i].q);
        t[i].q1=t[i].q/gcd, t[i].s1=t[i].s/gcd;
        t[i].i=i;
    }
    sort(t+1, t+n+1, [](st a, st b){
        return a.s1*b.q1<b.s1*a.q1;
    });
    int x=bin();
    cout<<x<<"\n";
    multiset<pair<int,int>>m;
    for(int i=1; i<=minipos; i++)
        m.insert({t[i].q, t[i].i});
    int ile=0;
    for(multiset<pair<int,int>>::iterator it=m.begin(); true; it++){
        cout<<(*it).se<<"\n";
        ile++;
        if(ile==x)
            break;
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 20 / 28
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 6 / 6
• Subtask 7: 6 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6