| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1350607 | waygonz | Detecting Molecules (IOI16_molecules) | C++20 | 28 ms | 4376 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
deque<int> dq;
vector<pair<int, int>> a;
vector<int> ans;
for (int i = 0; i < w.size(); i++) a.emplace_back(w[i], i);
sort(a.begin(), a.end());
long long sum = 0;
for (auto &[x, y] : a) {
sum += x;
dq.emplace_back(y);
while (!dq.empty() && sum > u) sum -= w[dq.front()], dq.pop_front();
if (l <= sum && sum <= u) {
for (auto &e : dq) ans.emplace_back(e);
return ans;
}
}
return ans;
}
| # | 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... | ||||
