# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390289 | faresbasbs | Detecting Molecules (IOI16_molecules) | C++14 | 60 ms | 6200 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 , vector<int> w){
vector<pair<int,int>> f;
for(int i = 0 ; i < w.size() ; i += 1){
f.push_back({w[i],i});
}
sort(f.begin(),f.end());
long long sum = 0 , p = 0;
for(int i = 0 ; i < w.size() ; i += 1){
sum += f[i].first;
while(sum > u){
sum -= f[p].first;
p += 1;
}
if(sum >= l && sum <= u){
vector<int> ret;
for(int j = p ; j <= i ; j += 1){
ret.push_back(f[j].second);
}
return ret;
}
}
return vector<int>(0);
}
/*int main(){
vector<int> v = {6,8,8,7};
vector<int> ret = find_subset(15,17,v);
for(int i : ret){
cout << i << " ";
}cout << endl;
}*/
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... |