| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1317093 | marzuq01 | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
using namespace std;
int n = w.size();
vector<int> nope;
for (int i = 0;i < n;i++) {
if (l <= w[i] && w[i] <= u) {
return {i};
}
}
vector<pair<int,int>> v;
for (int i = 0; i < n;i++) {
if (w[i] < l) v.push_back({w[i],i});
}
if (v.size() <= 1) return nope;
sort(v.begin(),v.end());
// 9p: wi are equal
int kl = (l + v[0].first - 1)/v[0].first;
//int ku
if (kl <= v.size() && kl * v[0].first <= u) {
vector<int> result;
for (int i = 0; i < kl;i++) result.push_back(i);
return result;
} else return nope;
}
컴파일 시 표준 에러 (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... | ||||
