Submission #470018

#	Time	Username	Problem	Language	Result	Execution time	Memory
470018		AdamGS	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	60 ms	7412 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>find_subset(int l, int u, vector<int>w) {
	vector<pair<ll,int>>T;
	int n=w.size();
	rep(i, n) T.pb({w[i], i});
	ll a=l, b=u;
	sort(all(T));
	ll k=0, sum=0;
	vector<int>ans;
	rep(i, n) {
		sum+=T[i].st;
		while(sum>b) {
			sum-=T[k].st;
			++k;
		}
		if(a<=sum && sum<=b) {
			for(int j=k; j<=i; ++j) {
				ans.pb(T[j].nd);
			}
			sort(all(ans));
			return ans;
		}
	}
	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