# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1251097 | guardianec | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 3112 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> ans,v;
ll lo,hi;
vector<int> find_subset(int l, int u, vector<int> w){
for (int i=0; i<w.size(); i++){
v.push_back(i);
}
sort(v.begin(), v.end(), [&](int a, int b){
return w[a]<w[b];
});
for (int i=0; i<w.size(); i++){
lo+=w[v[i]]; hi+=w[v[w.size()-i-1]];
if (hi>=l && lo<=u){
int j = i;
while(l>lo) {
lo = lo - w[v[j-i]] + w[v[j+1]];
j++;
}
for (int k=j-i; k<=j; k++){
ans.push_back(v[k]);
}
return ans;
}
}
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... |