제출 #878898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878898		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>
#include <vector>
#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 s, int e, 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());
	ll l=0,r=0,sum=bw[0].ff;
	while (r<n) {
		if (sum<s){
			r++;
			if (r==n) break;
			sum+=bw[r].ff;
		}else{
			if (sum<=e){
				vector<ll> ind;
				for (ll i=l; i<=r; i++){
					ind.push_back(bw[i].ss);
				}
				return ind;
			}
			sum-=bw[l].ff;
			l++;
		}
	}
	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