# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287355 | kshitij_sodani | Detecting Molecules (IOI16_molecules) | C++14 | 68 ms | 9060 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>
using namespace std;
typedef long long int llo;
#define a first
#define b second
#define pb push_back
#define mp make_pair
#include "molecules.h"
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<llo,llo>> it;
for(int i=0;i<w.size();i++){
it.pb({w[i],i});
}
sort(it.begin(),it.end());
deque<pair<llo,llo>> xx;
llo su=0;
for(auto j:it){
su+=j.a;
xx.pb(j);
while(su>u){
su-=xx.front().a;
xx.pop_front();
}
if(su>=l and su<=u){
vector<int> ans;
for(auto j:xx){
ans.pb(j.b);
}
sort(ans.begin(),ans.end());
return ans;
}
}
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... |