# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037325 | biserailieva | Detecting Molecules (IOI16_molecules) | C++14 | 36 ms | 8248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
vector<int> ans;
vector<pair<ll, ll>> v;
ll n=w.size();
for(int i=0; i<w.size(); i++)
{
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
ll i=0, j=0, sum=0;
while(j<n && i<n)
{
while(j<n && sum<l)
{
sum+=v[j++].first;
}
if(sum>=l && sum<=u && v[j-1].first-v[i].first<=u-l)
{
for(int k=i; k<j; k++)
{
ans.push_back(v[k].second);
}
return ans;
}
sum-=v[i].first;
if(sum>=l && sum<=u && v[j-1].first-v[i+1].first<=u-l)
{
for(int k=i+1; k<j; k++)
{
ans.push_back(v[k].second);
}
return ans;
}
i++;
}
return ans;
}
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... |