# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798362 | Liudas | Detecting Molecules (IOI16_molecules) | C++17 | 49 ms | 7152 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>
using namespace std;
vector<int> find_subset(int L, int R, vector<int> M){
long long N = M.size();
vector<pair<long long, long long>> arr(N);
for(long long i = 0; i < N; i ++){
arr[i] = {M[i], i};
}
sort(arr.begin(), arr.end());
long long l = 0, r = 0, S = 0;
for(r; r < N; r ++){
if(S + arr[r].first <= R){
S += arr[r].first;
}
else{break;}
}
while(r < N && S < L){
S -= arr[l++].first;
S += arr[r++].first;
}
vector<int> p;
if(L <= S && S <= R){
for(long long i = l; i < r; i ++){
p.push_back(arr[i].second);
}
}
return p;
}
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... |