이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
vector<int> find_subset(int l, int u, vector<int> w) {
dp[0]=true;
vector<int> res;
return res;
}
/*
* 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))
*/
# | 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... |