제출 #436837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436837		adamjinwei	Hiring (IOI09_hiring)	C++14	100 / 100	845 ms	39748 KiB

hiring

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
#define inf 1000000000000000007ULL
#define mod 1000000007
#define rnd() dist(rand_num)
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
//#define int long long
using namespace std;
unsigned seed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(seed);
uniform_int_distribution<int> dist(0,inf);
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n;
long long w;
pair<pair<long double,int>,int> p[500005];
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	read(n);read(w);
	for(register int i=1;i<=n;++i)
	{
		int s,q;
		read(s);read(q);
		p[i]=make_pair(make_pair((long double)s/(long double)q,q),i);
	}
	sort(p+1,p+n+1);
	int ans=0;
	long double mn=inf;
	__gnu_pbds::priority_queue<pair<int,int>,less<pair<int,int>>,pairing_heap_tag> pq;
	unsigned long long sum=0;
	for(register int i=1;i<=n;++i)
	{
		pq.push(make_pair(p[i].first.second,i));
		sum+=p[i].first.second;
		while(sum*p[i].first.first>w+1e-8)
		{
			sum-=pq.top().first;
			pq.pop();
		}
		if(ans<pq.size())
		{
			ans=pq.size();
			mn=sum*p[i].first.first;
		}
		else if(ans==pq.size()&&sum*p[i].first.first<mn-1e-8)
		{
			mn=sum*p[i].first.first;
		}
	}
	sum=0;
	while(!pq.empty()) pq.pop();
	for(register int i=1;i<=n;++i)
	{
		pq.push(make_pair(p[i].first.second,i));
		sum+=p[i].first.second;
		while(sum*p[i].first.first>w+1e-8)
		{
			sum-=pq.top().first;
			pq.pop();
		}
		if(ans==pq.size()&&fabs(sum*p[i].first.first-mn)<1e-8)
		{
			writeln(ans);
			while(!pq.empty())
			{
				writeln(p[pq.top().second].second);
				pq.pop();
			}
			return 0;
		}
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

hiring.cpp:4:13: warning: overflow in conversion from 'long long unsigned int' to 'int' changes value from '1000000000000000007' to '-1486618617' [-Woverflow]
    4 | #define inf 1000000000000000007ULL
      |             ^~~~~~~~~~~~~~~~~~~~~~
hiring.cpp:13:38: note: in expansion of macro 'inf'
   13 | uniform_int_distribution<int> dist(0,inf);
      |                                      ^~~
hiring.cpp: In function 'int main()':
hiring.cpp:57:9: warning: comparison of integer expressions of different signedness: 'int' and '__gnu_pbds::detail::left_child_next_sibling_heap<std::pair<int, int>, std::less<std::pair<int, int> >, __gnu_pbds::null_type, std::allocator<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   if(ans<pq.size())
      |      ~~~^~~~~~~~~~
hiring.cpp:62:14: warning: comparison of integer expressions of different signedness: 'int' and '__gnu_pbds::detail::left_child_next_sibling_heap<std::pair<int, int>, std::less<std::pair<int, int> >, __gnu_pbds::null_type, std::allocator<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   else if(ans==pq.size()&&sum*p[i].first.first<mn-1e-8)
      |           ~~~^~~~~~~~~~~
hiring.cpp:78:9: warning: comparison of integer expressions of different signedness: 'int' and '__gnu_pbds::detail::left_child_next_sibling_heap<std::pair<int, int>, std::less<std::pair<int, int> >, __gnu_pbds::null_type, std::allocator<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |   if(ans==pq.size()&&fabs(sum*p[i].first.first-mn)<1e-8)
      |      ~~~^~~~~~~~~~~

• 서브태스크 1: 30 / 30
• 서브태스크 2: 28 / 28
• 서브태스크 3: 6 / 6
• 서브태스크 4: 6 / 6
• 서브태스크 5: 6 / 6
• 서브태스크 6: 6 / 6
• 서브태스크 7: 6 / 6
• 서브태스크 8: 6 / 6
• 서브태스크 9: 6 / 6