제출 #821313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821313		Kerim	Detecting Molecules (IOI16_molecules)	C++17	46 / 100	1047 ms	2388 KiB

molecules

#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<bool> dp(u+1, false);
    vector<int> par(u+1);
    dp[0] = true;
    int sum = 0, n = w.size();
    for (int j = 0; j < n; j++){
        int x = w[j];
        for (int i = sum; i >= 0; i--)
            if (i+x <= u and !dp[i+x] and dp[i]){
                dp[i+x] = true;
                par[i+x] = j;
            }
        sum = min(u, sum+x);
    }
    for (int i = l; i <= u; i++)
        if (dp[i]){
            vector<int> answer;
            int j = i;
            while (j){
                answer.push_back(par[j]);
                j -= w[par[j]];
            }
            return answer;
        }
    return vector<int>{};
}

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