# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1186954 | GoBananas69 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> res;
int sum = 0;
for (int i = 0; i < n; ++i) {
if (sum < l) {
sum += w[i];
res.push_back(i + 1);
} else if (sum > u) {
return {};
} else {
return res;
}
}
if (sum >= l && sum <= u) {
return res;
}
return {};
}
// signed main() {
// cin.tie(0)->sync_with_stdio(0);
// vector<int> res = find_subset(30, 33, {5, 5, 5, 5, 5, 5});
// for (int i = 0; i < res.size(); ++i) {
// cout << res[i] << '\n';
// }
// }
컴파일 시 표준 에러 (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... |