#include "molecules.h"
#include<vector>
#include<iostream>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<ll, int>> vec;
int n = (int)w.size();
vec.emplace_back(0, -1);
for(int i = 0; i < n; i++) vec.emplace_back(w[i], i);
sort(vec.begin(), vec.end());
vector<ll> pre(n + 1);
for(int i = 1; i <= n; i++) pre[i] = pre[i - 1] + vec[i].first;
for(int i = 1; i <= n; i++){
int posr = upper_bound(pre.begin(), pre.end(), pre[i] - l) - pre.begin() - 1;
int posl = lower_bound(pre.begin(), pre.end(), pre[i] - u) - pre.begin();
if(posl <= posr){
vector<int> ans;
for(int j = posl + 1; j <= i; j++) ans.push_back(vec[j].second);
return ans;
}
}
return vector<int>();
}
// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run molecules.cpp grader.cpp
Compilation message (stderr)
molecules.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
# | 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... |