제출 #878891

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878891		Gray	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	348 KiB

molecules

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#include <cassert>
#define ll long long
#define ln "\n"
#define ff first
#define ss second
#define ld long double
const ll INF = 2e18;
const ll MOD = 1e9+7;
using namespace std;

vector<ll> find_subset(int l, int u, std::vector<int> w) {
	ll n = w.size();
	vector<pair<ll, ll>> bw(n);
	for (ll i=0; i<n; i++){
		bw[i] = {w[i], i};
	}
	sort(bw.rbegin(), bw.rend());
	vector<ll> ind;
	ll sum = 0;
	ll cp = 0;
	while (cp<n and sum+bw[cp].ff<=u){
		ind.push_back(bw[cp].ss);
		sum+=bw[cp].ff;
		cp++;
	}
	ll ccp = n-1;
	while (ccp>cp and sum+bw[ccp].ff<=l){
		ind.push_back(bw[ccp].ss);
		sum+=bw[ccp].ff;
		ccp--;
	}

	if (sum>=l and sum<=u){
		return ind;
	}else return vector<ll>(0);
}

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