# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849108 | abcvuitunggio | Detecting Molecules (IOI16_molecules) | C++17 | 38 ms | 6352 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;
vector <pair <int, int>> v;
vector <int> res;
vector <int> find_subset(int l, int u, vector<int> w){
for (int i=0;i<w.size();i++)
v.push_back({w[i],i});
sort(v.begin(),v.end());
int lo=w.size()+1,hi=w.size(),sum=0,pos=0;
for (int i=0;i<v.size();i++){
if (sum>u-v[i].first){
hi=i;
break;
}
sum+=v[i].first;
}
sum=0;
for (int i=v.size()-1;i>=0;i--){
if (sum>=l-v[i].first){
lo=v.size()-i;
break;
}
sum+=v[i].first;
}
if (lo>hi)
return {};
sum=0;
for (int i=0;i<lo;i++)
sum+=v[i].first;
if (sum<l){
for (int i=lo;i<v.size();i++){
if (sum>=l-v[i].first+v[i-lo].first){
pos=i-lo+1;
break;
}
sum+=v[i].first-v[i-lo].first;
}
}
for (int i=pos;i<pos+lo;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... |