# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875481 | AverageAmogusEnjoyer | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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>
using namespace std;
using ll = long long;
template<class T> bool cmin(T &i, T j) { return i > j ? i=j,1:0; }
template<class T> bool cmax(T &i, T j) { return i < j ? i=j,1:0; }
const int N=1e4,W=5e5+1;
bitset<W> dp;
int find_subset(int l, int u, int w[], int n, int result[]) {
dp[0]=true;
for (int i=0;i<n;i++) {
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
/*
* U - L >= the greatest difference
* Say U - L was 'low'
* that means element aren't so different from each other
* subtract the minimum element from them all
* the maximus sum will be n * (U-L)
* run dp for min and max number of elements to form such sum
* that is, dp[i][j] = (minimum # of elements to form sum j considering first i elements,
* max ...)
* O(n*n*(U-L))
*/