# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109359 | dantoh000 | Detecting Molecules (IOI16_molecules) | C++14 | 90 ms | 6252 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<int> ans;
ans.clear();
vector<pair<int,int> > v;
v.clear();
long long all = 0;
for (int i = 0; i < w.size(); i++){
v.push_back(make_pair(w[i],i));
all += w[i];
}
sort(v.begin(),v.end());
sort(w.begin(),w.end());
if (w[0] > u || all < (long long)l){
return ans;
}
int s = 0, e = 0;
long long sum = 0;
while (s <= n && e <= n && (sum > u || sum < l)){
if (sum > u){
sum -= w[s++];
}
else{
sum += w[e++];
}
}
if (sum > u || sum < l) return ans;
//printf("%d\n",sum);
for (int i = s; i < e; i++){
ans.push_back(v[i].second);
}
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... |