제출 #305504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
305504		tengiz05	Detecting Molecules (IOI16_molecules)	C++14	31 / 100	1043 ms	13184 KiB

molecules

#include "molecules.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<vector<bool>> dp(10001, vector<bool> (n));
	vector<bool> able(10001);
	vector<int> ans;
	
	int sum = 0;
	for(auto x : w)sum += x;
	if(sum < l)return ans;
	/*
	queue<pair<int, vector<bool>> q;
	queue.push({0, dp[0]});
	
	while(!q.empty()){
		auto tt = q.top();
		int t = q.first;
		if(t > u)continue;
		if(t >= l && t <= u){
		
		}
	}*/
	able[0] = true;
	for(int i=0;i<10000;i++){
		if(!able[i])continue;
		if(i >= l){
			if(i <= u){
				for(int j=0;j<n;j++){
					if(dp[i][j])ans.push_back(j);
				}
			}
			break;
		}
		for(int j=0;j<n;j++){
			if(i+w[j] <= 10000 && !dp[i][j]){
				able[i+w[j]] = true;
				dp[i+w[j]] = dp[i];
				dp[i+w[j]][j] = true;
			}
		}
	}
	
    return ans;
}

/*

4 15 17
6 8 8 7

4 14 15
5 5 6 6

4 10 20
15 17 16 18

*/

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