# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595389 | Dan4Life | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 212 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 r, vector<int> w) {
int n = (int)w.size(), sum = 0, z=0;
vector<pair<int,int> > v;
vector<int> ans, x;
for(int i = 0; i < n; i++){
if(w[i]>r) continue;
if(w[i]>=l){ ans.push_back(i); return ans; }
v.push_back({w[i],i});
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
for(int i = 0; i < n; i++)
{
int num = v[i].first, ind = v[i].second;
if(sum+num>r) continue;
if(sum+num<=r){
sum+=num, ans.push_back(ind);
if(sum>=l) return ans;
}
}
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... |