Submission #59169

#	Time	Username	Problem	Language	Result	Execution time	Memory
59169		TadijaSebez	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	90 ms	6468 KiB

molecules

#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
const int N=200050;
int id[N],a[N];
bool comp(int i, int j){ return a[i]<a[j];}
vector<int> find_subset(int l, int r, vector<int> w)
{
	int i,j,k,n;n=w.size();
	for(i=1;i<=n;i++) a[i]=w[i-1],id[i]=i;
	sort(id+1,id+1+n,comp);
	j=0;ll sum=0;vector<int> ans;
	for(i=1;i<=n;i++)
	{
		while(sum<l && j<n) sum+=a[id[++j]];
		if(sum<=r && sum>=l)
		{
			for(k=i;k<=j;k++) ans.push_back(id[k]-1);
			return ans;
		}
		sum-=a[id[i]];
	}
	return ans;
}

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