| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324715 | kasamchi | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 4112 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
v.push_back(make_pair(w[i], i));
}
sort(v.begin(), v.end());
if (v[0].first > u) {
return vector<int>();
} else {
int ll = 0, rr = 0;
long long sum = 0;
while (rr < n && sum < l) {
sum += v[rr].first, rr++;
}
if (sum < l) {
return vector<int>();
} else if (sum <= u) {
vector<int> ans;
for (int i = 0; i < rr; i++) {
ans.push_back(v[i].second);
}
return ans;
} else {
sum -= v[rr - 1].first, rr--;
int ll = 0;
bool ok = false;
while (rr < n) {
while (sum < l) {
sum += v[rr].first, rr++;
}
if (sum <= u) {
ok = true;
break;
}
while (sum > u) {
sum -= v[ll].first, ll++;
}
if (sum >= l) {
ok = true;
break;
}
}
if (!ok) {
return vector<int>();
} else {
vector<int> ans;
for (int i = ll; i < rr; i++) {
ans.push_back(v[i].second);
}
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... | ||||
