# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539169 | astoria | Detecting Molecules (IOI16_molecules) | C++14 | 71 ms | 6184 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<int> find_subset(int l, int u, vector<int> w) {
int N = w.size();
vector<pair<int,int> > wni;
for (int i=0; i<N; i++){
wni.push_back(make_pair(w[i],i));
}
sort(wni.begin(), wni.end());
long long sum = 0;
int leftbound=0;
vector<int> finalelements;
for (int i=0; i<w.size(); i++){
sum += wni[i].first;
if (sum >= l && sum <= u){
for (int j=leftbound; j<=i; j++){
finalelements.push_back(wni[j].second);
}
return finalelements;
}
if (sum > u){
sum -= wni[leftbound].first;
leftbound++;
if (sum>=l && sum<=u){
for (int j=leftbound; j<=i; j++){
finalelements.push_back(wni[j].second);
}
return finalelements;
}
}
}
return finalelements;
}
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... |