제출 #532767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532767		__Variatto	Hiring (IOI09_hiring)	C++17	100 / 100	561 ms	36036 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];
int n;
ll w;
int minipos;
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;
    });
    ll sum=0;
    multiset<int>m;
    long double mini=MAXV;
    int maxi=0;
    for(ll i=1; i<=n; i++){
        m.insert(t[i].q), sum+=t[i].q;
        while(sum*(ll)t[i].s>w*(ll)t[i].q){
            auto it=m.end();
            it--;
            sum-=*it;
            m.erase(it);
        }
        if(w*(ll)t[i].q>=sum*(ll)t[i].s){
            if(int(m.size())>=maxi){
                if(int(m.size())>maxi)
                    mini=MAXV;
                maxi=max(maxi, int(m.size()));
                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;
            }
        }
    }
    cout<<maxi<<"\n";
    multiset<pair<int,int>>m2;
    for(int i=1; i<=minipos; i++)
        m2.insert({t[i].q, t[i].i});
    int ile=0;
    for(multiset<pair<int,int>>::iterator it=m2.begin(); true; it++){
        cout<<(*it).se<<"\n";
        ile++;
        if(ile==maxi)
            break;
    }
}

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