Submission #28944

#	Time	Username	Problem	Language	Result	Execution time	Memory
28944		h0ngjun7	Detecting Molecules (IOI16_molecules)	C++14	31 / 100	3 ms	3652 KiB

molecules

#include "molecules.h"
#include <deque>
#include <algorithm>
using namespace std;
typedef long long ll;
int n;
struct PT {
	int x, i;
} c[200005];
inline bool cmp(const PT &a, const PT &b) {
	return a.x < b.x;
}
vector<int> find_subset(int l, int u, vector<int> w) {
	vector <int> ans = {};
	for (auto &t : w) c[n] = { t, n }, n++;
	sort(c, c + n, cmp);
	ll s = 0;
	int r = 0;
	deque <int> con;
	for (int i = 0; i < n; i++) {
		if (s + c[i].x > u) break;
		s += c[i].x;
		r = i;
		con.push_back(c[i].i);
	}
	if (r == n - 1 && s < l) return ans;
	while (r <= n - 1 && s < l) {
		s -= w[con.front()];
		con.pop_front();
		con.push_back(c[r + 1].i);
		s += c[r + 1].x;
		r++;
	}
	if (l <= s && s <= u) {
		while (!con.empty()) ans.push_back(con.front()), con.pop_front();
	}
	return ans;
}

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