This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma once
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w){
vector<pii> v;
int n = w.size();
for (int i = 0; i < n; i++){
v.pb({w[i], i});
}
sort(v.begin(), v.end());
ll sum = 0, it = n - 1;
vector<int> ans, vis(n, 0);
while(sum <= u && it >= 0){
sum += v[it].st;
vis[it] = 1;
if (sum <= u && sum >= l){
for (int i = 0; i < n; i++){
if (vis[i]) ans.pb(v[i].nd + 1);
}
return ans;
}
it--;
}
return ans;
//cout<<sum<<endl;
int i = 0, j = n - 1;
while(sum > u && i <= it && j > it){
vis[j] = 0, vis[i] = 1;
sum += v[i].st - v[j].st;
i++, j--;
//cout<<sum<<endl;
}
if (sum <= u && sum >= l){
for (int i = 0; i < n; i++){
if (vis[i]) ans.pb(v[i].nd + 1);
}
}
return ans;
}
Compilation message (stderr)
molecules.cpp: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... |