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;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int>ans;
map<ll, ll>mp;
for(auto i:w)
mp[i]++;
for(auto i:mp){
ll num=(l+i.first-1)/i.first;
if(num<=i.second && num*i.first<=u){
for(int j=1; j<=num; j++){
ans.push_back(i.first);
}
//cout<<1<<endl;
return ans;
}
if(mp[i.first+1]){
ll cur=l-i.second*i.first;
ll num1=(cur+(i.first+1)-1)/(i.first+1);
if(num1<=mp[i.first+1] && i.second*i.first+num1*(i.first+1)<=u){
for(int j=1; j<=i.second; j++){
ans.push_back(i.first);
}
for(int j=1; j<=num1; j++){
ans.push_back(i.first+1);
}
//cout<<2<<endl;
return ans;
}
}
if(mp[i.first-1]){
ll cur=l-i.second*i.first;
ll num1=(cur+(i.first-1)-1)/(i.first-1);
if(num1<=mp[i.first-1] && i.second*i.first+num1*(i.first-1)<=u){
for(int j=1; j<=i.second; j++){
ans.push_back(i.first);
}
for(int j=1; j<=num1; j++){
ans.push_back(i.first-1);
}
//cout<<3<<endl;
return ans;
}
}
}
return ans;
}
/*
{} []
7
13 14
2 2 3 3 3 4 4
*/
# | 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... |