Submission #225909

#	Time	Username	Problem	Language	Result	Execution time	Memory
225909		frodakcin	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	86 ms	7944 KiB

molecules

#include "molecules.h"

#include <cassert>
#include <algorithm>

using ll = long long;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int N = w.size();
	std::vector<int> o(N);
	for(int i = 0;i < N;++i) o[i] = i;
	std::sort(o.begin(), o.end(), [&](int a, int b){return w[a]<w[b];});
	std::sort(w.begin(), w.end());
	
	std::vector<ll> vl(N, 0), vr(N, 0);
	for(int i = 0;i < N;++i)
		vl[i] = w[i] + (i ? vl[i-1] : 0LL);
	for(int i = 0;i < N;++i)
		vr[i] = w[N-i-1] + (i ? vr[i-1] : 0LL);
	for(int i = 0;i < N;++i)
		if(vl[i] <= u && l <= vr[i])
		{
			//answer
			ll s = vl[i];
			int j = i;
			for(;j >= 0 && s < l;--j) s += w[N-i-1+j] - w[j];
			std::vector<int> ans(0);
			for(int k = 0;k <= j;++k) ans.push_back(o[k]);
			for(int k = N-i+j;k < N;++k) ans.push_back(o[k]);
			return ans;
		}
	return std::vector<int>(0);
}

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