Submission #330088

#	Time	Username	Problem	Language	Result	Execution time	Memory
330088		saarthak	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	376 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	if(u == l) return std::vector<int>(1, 0);				//if the range is 0, all weights are same, return any
	
	int total_weight = 0, i = 0;
	std::queue<int> indices;
	
	std::sort(w.begin(), w.end());
	
	while(total_weight < l) {
		total_weight += w[i];
		indices.push(i++);
	}
	i = 0;
	while(total_weight > u) {
		total_weight -= w[i++];
		indices.pop();
	}
	
	if(total_weight < l || total_weight > u) return std::vector<int>();		//no subarray found
	
	std::vector<int> ans(indices.size());
  	i = 0;
	while(!indices.empty()) {
		ans[i++] = indices.front();
		indices.pop();
	}
	return ans;
}

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