Submission #82685

#	Time	Username	Problem	Language	Result	Execution time	Memory
82685		arman_ferdous	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	77 ms	31652 KiB

molecules

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

vector<int> ret;
vector<pair<int,int> > v;

void get(int l, int r) {
	for(int i = l; i <= r; i++)
		ret.push_back(v[i].second);
}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int n = w.size();
	for(int i = 0; i < n; i++)
		v.push_back({w[i],i});
	sort(v.begin(),v.end());

	if(v[0].first > u) return ret;
	long long x = 0, sum = v[0].first;
	while(x + 1 < n && sum + v[x + 1].first < l) { sum += v[x + 1].first; x++; }

	if(x + 1 < n && sum + v[x + 1].first <= u && sum + v[x + 1].first >= l) {
		get(0,x+1);
		return ret;
	}
	if(l <= sum && sum <= u) {
		get(0,x);
		return ret;
	}
	for(int i = x + 1; i < n; i++) {
		sum += v[i].first;
		sum -= v[i - x - 1].first;
		if(l <= sum && sum <= u) {
			get(i - x, i);
			return ret;
		}
	}
    return ret;
}

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