# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1223057 | LeonidCuk | Detecting Molecules (IOI16_molecules) | C++20 | 37 ms | 6176 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int>find_subset(int x,int y,vector<int> v1)
{
int l=0;
int n=v1.size();
vector<int>res;
long long sum=0;
vector<pair<long long,int>>v;
for(int i=0;i<n;i++)v.push_back({v1[i],i});
sort(v.begin(),v.end());
for(int i=0;i<n;i++)
{
sum+=v[i].first;
while(sum>y)
{
sum-=v[l].first;
l++;
}
if(x<=sum&&sum<=y)
{
for(int j=l;j<=i;j++)
{
res.push_back(v[j].second);
}
break;
}
}
return res;
}
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... |