Submission #99347

#	Time	Username	Problem	Language	Result	Execution time	Memory
99347		JustasLe	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	3 ms	384 KiB

molecules

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

using namespace std;

vector<int> find_subset(int mn, int mx, vector<int> w) {
	vector<int> ans;
	vector<pair<int, int>> a;
	int n = (int) w.size();
	for (int i = 0; i < n; i++) {
		a.push_back({w[i], i});
	}
	sort(a.begin(), a.end());
	int l = 0, r = -1;
	long long sum = 0;
	while (r < n && sum < l) {
		sum += a[++r].first;
		if (sum >= mn) {
			if (sum <= mx) {
				break;
			}
			while (l <= r && sum > mx) {
				sum -= a[l++].first;
			}
		}
	}
	if (sum >= mn && sum <= mx) {
		for (int i = l; i <= r; i++) {
			ans.push_back(a[i].second);
		}
	}
	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