# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1199678 | 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> ans;
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;
int L=0,R=1;
while(R<n)
{
// cout<<sum<<"\n";
if(sum<l)
{
sum=sum+w2[R].first;
R++;
}
else if(sum>u)
{
sum=sum-w2[L].first;
L++;
}
else
{
for(int i=L;i<R;i++)
{
ans.push_back(w2[i].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... |