# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1175010 | FZ_Laabidi | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 320 KiB |
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int sum =0;
sort(w.begin(), w.end());
for(int i: w)sum+=i;
int n = w.size();
vector<vector<int>> dp(sum+1);
for(int i=0; i<sum; i++){
for(int j=0; j<n; j++){
if(i>w[j]){
dp[i]=dp[i-w[j]];
dp[i].push_back(w[j]);
}
}
}
for(int i=l; i<=u; i++){
if(!dp[i].empty())return dp[i] ;
}
return {-1};
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |