| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1322271 | jump | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
//std::vector<int> dp[20010];
int use[20010];
int from[20010];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
std::sort(w.rbegin(),w.rend());
std::priority_queue<std::pair<int,int>> pq;
int sum = 0;
int idx = -1;
int topidx = w.size();
while(sum<l){
idx+=1;
sum+=w[idx];
pq.push({w[idx],idx});
}
while(sum>u){
sum-=pq.top().first;
pq.pop();
topidx-=1;
pq.push({w[topidx],topidx});
}
std::vector<int> ans;
while(!pq.empty()){
ans.push_back(pq.top().second);
pq.pop();
}
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... | ||||
