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;
int n;
vector<int>ans;
vector<int>sub1(int l,int u,vector<int>&w){
for(int i=n;i>=0;i--){
if(i*w[0]>=l && i*w[0]<=u) return vector<int>(i,w[0]);
}
return vector<int>(0);
}
vector<int> find_subset(int l, int u, vector<int> w) {
n=(int)w.size();
sort(w.begin(),w.end());
if(w[0]==w[n-1]) return sub1(l,u,w);
return vector<int>(0);
}
# | 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... |