| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1309341 | shirokito | Detecting Molecules (IOI16_molecules) | C++20 | 157 ms | 672 KiB |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
using ll = long long;
const int N = 5e5 + 5;
bitset<N> dp;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
dp[0] = 1;
for (int &x: w) {
dp |= (dp << x);
}
int cur = -1;
for (int x = l; x <= u; x++) {
if (dp[x] == 1) {
cur = x;
break;
}
}
vector<int> ans;
for (int i = 0; i < n; i++) {
if (cur - w[i] >= 0 && dp[cur - w[i]]) {
ans.push_back(i);
cur -= w[i];
}
}
if (cur == 0) return ans;
return vector<int> {};
}
#ifdef LOCAL
void solve() {
int n, l, u; cin >> n >> l >> u;
vector<int> w(n); for (int &x: w) cin >> x;
auto ans = find_subset(l, u, w);
for (int x: ans) cout << x << ' ';
cout << '\n';
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int T = 1; // cin >> T;
while (T--) {
solve();
}
}
#endif
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... | ||||
