제출 #439437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439437		adamjinwei	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	73 ms	6840 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
#define inf 1000000007
#define mod 1000000007
#define rnd() rand_num()
#define bigrnd() dis(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 sed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(sed);
uniform_int_distribution<long long> dis(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;
pair<int,int> w[200005];
int sum[200005];
vector<int> find_subset(int L,int R,vector<int> W)
{
	n=W.size();
	for(int i=1;i<=n;++i)
	{
		w[i].first=W[i-1];
		w[i].second=i-1;
	}
	sort(w+1,w+n+1);
	for(int i=1;i<=n;++i)
		sum[i]=sum[i-1]+w[i].first;
	for(int i=1;i<=n;++i)
	{
		int l=i,r=n;
		while(l<r)
		{
			int mid=l+r>>1;
			if(sum[mid]-sum[i-1]>=L) r=mid;
			else l=mid+1;
		}
		if(sum[l]-sum[i-1]>=L&&sum[l]-sum[i-1]<=R)
		{
			vector<int> ans;
			for(int j=i;j<=l;++j)
				ans.push_back(w[j].second);
			return ans;
		}
	}
	vector<int> ans;
	return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:48:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |    int mid=l+r>>1;
      |            ~^~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 0 / 31