# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200329 | apelpisia | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
// #define ll long long int
#define f first
#define s second
using namespace std;
vector<int> find_subset(int l, int r, vector<int> w) {
int n = w.size();
vector<pair<int,int>> arr;
for (int i = 0 ; i < n ; i++) {
arr.push_back({w[i], i});
}
sort(arr.begin(), arr.end());
int ll = 0;
long long int sum = 0;
vector<int> ans;
for (int i = 0 ; i < n ; i++) {
if (sum + arr[i].first > l) {
sum -= arr[ll++].first;
}
sum += arr[i].first;
if (l <= sum && sum <= r) {
for (int j = ll ; j <= i ; j++) {
ans.push_back(arr[j].second);
}
break;
}
}
return ans;
}
Compilation message (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... |