Submission #765659

#	Time	Username	Problem	Language	Result	Execution time	Memory
765659		SanguineChameleon	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	37 ms	5588 KiB

molecules

#include "molecules.h"
#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>> order(n);
	for (int i = 0; i < n; i++) {
		order[i].first = w[i];
		order[i].second = i;
	}
	sort(order.begin(), order.end());
	long long sum = 0;
	int rt = -1;
	for (int i = 0; i < n; i++) {
		while (sum < l && rt + 1 < n) {
			rt++;
			sum += order[rt].first;
		}
		if (l <= sum && sum <= u) {
			vector<int> res;
			for (int j = i; j <= rt; j++) {
				res.push_back(order[j].second);
			}
			return res;
		}
		sum -= order[i].first;
	}
	return 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