| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1286187 | harryleee | Detecting Molecules (IOI16_molecules) | C++20 | 39 ms | 3756 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int r, vector<int> v){
int n = v.size();
vector<pair<int, int>> a (n);
for (int i = 0; i < n; ++i){
a[i] = {v[i], i};
}
sort(a.begin(), a.begin() + n);
long long sum = 0;
vector<int> res;
for (int i = 0, j = 0; i < n; ++i){
sum += a[i].first;
while(j <= i && sum > r)
sum -= a[j++].first;
if (sum >= l){
for (; j <= i; ++j)
res.push_back(a[j].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... | ||||
