Submission #88391

#	Time	Username	Problem	Language	Result	Execution time	Memory
88391		amiratou	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	4 ms	636 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)

typedef pair <int, int> pii;

// return value: result if solution exists and empty vector otherwise
vector<int> find_subset( int l, int u, vector<int> w ) {
	int n = w.size();
	vector<pii> wp(n);
	forn(i, n)
		wp[i] = {w[i], i};
	mt19937 rnd(239);
	forn(_, 1000) {
		shuffle(wp.begin(), wp.end(), rnd);
		int sum = 0, i = 0;
		while (i < n && sum < l)
			sum += wp[i++].first;
		if (l <= sum && sum <= u) {
			vector<int> res(i);
			forn(j, i)
				res[j] = wp[j].second;
			return res;
		}
	}
	return vector<int>();
}

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