| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1341356 | kantaponz | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n;
n = w.size();
ll sum = 0;
sort(w.begin(), w.end());
vector<int> ans;
priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq;
int i = 0;
while (i < n) {
while (i < n && sum < l) {
pq.emplace(w[i], i);
sum += 1LL * w[i];
i++;
}
if (sum >= l && sum <= u) {
while (!pq.empty()) {
auto [w, idx] = pq.top();
pq.pop();
ans.emplace_back(idx);
}
return ans;
}
while (sum > u) {
sum -= pq.top().first;
pq.pop();
}
if (sum >= l && sum <= u) {
while (!pq.empty()) {
auto [w, idx] = pq.top();
pq.pop();
ans.emplace_back(idx);
}
return ans;
}
}
return ans;
}
/*
g++ grader.cpp molecules.cpp -o o
*/
| # | 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... | ||||
