# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407208 | sad | Detecting Molecules (IOI16_molecules) | C++14 | 56 ms | 6152 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<bits/stdc++.h>
#include "molecules.h"
#define pb push_back
#define ll long long
#define fi first
#define se second
using namespace std;
vector<pair<int,int>>v;
vector<int>ans;
vector<int> find_subset(int l, int u, vector<int> w) {
for(int i=0;i<w.size();i++)
{
v.pb({w[i],i});
}ll sum=0;ll ze=0;
sort(v.begin(),v.end());int r=0;int n=w.size();
for(int i=0;i<n;i++)
{r=max(r,i);sum=max(sum,ze);
while(r<n&&sum+v[r].fi<l)
{
sum+=v[r].fi;
r++;
}
if(r<n&&sum+v[r].fi>=l&&sum+v[r].fi<=u)
{
for(int j=i;j<=r;j++)
{
ans.pb(v[j].se);
}return ans;
}
sum-=v[i].fi;
}
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... |