# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1240226 | ciao_gio | Detecting Molecules (IOI16_molecules) | C++20 | 32 ms | 2888 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> idx(n);
iota(begin(idx), end(idx), 0);
sort(begin(idx), end(idx), [&](int i, int j) { return w[i] < w[j]; });
vector<int> r;
int a = 0, b = 0;
long long s = 0;
while (b < n) {
s += w[idx[b++]];
while (s > u) {
s -= w[idx[a++]];
}
if (s >= l) {
for (int i = a; i < b; i++) {
r.push_back(idx[i]);
}
break;
}
}
return r;
}
컴파일 시 표준 에러 (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... |