# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1256978 | kawhiet | Detecting Molecules (IOI16_molecules) | C++20 | 93 ms | 12872 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int mn, int mx, vector<int> w) {
int n = w.size();
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
a[i] = {w[i], i};
}
sort(a.begin(), a.end());
int64_t sum = 0;
set<int> s;
for (int l = 0, r = 0; r < n; r++) {
sum += a[r].first;
s.insert(a[r].second);
while (sum > mx) {
sum -= a[l].first;
s.erase(a[l++].second);
}
if (sum >= mn) {
vector<int> res;
for (auto x : s) {
res.push_back(x);
}
return res;
}
}
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... |