제출 #362130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
362130		penguinhacker	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	61 ms	3564 KiB

molecules

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

#define ll long long
#define ar array

vector<int> find_subset(int l, int r, vector<int> w) {
	int n = w.size();
	vector<pair<int, int>> v(n);
	for (int i = 0; i < n; ++i) {
		v[i].first = w[i];
		v[i].second = i;
	}
	sort(v.begin(), v.end());
	if (accumulate(w.begin(), w.end(), 0ll) < l) return {};
	ll cur = 0;
	int ind = 0;
	for (; cur < l; ++ind) cur += v[ind].first;
	if (cur <= r) {
		vector<int> d(ind);
		for (int i = 0; i < ind; ++i) d[i] = v[i].second;
		return d;
	}
	cur -= v[--ind].first;
	vector<int> d(ind);
	iota(d.begin(), d.end(), 0);
	for (int i = ind - 1; i >= 0 && cur < l; --i) {
		cur += v[n + i - ind].first - v[i].first;
		d[i] = n + i - ind;
		if (cur >= l) break;
	}
	if (cur < l) return {};
	for (int& i : d) i = v[i].second;
	return d;
}

/*int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int l = 1, r = 1;
	vector<int> w = {1};
	vector<int> ans = find_subset(l, r, w);
	cout << ans.size() << "\n";
	for (int i : ans) cout << i << " ";
	return 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