# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596947 | Pyishtell | Detecting Molecules (IOI16_molecules) | C++17 | 61 ms | 5224 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;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int,int>> p;
for(int i=0; i<n; i++){
p.push_back({w[i],i});
}
sort(p.begin(),p.end());
ll sum=0;
vector<int> ans;
for(int i=0; i<n && sum+p[i].first<=u; i++){
ans.push_back(p[i].second);
sum += p[i].first;
if(sum>=l) return ans;
}
ll maxSum=0;
for(int j=0; j<ans.size(); j++){
maxSum += p[n-1-j].first;
}
if(maxSum<l) return vector<int>(0);
for(int k=0; k<ans.size(); k++){
sum -= (p[k].first-p[n-1-k].first);
ans[k] = p[n-1-k].second;
if(sum>=l) 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... |