| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1359031 | c0det1ger | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 580 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> v(w.size());
int ss = 0;
for (int i = 0; i < w.size(); i++){
v[i].first = w[i];
v[i].second = i;
ss += w[i];
}
if (ss < l){
return {};
}
sort(v.begin(), v.end());
int ll = 0, rr = 0;
int sum = 0;
while (rr < w.size()){
if (sum < l){
sum += v[rr].first;
rr++;
}
while (sum > u){
sum -= v[ll].first;
ll++;
}
if (sum >= l && sum <= u){
vector<int> ans;
for (int i = ll; i < rr; i++){
ans.push_back(v[i].second);
}
return ans;
}
}
return {};
}
/*int main(){
vector<int> ans = find_subset(14, 15, {5, 5, 6, 6});
for (int x: ans){
cout << x << "\n";
}
}*/| # | 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... | ||||
