# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1221048 | madamadam3 | Detecting Molecules (IOI16_molecules) | C++20 | 30 ms | 3400 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<int> wsort(n); iota(wsort.begin(), wsort.end(), 0);
sort(wsort.begin(), wsort.end(), [&](int a, int b) {return w[a] < w[b];});
vector<int> ans;
vector<int> prefix(n+1, 0); for (int i = 1; i <= n; i++) prefix[i] = prefix[i-1] + w[wsort[i-1]];
for (int i = 1; i <= n; i++) {
int lo = i-1, hi = n;
while (lo < hi) {
int mid = lo + (hi - lo + 1) / 2;
if (prefix[mid] - prefix[i - 1] <= u) {
lo = mid;
} else {
hi = mid - 1;
}
}
int pv = prefix[lo] - prefix[i-1];
if (l <= pv && pv <= u) {
for (int k = i-1; k < lo; k++) ans.push_back(wsort[k]);
break;
}
}
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... |