# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288843 | Basilhijaz | Detecting Molecules (IOI16_molecules) | C++17 | 2 ms | 1408 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
bool dp[N][N];
int n;
vector<int> ans;
bool ok = 0;
void get(vector<int> arr, int i, int sum, vector<int> an){
if(ok)return;
if(i == 0 && sum != 0 && dp[n - 1][sum]){
an.push_back(i);
for(int a = 0; a < an.size(); a++){
ans.push_back(an[a]);
}
ok = 1;
return;
}
if(i == 0 && sum == 0){
for(int a = 0; a < an.size(); a++){
ans.push_back(an[a]);
}
ok = 1;
return;
}
if(dp[i - 1][sum]){
get(arr, i - 1, sum, an);
}
if(sum >= arr[i] && dp[i - 1][sum - arr[i]]){
an.push_back(i);
get(arr, i - 1, sum - arr[i], an);
}
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
n = w.size();
for(int j = 0; j < n; j++){
for(int i = 0; i <= j; i++){
dp[i][w[j]] = 1;
}
dp[j][0] = 1;
}
for(int i = 1; i < n; i++){
for(int j = 0; j <= 1e4 + 1; j++){
if(j >= w[i]){
dp[i][j] = dp[i - 1][j - w[i]] || dp[i - 1][j];
}
else{
dp[i][j] = dp[i - 1][j];
}
}
}
for(int i = l; i <= u; i++){
if(dp[n - 1][i]){
get(w, n - 1, i, ans);
break;
}
}
sort(ans.begin(), ans.end());
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... |