# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1186953 | rhm_gan | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
multiset<pair<int, int>> s;
long long sum = 0;
vector<int> res;
for (int i = 0; i < n; i++) {
sum += w[i];
s.insert({w[i], i});
while (sum > u) {
auto it = s.begin();
sum -= it -> first;
s.erase(it);
}
if (l <= sum && sum <= u) {
for (auto x : s) {
res.push_back(x.second);
}
return res;
}
}
return res;
}
컴파일 시 표준 에러 (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... |