Submission #468577

#	Time	Username	Problem	Language	Result	Execution time	Memory
468577		PiejanVDC	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	53 ms	6560 KiB

molecules

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

vector<int> find_subset(int ll, int uu, vector<int> ww) {
	long long n = ww.size(),l=ll,u=uu;
	vector<pair<long long,long long>>w(n);
	for(long long i = 0 ; i < n ; i++) {
		w[i].first=ww[i],w[i].second=i;
	}
	long long cnt=0;
	sort(w.begin(),w.end());
	long long left=0,right=0;
	while(right < n) {
		if(cnt + w[right].first > u) break;
		cnt+=w[right].first;
		right++;
	}
	if(right == 0) return {};
	bool f=false;
	while(right <= n) {
		if(cnt >= l && cnt <= u) {
			f=true; break;
		}
		if(right == n) break;
		cnt+=w[right].first;
		cnt-=w[left].first;
		right++,left++;
	}
	vector<int>ans={};
	if(f) {
		for(; left < right ; left++) ans.push_back(w[left].second);
	}
	return ans;
}

/*signed main() {
	long long n,l,u;
	cin >> n >> l >> u;
	vector<long long>w(n);
	for(auto &z : w)
		cin >> z;
	vector<long long>v = find_subset(l,u,w);
	for(auto x : v)
		cout << x << " ";
}*/

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