제출 #425352

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

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define pb push_back
#define pi pair<int,int>
#define w first
#define ind second
#define ll long long
#define mp make_pair
vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	
	//set<pi> weights;
	vector<pi> weights(n);
	for(int i =0; i<n ;i++){
		//weights.insert({w[i], i});
		weights[i] = {w[i], i};
	}
	sort(weights.begin(), weights.end());
	
	vector<int> ans;
	
	
	ll cursum = 0;
	for(int i = n-1; i>= 0; i--){
		if( cursum + weights[i].w > u) continue;
		
		cursum += weights[i].w;
		
		ans.pb(weights[i].ind);
		
		if( l <= cursum && u >= cursum){
			sort(ans.begin(), ans.end());
			return ans;
		}
		
	}
	/*auto it = weights.begin();
	while(true){
		it = lower_bound(weights.begin(), weights.end(), mp(u - cursum + 1, - 1) );
		if(it == weights.begin())
			break;
		it = prev(it);
		cout << it ->w<<endl;

		cursum += it->w;
		ans.pb(it->ind);
		it = weights.erase(it);

		if( l<= cursum and cursum <=u){
			sort(ans.begin(), ans.end());
			//for(int a : ans)cout << a <<",";
			//cout <<endl;
			return ans;
		}
		if(it == weights.begin()){
			break;
		}
		
		it = prev(it);
			
	}
	*/
    return  vector<int>();
}


/***************/

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