# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160605 | nafis_shifat | Detecting Molecules (IOI16_molecules) | C++14 | 95 ms | 6252 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>
#define pii pair<int,int>
#define ll long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<pii> v;
for(int i=0;i<w.size();i++)v.emplace_back(w[i],i);
sort(v.begin(),v.end());
vector<int> res;
int _r=-1;
for(int i=0;i<v.size();i++)
{
if(v[i].first<=u&&v[i].first>=l)
{
res.push_back(v[i].second);
return res;
}
if(v[i].first<l)_r=i;
}
ll cs=0;
int _l=-1;
for(int i=_r;i>=0;i--)
{
cs+=v[i].first;
if(cs>=l&&cs<=u)
{
_l=i;
break;
}
if(cs>u)
{
cs-=v[_r].first;
_r--;
if(cs>=l&&cs<=u)
{
_l=i;
break;
}
}
}
if(_l==-1)
{
return res;
}
for(int i=_l;i<=_r;i++)res.push_back(v[i].second);
sort(res.begin(),res.end());
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... |