Submission #737079

#TimeUsernameProblemLanguageResultExecution timeMemory
737079josanneo22Detecting Molecules (IOI16_molecules)C++17
31 / 100
1090 ms41800 KiB
#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second

#include "molecules.h"
const int maxn=1e5+5;
vector<int>dp(maxn);
vector<vector<int>> store(maxn);
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n=w.size();
    dp[0]=1;
    for(int i=0;i<n;i++){
        for (int k = 100005; k >=0;k--) {
            if (k >= w[i] && dp[k - w[i]]==true){
                dp[k] = true;
                store[k]=store[k-w[i]];
                store[k].push_back(i);
            }
        }
    }
    for(int i=l;i<=u;i++){
        if(dp[i]){
            return store[i];
        }
    }
    return vector<int>(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...