# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020452 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 600 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;
ll pref[maxn];
int n;
vector<int> find_subset(int L, int R, vector<int> w){
n = w.size();
sort(w.begin(), w.end());
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(i);
}
for(int j=i;j<=n;j++){
ans.push_back(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... |