제출 #485744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485744		dongliu0426	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	41 ms	4784 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l0, int r0, vector<int> aa) {
	int n = (int) aa.size();
	long long l1 = 0, r1 = 0;

	vector<int> ii(n);
	for (int i = 0; i < n; i++)
		ii[i] = i;
	sort(ii.begin(), ii.end(), [&](int i, int j) {
		return aa[i] < aa[j];
	});
	for (int k = 1; k <= n; k++) {
		l1 += aa[ii[k - 1]], r1 += aa[ii[n - k]];
		if (l1 <= r0 && r1 >= l0) {
			vector<int> ans; int sum = 0;

			for (int i = 0; i < k; i++)
				ans.push_back(ii[i]), sum += aa[ii[i]];
			for (int i = 0; i < k && sum < l0; i++)
				ans[i] = ii[n - i - 1], sum += aa[ans[i]] - aa[ii[i]];
			return ans;
		}
	}
	return {};
}

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