Submission #678031

#	Time	Username	Problem	Language	Result	Execution time	Memory
678031		Dulguun	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	42 ms	5556 KiB

molecules

#include<bits/stdc++.h>
using namespace std;

vector <int> find_subset (int l, int u, vector <int> w){
	int n=w.size();
	vector<pair<int,int> > v(n);
	for(int i=0; i<n; i++) v[i]={w[i], i};
	sort(v.begin(), v.end());
	long long sum=0;
	vector<int> r;
	for(int i=0, j=0; j<n; j++){
		sum+=v[j].first;
		while(sum>u) sum-=v[i++].first;
		if(sum>=l){
			for(; i<=j; i++) r.push_back(v[i].second);
			break;
		}
	}
	return r;
}

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