# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336656 | shrek12357 | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 364 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
#include "molecules.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);
const int VAL = 5 * 1e5 + 5;
vector<int> find_subset(int l, int u, vector<int> w) {
int dp[10005];
dp[0] = 1;
for (int i = u; i >= 0; i--) {
for (int j = 0; j < w.size(); j++) {
if (dp[i] > 0) {
dp[i + w[j]] = 1;
}
}
}
vector<int> ans;
int val = -1;
for (int i = l; i <= u; i++) {
if (dp[i] == 1) {
val = i;
}
}
if (val == -1) {
return ans;
}
for (int i = 0; i < w.size(); i++) {
if (w[i] <= val && dp[val - w[i]] == 1) {
ans.push_back(i);
val -= w[i];
}
}
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... |