# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1246991 | julia_08 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<int, int>> W;
for(int i=0; i<w.size(); i++) W.push_back({w[i], i});
sort(W.begin(), W.end());
if(W[0].first > u) return {};
for(auto x : W){
if(l <= x.first && x.first <= u){
return {x.second};
}
}
ll sum = 0;
vector<int> ans;
for(int i=0; i<W.size(); i++){
sum += W[i].first;
if(l <= sum && sum <= u){
for(int j=0; j<=i; j++) ans.push_back(W[j].second);
return ans;
}
if(sum > u){
if(l <= sum - W[0].first && sum - W[0].first <= u){
for(int j=1; j<=i; j++) ans.push_back(W[j].second);
return ans;
}
}
}
return {};
}
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... |