# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1197517 | vivkostov | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 324 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
long long int n,l,r,a[200005];
vector<int>v;
std::vector<int> find_subset(int L, int R, std::vector<int> W)
{
n=W.size();
l=L;
r=R;
long long int sum=0;
for(int i=1;i<=n;i++)
{
a[i]=W[i-1];
sum+=a[i];
}
if(sum<r)return v;
sort(a+1,a+n+1);
for(int i=n;i>=1;i--)
{
while(i>0&&r-a[i]<a[1])i--;
if(i==0)break;
v.push_back(i);
r-=a[i];
l-=a[i];
}
if(l<=0&&r>=0)return v;
v.clear();
return v;
}
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... |