# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1136252 | alterio | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4132 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();
int R = 0;
long long sum = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) v.push_back({w[i], i});
sort(v.begin(), v.end());
for (int L = 0; L < n;) {
while (sum < l && R < n) {
sum += v[R].first;
R++;
}
if (sum < l) break;
if (sum > u) {
sum -= v[L].first;
L++;
continue;
}
vector<int> ans;
for (int i = L; i < R; i++) ans.push_back(v[i].second);
return ans;
}
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... |