# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740506 | JakobZorz | Detecting Molecules (IOI16_molecules) | C++14 | 53 ms | 6172 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 <algorithm>
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w) {
ll sum=0;
vector<pair<int,int>> w2;
for(int i=0;i<w.size();i++)
w2.push_back({w[i],i});
sort(w2.begin(),w2.end());
int m1=0;
for(int m2=0;m2<w.size();m2++){
sum+=w2[m2].first;
while(sum>u){
sum-=w2[m1].first;
m1++;
}
if(sum>=l){
vector<int> res;
for(int i=m1;i<=m2;i++)
res.push_back(w2[i].second);
return res;
}
}
return {};
}
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... |