# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1187768 | dirtycodehehe | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 3656 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
vector<int> find_subset(int k, int u, 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());
ll sum = 0;
vector<int> res;
for (int r = 0,l=0; r < n; r++) {
sum += a[r].first;
while(sum>u){
sum-=a[l].first;
l++;
}
if(sum>=k&&sum<=u){
for(int i=l;i<=r;++i){
res.push_back(a[i].second);
}
return res;
}
}
return {};
}
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... |