# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1199690 | 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(),j=0;
long long sum=0;
vector<int> ans;
vector<int> v;
vector<pair<int,int>> w2;
for(int i=0;i<n;i++)
{
w2.push_back({w[i],i});
}
sort(w2.begin(),w2.end());
for(int i=0;i<n;i++)
{
if(sum+w2[i].first>l)
{
break;
}
sum=sum+w2[i].first;
v.push_back(i);
j++;
}
for(int i=n-1;i>=v.back();i--)
{
sum=sum-w2[v[j]].first+w2[i].first;
v[j]=i;
j++;
if(sum>=l)
{
for(int k=0;k<v.size();k++)
{
ans.push_back(w2[v[k]].second);
}
sort(ans.begin(),ans.end());
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... |