Submission #951855

#	Time	Username	Problem	Language	Result	Execution time	Memory
951855		karpatka	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	360 KiB

molecules

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

using i64 = long long;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int n = int(w.size());

	std::vector<std::pair<int, int>> p(n);
	for (int i = 0; i < n; i++) {
		p[i] = {w[i], i};
	}

	std::sort(p.begin(), p.end());

	std::vector<i64> pref(n + 1);
	for (int i = 0; i < n; i++) {
		pref[i + 1] = p[i].first + pref[i];
	}

	std::vector<int> ans;

	int lo = 0, hi = 1;
	while (lo != hi) {
		if (pref[hi] - pref[lo] <= u - l) {
			for (int i = lo; i <= hi; i++) {
				ans.push_back(p[i].second);
			}
			return ans;
		}

		if (pref[hi] - pref[lo] > u) {
			lo++;
		} else {
			hi++;
		}
	}

	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