Submission #875484

#	Time	Username	Problem	Language	Result	Execution time	Memory
875484		AverageAmogusEnjoyer	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	348 KiB

molecules

#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, vector<int> w) {
    dp[0]=true;
    return 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))
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31