Submission #289388

#	Time	Username	Problem	Language	Result	Execution time	Memory
289388		RuDi24	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	256 KiB

molecules

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

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector <int> ans;
	ans.reserve(w.size());
	sort(w.begin(),w.end());
	long long sum = 0;
	int it;
	for(it = 0;it < w.size() && sum + w[it] <= u;it++){
		sum += w[it];
		ans.emplace_back(it);
	}
	// cout<< l << ' ' << u << endl;
	// cout<<sum<<endl;
	// for(int i = 0;i < ans.size();i++) cout<<ans[i]<<' ';
	// cout<<endl;
	// if(sum > u) return vector<int> (0);
	if(sum >= l && sum <= u) return ans;
	for(int i = w.size()-1;i >= it;i--) {

		for(int j = 0;j < ans.size();j++){
			if(sum + (w[i] - w[ans[j]]) <= u && sum + (w[i] - w[ans[j]]) >= l){
				sum+= (w[i] - w[ans[j]]);
				ans[j] = i;
				return ans;
			}
		}
	}
	return vector <int> (0);
}
// int main(){
// 	auto a = find_subset(15, 17, {6, 8, 8, 7});
// 	for(int i = 0;i < a.size();i++){
// 		cout<<a[i]<<' ';
// 	}
// 	cout<<endl;
// 	a = find_subset(14, 15, {5, 5, 6, 6});
// 	for(int i = 0;i < a.size();i++){
// 		cout<<a[i]<<' ';
// 	}
// 	cout<<endl;
// 	a = find_subset(10, 20, {15, 17, 16, 18});
// 	for(int i = 0;i < a.size();i++){
// 		cout<<a[i]<<' ';
// 	}
// 	cout<<endl;

// }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(it = 0;it < w.size() && sum + w[it] <= u;it++){
      |             ~~~^~~~~~~~~~
molecules.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   for(int j = 0;j < ans.size();j++){
      |                 ~~^~~~~~~~~~~~

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