# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472841 | Erik_Gepard | Detecting Molecules (IOI16_molecules) | C++14 | 4 ms | 208 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 l, int u, std::vector<int> w) {
int n=w.size();
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(sum<l && j<n){
sum+=w[j];
j++;
}
if(sum<=u && sum>=l){
helyesi=i;
helyesj=j;
}
sum-=a[i].first;
}
vector<int> ans;
for(int i=helyesi; i<helyesj; i++){
ans.push_back(a[i].second);
}
if(helyesi!=-1) return ans;
else 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... |