제출 #302436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302436		Nucleist	Hiring (IOI09_hiring)	C++14	59 / 100	1492 ms	40680 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define pb push_back
#define debug(x) cerr << " " << x << " " << #x << endl;
int main(){
	long long nb,w;
	cin>>nb>>w;
	vector<pair<long double,long long>>g;
	vector<long long>k1,k2;
	for (long long i = 0; i < nb; ++i)
	{
		long double s,q;
		cin>>s>>q;
		g.pb({s/q,i});
		k1.pb(s);
		k2.pb(q);
	}
	sort(all(g));
	priority_queue<pair<long double,long long>>g2;
	long double cur=0;
	pair<pair<long long,long long>,int> ans={{0,0},0};
	for (long long i = 0; i < nb; ++i)
	{
		g2.push({k2[g[i].second],i});
		if(i){
			cur/=(g[i-1].first);
		}
		cur*=g[i].first;
		cur+=k1[g[i].second];
		while(!(g2.empty()) && cur>w){
			cur-=((g2.top().first)*g[i].first);
			g2.pop();
		}
		ans=max(ans,{{(long long)(g2.size()),cur},i});
	}
	cout<<ans.first.first<<'\n';
	while(!(g2.empty()))
	{
		g2.pop();
	}
	cur=0;
	for (long long i = 0; i <= ans.second; ++i)
	{
		g2.push({k2[g[i].second],i});
		if(i){
			cur/=(g[i-1].first);
		}
		cur*=g[i].first;
		cur+=k1[g[i].second];
		while(!(g2.empty()) && cur>w){
			cur-=((g2.top().first)*g[i].first);
			g2.pop();
		}
	}
	while(!(g2.empty()))
	{
		cout<<g[g2.top().second].second+1;
		g2.pop();
		if(g2.size())cout<<'\n';
	}
    return 0; 
}

• Subtask 1: 18 / 30
• Subtask 2: 20 / 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