Submission #710038

#	Time	Username	Problem	Language	Result	Execution time	Memory
710038		Baytoro	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	40 ms	5540 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
vector<pair<int,int>> vec;
vector<int> get(int l, int r){
	vector<int> ans;
	for(int i=l;i<=r;i++) ans.push_back(vec[i].second);
	sort(ans.begin(),ans.end());
	return ans;
}
vector<int> find_subset(int v, int u, vector<int> w) {
	int n=w.size();
	int sum=0;
	for(int i=0;i<n;i++)
		vec.push_back({w[i],i});
	sort(vec.begin(),vec.end());
	int l=0;
	for(int r=0;r<n;r++){
		sum+=vec[r].first;
		if(sum<v) continue;
		if(v<=sum && sum<=u){
			return get(l,r);
		}
		else{
			while(l<=r && sum>u){
				sum-=vec[l].first;
				l++;
			}
			if(v<=sum && sum<=u){
				return get(l,r);
			}
		}
	}
	return {};
}

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