# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1199626 | lufychop20171 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
int n=w.size(),vb,j=0;
vector<int> v;
sort(w.begin(),w.end());
int sum=w[0];
v.push_back(1);
vb=1;
for(int i=1;i<n;i++)
{
if(sum+w[i]>l)
{
break;
}
sum=sum+w[i];
v.push_back(i+1);
vb=i+1;
}
for(int i=n-1;i>=vb && j<v.size();i--)
{
sum=sum+w[i]-w[v[j]];
v[j]=i;
j++;
if(sum>=l)
{
sort(v.begin(),v.end());
return v;
}
}
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... |