| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1317967 | _unknown_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector
vector<int> find_subset(int l, int u, vector<int> w) {
deque<int> v;
long long s=0, n=w.size();
vi<int> o(n);
iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int i, int j){ return w[i] > w[j]; });
for(int i:o){
s += w[i];
v.push_back(i);
if(s>u){
s-=w[v[0]];
v.pop_front();
continue;
}
if(s>=l && s<=u)break;
}
vi<int> ans;
for(auto &x:v)ans.push_back(x);
if(s<l || s>u)return vi<int>{0};
else 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... | ||||
