| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299904 | tuncay_pasha | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 348 KiB |
#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> v;
for (int i = 0; i < w.size(); ++i) {
v.push_back({w[i], i});
}
sort (v.begin(), v.end());
int lp = 0, rp = 0, cur = w[0];
while (lp < v.size() && rp < v.size()) {
if (l <= cur && cur <= u) {
vector<int> ans;
for (int i = lp; i <= rp; ++i) {
ans.push_back(v[i].second);
}
sort (ans.begin(), ans.end());
return ans;
}
else if (cur < l) {
if (rp + 1 >= v.size()) {
break;
}
++rp, cur += v[rp].first;
}
else {
if (lp + 1 > rp) {
break;
}
cur -= v[lp].first, ++lp;
}
}
return {};
}
컴파일 시 표준 에러 (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... | ||||
