| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1343332 | retarde | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
for (int i = 0; i < (int)w.size(); i++) {
if (w[i] >= l && w[i] <= u) {
ans.push_back(i);
return ans;
}
}
vector<pair<int, int>> w2;
for (int i = 0; i < (int)w.size(); i++) w2.push_back({w[i], i});
sort(w2.begin(), w2.end());
reverse(w2.begin(), w2.end());
int cs = 0;
for (int i = 0; i < (int)w2.size(); i++) {
if (cs + w2[i].first <= u) {
cs += w2[i].first;
ans.push_back(w2[i].second);
}
}
if (!(cs >= l)) ans.clear();
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... | ||||
