#include "molecules.h"
//#include "grader.cpp"
#include <bitset>
#include <time.h>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 5e5 + 5;
mt19937 rnd(22);
int dp[MAXN];
void filterVector(vector <int> &v, int lim)
{
vector <int> newVal;
for(int x: v)
{
if(x<=lim) newVal.push_back(x);
}
v = newVal;
}
vector <int> recoverAnswer(int x, vector <int> &w)
{
vector <int> answer;
while(x!=0)
{
answer.push_back(dp[x]);
x = x - w[ dp[x] ];
}
return answer;
}
vector <int> solveSingle(int l, int u, vector <int> &w)
{
for(int i = 0;i<w.size();i++)
{
if(w[i]>=l && w[i]<=u) return vector <int> {i};
}
return vector <int> {};
}
vector <int> solveDouble(int l, int u, vector <int> w)
{
sort(w.begin(), w.end());
for(int i = 0;i<w.size()-1;i++)
{
if(w[i]+w[i+1]>u) break;
if(w[i]+w.back()<l) continue;
int low = i + 1, high = w.size() - 1, mid;
while(low+1<high)
{
mid = (low+high)/2;
if(w[i]+w[mid]>=l) high = mid;
else low = mid + 1;
}
if(low<w.size() && w[i]+w[low]>=l && w[i]+w[low]<=u) return vector <int> {i, low};
if(high<w.size() && w[i]+w[high]>=l && w[i]+w[high]<=u) return vector <int> {i, high};
}
return vector <int> {};
}
vector <int> specialCaseSolutions(int l, int u, vector <int> &w)
{
vector <int> answer = {};
answer = solveSingle(l, u, w);
if(answer.empty()==false) return answer;
answer = solveDouble(l, u, w);
if(answer.empty()==false) return answer;
return vector <int> {};
}
vector<int> find_subset(int l, int u, vector <int> w)
{
shuffle(w.begin(), w.end(), rnd);
double start = clock();
memset(dp, -1, sizeof(dp));
filterVector(w, u);
if(w.empty()==true) return vector <int> {};
vector <int> specialCase = specialCaseSolutions(l, u, w);
if(specialCase.empty()==false) return specialCase;
dp[0] = -2;
for(int i = 0;i<w.size();i++)
{
if(double(clock()-start)/CLOCKS_PER_SEC>0.9)
{
return vector <int> {};
}
for(int j = u-w[i];j>=max(l-w[i], 0);j--)
{
if(dp[j]!=-1 && dp[ j + w[i] ]==-1)
{
dp[ j + w[i] ] = i;
return recoverAnswer(j+w[i], w);
}
}
for(int j = l-w[i]-1;j>=0;j--)
{
if(dp[j]!=-1 && dp[ j + w[i] ]==-1) dp[ j + w[i] ] = i;
}
}
return vector <int> {};
}
Compilation message
molecules.cpp:12:1: error: 'mt19937' does not name a type
12 | mt19937 rnd(22);
| ^~~~~~~
molecules.cpp: In function 'std::vector<int> solveSingle(int, int, std::vector<int>&)':
molecules.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for(int i = 0;i<w.size();i++)
| ~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> solveDouble(int, int, std::vector<int>)':
molecules.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for(int i = 0;i<w.size()-1;i++)
| ~^~~~~~~~~~~
molecules.cpp:67:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | if(low<w.size() && w[i]+w[low]>=l && w[i]+w[low]<=u) return vector <int> {i, low};
| ~~~^~~~~~~~~
molecules.cpp:68:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | if(high<w.size() && w[i]+w[high]>=l && w[i]+w[high]<=u) return vector <int> {i, high};
| ~~~~^~~~~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:89:33: error: 'rnd' was not declared in this scope; did you mean 'rand'?
89 | shuffle(w.begin(), w.end(), rnd);
| ^~~
| rand
molecules.cpp:101:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | for(int i = 0;i<w.size();i++)
| ~^~~~~~~~~
