# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1187757 | dirtycodehehe | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
vector<int> find_subset(int k, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> a(n); // {giá trị, chỉ số ban đầu}
for (int i = 0; i < n; i++) {
a[i] = {w[i], i};
}
sort(a.begin(), a.end()); // sắp tăng theo giá trị
ll sum = 0;
vector<int> res;
for (int i = 0; i < n; i++) {
sum += a[i].first;
res.push_back(a[i].second);
if (sum >= k && sum <= u) {
return res; // tìm được rồi
}
}
return {}; // không có tập con nào thỏa mãn
}
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... |