| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1211269 | madamadam3 | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 5312 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
// const int MAX_SUM = 500'000;
// using bset = bitset<MAX_SUM+1>;
int n, l, u;
vector<int> o, w;
vector<int> find_subset(int L, int U, vector<int> W) {
w = W; n = w.size(); l = L; u = U;
o.resize(n); iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int a, int b) {return w[a] < w[b];});
deque<int> as;
long long cur_sum = 0;
for (int i = 0; i < n; i++) {
if (cur_sum < l) {
cur_sum += w[o[i]];
as.push_back(o[i]);
}
while (cur_sum > u) {
cur_sum -= w[as.front()];
as.pop_front();
}
}
vector<int> ans; for (auto &el : as) ans.push_back(el);
if (cur_sum < l || cur_sum > u) ans.clear();
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... | ||||
