# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1191359 | Aviansh | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 4128 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int>ans;
int n = w.size();
vector<array<int,2>>sor;
for(int i = 0;i<w.size();i++){
sor.push_back({w[i],i});
}
sort(sor.begin(),sor.end());
int lef = 0;
int rig = -1;
long long curr = 0;
while(rig<n){
while(curr>u){
curr-=sor[lef][0];
lef++;
}
if(curr>=l){
break;
}
rig++;
curr+=sor[rig][0];
}
if(curr<l||curr>u)
return ans;
for(int i = lef;i<=rig;i++){
ans.push_back(sor[i][1]);
}
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... |