# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1186795 | Agageldi | Detecting Molecules (IOI16_molecules) | C++20 | 1095 ms | 1028 KiB |
#include "bits/stdc++.h"
#include "molecules.h"
// #include "grader.cpp"
using namespace std;
#define N 50000005
#define ll long long
ll n, vis[N];
vector <int> ans;
vector<int> find_subset(int l, int u, vector<int> w) {
n = (int)w.size();
ans.clear();
vis[0] = 1;
ll sum = 0;
for(ll j = 0; j < n; j++) {
for(ll i = u; i >= 0; i--) {
if(i + w[j] <= u && vis[i] > 0) {
if(vis[i + w[j]]) continue;
vis[i + w[j]] = j + 1;
if(i + w[j] <= u && i + w[j] >= l) {
i += w[j];
while(i > 0) {
ll x = (vis[i]);
ans.push_back(x - 1);
i -= w[x - 1];
}
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... |