# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472913 | Erik_Gepard | Detecting Molecules (IOI16_molecules) | C++14 | 50 ms | 4292 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;
std::vector<int> find_subset(int ll, int uu, std::vector<int> w) {
int n=w.size();
vector<int> ans;
int l=ll;
int u=uu;
vector<pair<int, int> > a(w.size());
for(int i=0; i<w.size(); i++){
a[i].first=w[i];
a[i].second=i;
}
sort(a.begin(), a.end());
int sum=0;
int j=0;
int helyesi=-1, helyesj=-1;
for(int i=0; i<n; i++){
while(j<n && sum+a[j].first<=u){
sum+=a[j].first;
j++;
}
if(sum>=l){
for(int q=i; q<j; q++){
ans.push_back(a[q].second);
}
return ans;
}
sum-=a[i].first;
}
return vector<int>(0);
}
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... |