제출 #299637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299637		Valee	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	64 ms	6380 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

#define ll long long
#define snd second
#define fst first

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	bool ok = false;
	vector<int>ans;
	vector<pair<int, int>>v;
	int n = (int)w.size();
	for (int i = 0; i < n; i++)
		v.push_back(make_pair(w[i], i));
	sort(v.begin(), v.end());
	int lb = 0, rb = n+1, lans = 0, rans = 0;
	while (lb < rb && !ok){
		// cout << lb << " " << rb << endl;
		ll m = (lb+rb)>>1, sum = 0;
		for (int i = 0; i < n; i++){
			if (i < m) sum += v[i].fst;
			else sum += v[i].fst-v[i-m].fst;
			if (l <= sum && sum <= u){
				lans = max(0LL, i-m+1); rans = i;
				ok = true;
				break;
			}
		}
		if (sum >= u) rb = m;
		else lb = m+1;
	}
	if (ok){
		for (int i = lans; i <= rans; i++)
			ans.push_back(v[i].snd);
	}
	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