Submission #199399

#	Time	Username	Problem	Language	Result	Execution time	Memory
199399		kshitij_sodani	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1088 ms	504 KiB

molecules

#include <iostream>
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef  long long int llo ;

#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<int> find_subset(int l,int u,vector<int> w){
	bitset<500001> dp;
	dp.set(0);
	int n=w.size();
	for(int j=0;j<n;j++){
		for(int i=500001;i>=w[j];i--){
			if(dp[i-w[j]]){
				dp.set(i);
			}
		//	dp[i] =dp[i] | dp[i-w[j]];
		}
	}
	int ind=-1;
	for(int i=l;i<u+1;i++){
		if(dp[i]){
			ind=i;
			break;
		}
	}
	//cout<<ind<<endl;
	//cout<<w[dp[15]]<<endl;
	vector<int> ans;
	if(ind==-1){
		return ans;
	}
	bitset<10001> vis;
	while(ind>0){
		for(int i=0;i<n;i++){
			if(vis[i]){
				continue;
			}
			if(w[i]<=ind){
				if(dp[ind-w[i]]){
					ans.pb(i);
					vis.set(i);
					ind-=w[i];
					break;
				}
			}
		}
	}
	return ans;
}
/*
int main(){

	vector<int> ss=find_subset(15,17,{6,8,8,7});
	for(int i=0;i<ss.size();i++){
		cout<<ss[i]<<" ";
	}
	cout<<endl;


	return 0;


}*/

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