# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232396 | UserIsUndefined | Detecting Molecules (IOI16_molecules) | C++14 | 5 ms | 384 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"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int,int>> v;
for (int i = 0 ; i < w.size() ; i++){
v.push_back({w[i] , i});
}
sort(v.begin(), v.end());
vector<int> ans;
int i = 0;
int j = 0;
long long sum = 0;
while(j < v.size()){
if (sum < l){
sum+= v[j].first;
j++;
}
else if (sum > u){
sum-= v[i].first;
i++;
}
else {
for (int x = i ; x < j ; x++){
ans.push_back(v[x].second);
}
break;
}
}
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... |