| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1324616 | riafhasan2010 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size(), mn = w[0];
ll sum = 0;
for (int i = 0; i < n; i++) sum += w[i];
sort(w.begin(), w.end());
if (sum < l or w[0] > u) return vector<int>(0);
vector<int> ans;
sum = 0;
for (int i = 0; sum < l; i++) {
sum += w[i];
ans.push_back(i);
}
return (sum <= u ? ans : vector<int>(0));
}
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... | ||||
