# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020455 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 49 ms | 7248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 2e5+12;
int w[maxn];
int p[maxn];
ll pref[maxn];
int n;
vector<int> find_subset(int L, int R, vector<int> W){
n = W.size();
for(int i=0;i<n;i++){
p[i] = i;
w[i] = W[i];
}
sort(p, p+n, [](int i, int j){
return w[i] < w[j];
});
sort(w, w+n);
for(int i=1;i<=n;i++){
pref[i] = pref[i-1] + w[i-1];
}
pref[n+1] = pref[n];
for(int i=n+1;i>=1;i--){
int pos = 0;
for(int l=0, r=i-1;l<=r;){
int mid = l + r >> 1;
if(pref[mid] + pref[n] - pref[i-1] >= L){
pos = mid;
r = mid-1;
}
else l = mid+1;
}
if(pref[pos] + pref[n] - pref[i-1] >= L && pref[pos] + pref[n] - pref[i-1] <= R){
vector<int> ans;
for(int i=0;i<pos;i++){
ans.push_back(p[i]);
}
for(int j=i;j<=n;j++){
ans.push_back(p[j-1]);
}
return ans;
}
}
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... |