# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1198371 | grafff | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#ifdef molecules.h
#include "molecules.h"
#endif
#include <bits/stdc++.h>
using namespace std;
vector <int> find_subset(int l, int u, vector <int> w){
int n = w.size(), res = 0;
unordered_map <int, int> mp;
vector <int> st = {0};
mp[0] = -1;
bool flag = false;
for(int i = 0; i < n; i++){
int k = st.size();
for(int j = 0; j < k; j++){
int x = st[j] + w[i];
if(mp[x] == 0 && w[0] != x){
mp[x] = i;
st.push_back(x);
}
if(l <= x && x <= u){
flag = true;
res = x;
break;
}
}
if(flag){
break;
}
}
vector <int> ans;
int x = mp[res];
while(x >= 0){
ans.push_back(x);
res -= w[x];
x = mp[res];
}
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... |