Submission #958823

#	Time	Username	Problem	Language	Result	Execution time	Memory
958823		MinaRagy06	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	508 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long

vector<int> find_subset(int l, int r, vector<int> w) {
	int n = w.size();
	array<int, 2> a[n];
	for (int i = 0; i < n; i++) {
		a[i][0] = w[i];
		a[i][1] = i;
	}
	sort(a, a + n);
	ll prf[n + 1]{};
	for (int i = 0; i < n; i++) {
		prf[i + 1] = prf[i] + a[i][0];
	}
	ll s = 0;
	for (int i = n; i >= 0; i--) {
		int p = lower_bound(prf, prf + n + 1, l - s) - prf;
		if (l <= prf[p] + s && prf[p] + s <= r) {
			vector<int> ans;
			for (int j = 0; j < p; j++) {
				ans.push_back(a[j][1]);
			}
			for (int j = i; j < n; j++) {
				ans.push_back(a[j][1]);
			}
			return ans;
		}
		if (i - 1 >= 0) s += a[i - 1][0];
	}
	return {};
}

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