| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1322242 | jump | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
std::vector<int> dp[20010];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
for(int c=0;c<w.size();c++){
for(int i=u;i>=0;i--){
std::vector<int> temp = dp[i];
if(dp[i].size()==0&&i!=0)continue;
temp.push_back(w[c]);
dp[i+w[c]]=temp;
}
}
std::vector<int> ans;
for(int i=l;i<=u;i++){
if(dp[i].size()!=0){
ans=dp[i];
break;
}
}
return ans;
}
컴파일 시 표준 에러 (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... | ||||
