# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1262311 | alexiah | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <vector>
#include <algorithm>
using namespace std;
typedef vector <int> vi;
vi find_subset(int l, int u, vi w) {
int n = w.size();
vi ans;
int minum = *min_element(w.begin(), w.end());
int maxnum = minum+1;
vi minind, maxind;
for (int i = 0; i < n; i++) {
if (w[i] == minum) minind.push_back(i);
else maxind.push_back(i);
}
int minc = minind.size() , maxc = maxind.size();
for (int i = 0; i <= minc; i++) {
for (int j = 0; j <= maxc; j++) {
int sum = i * minum + j * maxnum;
if ( l <= sum && sum <= u) {
for (int k = 0; k < i; k++) ans.push_back(minind[k]);
for (int k = 0; k < j; k++) ans.push_back(maxind[k]);
return ans;
}
}
}
return {};
}
컴파일 시 표준 에러 (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... |