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