# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1130543 | NAMIN | Detecting Molecules (IOI16_molecules) | C++20 | 44 ms | 3656 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define ll long long
vector<int> find_subset(int lo, int hi, vector<int> w) {
int n = w.size();
vector<pair<int,int>> a(w.size());
for(int i=0;i<n;i++){
a[i].first = w[i];
a[i].second = i;
}
sort(a.begin(),a.end());
ll sum = 0;
for(int l=0,r=0;r<n;r++){
sum += a[r].first;
while(sum > hi && l <= r){
sum -= a[l].first;
l++;
}
if(sum <= hi && sum >= lo){
vector<int> ans;
for(int j=l;j<=r;j++){
ans.push_back(a[j].second);
}
return ans;
}
}
return vector<int>{};
}
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... |