# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319356 | mglstew | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 416 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;
vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int, int> > x;
for(int i = 0; i < w.size(); i++){
x.push_back(make_pair(w[i], i));
}
sort(x.begin(), x.end());
int n = x.size();
int L = 0;
int R = 0;
long long sum = 0;
vector<int> a;
while(R < n){
sum += x[R].first;
while(sum > u && L <= R){
sum -= x[L].first;
L++;
}
if(sum >= 1){
for(int i = L; i <= R; i++){
a.push_back(w[i]);
break;
}
}
R++;
}
return a;
}
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... |