Submission #273041

#	Time	Username	Problem	Language	Result	Execution time	Memory
273041		ggooroo	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	66 ms	6776 KiB

molecules

#include "molecules.h"

#include <cstdio>
#include <iostream>
#include <algorithm>
#define F first
#define S second
#define N 200005
using namespace std;

typedef long long ll;
vector<int> ans;

ll n, v[N];
pair<ll, ll> a[N];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	ll i, j, s, en, r = u;
	n = w.size();
	for (i =0; i <n; i++) {
		a[i].F = w[i];
		a[i].S = i;
	}
	sort(a, a + n);
	s = 0;
	for (i =0; i< n; i++) {
		if (s + a[i].F <= r) {s += a[i].F; v[a[i].S] = 1;}
		else break;
	}
	en = i;
	for (i = 0, j = en; j < n && s < l; i++, j++) {
		s -= a[i].F;
		s += a[j].F;
		v[a[i].S] = 0;
		v[a[j].S] = 1;
	}
	if (s < n) {
		for (i = 0; i < n; i++) {
			if (v[i]) continue;
			if (s + w[i] <= r) {
				v[i] = 1;
				s += w[i];
			}
		}
	}
	if (s < l) return ans;
	for (i =0; i < n; i++) if (v[i]) ans.push_back(i);
	return ans;
}

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