Submission #99346

#	Time	Username	Problem	Language	Result	Execution time	Memory
99346		JustasLe	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	4 ms	384 KiB

molecules

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

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int> ans;
	vector<pair<int, int>> a;
	for (int i = 0; i < (int) w.size(); i++) {
		a.push_back({w[i], i});
	}
	sort(a.begin(), a.end());
	int ll = 0, r = 1;
	long long sum = a[0].first;
	while (r < (int) w.size()) {
		// printf("%lld\n", sum);
		if (sum >= l && sum <= u) {
			for (int i = ll; i < r; i++) {
				ans.push_back(a[i].second);
			}
			return ans;
		}
		if (sum > l) {
			sum -= a[ll++].first;
		} else {
			sum += a[r++].first;
		}
	}
	if (sum >= l && sum <= u) {
		for (int i = ll; i < r; i++) {
			ans.push_back(a[i].second);
		}
	}
	return ans;
}

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