Submission #305569

#	Time	Username	Problem	Language	Result	Execution time	Memory
305569		tengiz05	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	62 ms	4332 KiB

molecules

#include "molecules.h"
//#include "grader.cpp"
#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>> a;
	for(int i=0;i<n;i++){
		a.push_back({w[i], i});
	}
	sort(a.begin(), a.end());
	vector<int> ans;
	
	long long sum = 0;
	for(auto x : w)sum += x;
	if(sum < (long long)l)return ans;
	
	sum = 0;
	int m=0;
	for(int i=0;i<n;i++){
		sum += a[i].first;
		while(sum > (long long)u)sum -= a[m].first, m++;
		
		if(sum >= (long long)l && sum <= (long long)u){
			for(int j=m;j<=i;j++)ans.push_back(a[j].second);
			break;
		}
	}
//	cout << sum << ' ';
    return ans;
}

/*

4 15 17
6 8 8 7

4 14 15
5 5 6 6

4 10 20
15 17 16 18

*/

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