제출 #1006633

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006633		huutuan	Hiring (IOI09_hiring)	C++14	67 / 100	791 ms	24228 KiB

hiring

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N=5e5+10;
int n, w, s[N], q[N], mq[N], id[N];

int32_t main(){
   // auto start=clock();
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> w;
   for (int i=1; i<=n; ++i){
      cin >> s[i] >> q[i];
      mq[i]=w*q[i]/s[i];
   }
   iota(id, id+n+1, 0);
   sort(id+1, id+n+1, [&](int x, int y){
      return mq[x]>mq[y];
   });
   int ans=0;
   {
      priority_queue<int> pq; int sum=0;
      for (int _i=1; _i<=n; ++_i){
         int i=id[_i];
         pq.push(q[i]); sum+=q[i];
         while (sum>mq[i]){
            sum-=pq.top();
            pq.pop();
         }
         ans=max(ans, (int)pq.size());
      }
   }
   int l=max(1ll, w-100), r=w;
   while (l<=r){
      int mid=(l+r)/2;
      for (int i=1; i<=n; ++i){
         mq[i]=mid*q[i]/s[i];
      }
      iota(id, id+n+1, 0);
      sort(id+1, id+n+1, [&](int x, int y){
         return mq[x]>mq[y];
      });
      int cur=0;
      {
         priority_queue<int> pq; int sum=0;
         for (int _i=1; _i<=n; ++_i){
            int i=id[_i];
            pq.push(q[i]); sum+=q[i];
            while (sum>mq[i]){
               sum-=pq.top();
               pq.pop();
            }
            cur=max(cur, (int)pq.size());
         }
      }
      if (cur==ans) r=mid-1;
      else l=mid+1;
   }
   for (int i=1; i<=n; ++i){
      mq[i]=l*q[i]/s[i];
   }
   iota(id, id+n+1, 0);
   sort(id+1, id+n+1, [&](int x, int y){
      return mq[x]>mq[y];
   });
   {
      priority_queue<pair<int, int>> pq; int sum=0;
      for (int _i=1; _i<=n; ++_i){
         int i=id[_i];
         pq.emplace(q[i], i); sum+=q[i];
         while (sum>mq[i]){
            sum-=pq.top().first;
            pq.pop();
         }
         if ((int)pq.size()==ans){
            cout << ans << '\n';
            while (pq.size()){
               cout << pq.top().second << '\n';
               pq.pop();
            }
            return 0;
         }
      }
   }
   return 0;
}

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