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