제출 #489091

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489091		1ne	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	288 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> arr) {
    int n = arr.size();
    int sum = 0;
    for(int i = 0;i<n;++i){
    	sum+=arr[i];
    }
    vector<int>ans;
    if (sum<l){
    	return ans;
    }   
    map<int,int>dp;
    vector<int>par(u+1,-1);
    if (l<sum - u){
    dp[0]=1;
    int val = -1;
    for (int i = 0 ;i<n;++i){ 
    	for (auto j:dp){
    		int x = j.first;
    		if (x+arr[i]>u)continue;
    		if (par[x+arr[i]]!=-1)continue;
    		if (par[x]==i)continue;
    		dp[x+arr[i]]=true;
    		par[x+arr[i]]=i;
    		if (x+arr[i]>=l&&x+arr[i]<=u){
    			val = x+arr[i];
    			break;
    		}
    	}
    	if (val!=-1)break;	
    }
    while(val>0){
    	ans.push_back(par[val]);
    	val-=arr[par[val]];
    }
    }
    else{
    	int temp = sum - l;
     l  = sum - u;
     u = temp;
     dp[0]=1;
    int val = -1;
    for (int i = 0 ;i<n;++i){ 
    	for (auto j:dp){
    		int x = j.first;
    		if (x+arr[i]>u)continue;
    		if (par[x+arr[i]]!=-1)continue;
    		if (par[x]==i)continue;
    		dp[x+arr[i]]=true;
    		par[x+arr[i]]=i;
    		if (x+arr[i]>=l&&x+arr[i]<=u){
    			val = x+arr[i];
    			break;
    		}
    	}
    	if (val!=-1)break;	
    }
    vector<bool>got(n,false);
    bool ok=false;
    while(val>0){
    	ok=true;               
    	got[par[val]]=true;
    	val-=arr[par[val]];
    }
    if (ok)
    for (int i = 0;i<n;++i){
    	if (!got[i])ans.push_back(i);
    }
    }
    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