제출 #61376

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
struct mol{
	int loc;
	long long val;
	bool operator<(const mol& rhs) const{
		return val <= rhs.val;
	}
};
vector<mol> v;
vector<long long> s;
 
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int i, n = w.size();
	mol tmp;
	for( i = 0; i < n; i++){
		tmp.loc = i;
		tmp.val = w[i];
		v.push_back(tmp);
	}
	
	sort(v.begin(), v.end());
	
	s.push_back(0LL);
	
	for(i = 0; i < n; i++){
		s.push_back(s[i] + (long long)v[i].val);
	}
	
	for( i = 1;i <=n ; i++){
		if(s[i ] > (long long)u){
			break;
		}
		if(s[n] - s[ n - i] >= (long long)l){
			break;
		}
	}
	if(s[i] > (long long)u || i == n + 1){
		return std::vector<int>(0);
	}
	vector<int> ans;
	int j;
	if(n == i){
		for(i = i - 1; i >= 0 ; i--){
			ans.push_back(v[i].loc);
		}
		return ans;
	}
	for( j = 1; i>0 ;j++){
		if(n - j == i -1){
			for(i = i - 1; i >= 0 ; i--){
				ans.push_back(v[i].loc);
			}
			break;
		}
		if(s[n - j] - s[n - i -j] < (long long)l){
			ans.push_back(v[n - j].loc);
			l -= v[n - j].val;
			i--;
			if(i == 0){
				break;
			}
		}
	}
	return ans;
}

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