# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232431 | UserIsUndefined | Detecting Molecules (IOI16_molecules) | C++14 | 9 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include "molecules.h"
using namespace std;
int dp[500005];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
dp[0] = 1;
int cont = 1;
for (int i = 1 ; i <= n ; i++){
int now = w[i-1];
int cont1 = 0;
for (int j = w[i-1] ; j <= 500000 ; j++){
if ((dp[j - w[i - 1]])&&(dp[j- w[i - 1]] != i + 1)){dp[j] = i + 1; cont1++;}
if (cont1 == cont)break;
}
cont+= cont1;
}
vector<int> ans;
int k = -1;
for (int i = l ; i <= u ; i++){
if (dp[i] > 0){k = i ; break;}
}
if (k == -1)return ans;
for (int i = dp[k] - 2 ; i >= 0 ; i--){
if (w[i] > k)continue;
if (dp[k - w[i]]){
ans.push_back(i);
k-= w[i];
if (k == 0)return ans;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |