# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
739015 | ThylOne | Detecting Molecules (IOI16_molecules) | C++14 | 1079 ms | 304 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> prefixSum;
prefixSum.push_back(0);
for(int i=0;i<w.size();i++){
prefixSum.push_back(prefixSum[i]+w[i]);
}
vector<int> R;
for(int I=0;I<w.size();I++){
if(w[I]>=l && w[I]<=u){return {I};}
int left = 0;
int right = I;
int score = prefixSum[right+1]-prefixSum[left];
while(!(score>=l && score<=u) && left<right){
int mid = (left+right)/2;
score = prefixSum[I+1]-prefixSum[mid];
if(score>u){
left = mid;
}else if(score<l){
right=mid-1;
}else{
}
}
if(score>=l && score<=u){
return {left,I};
}
}
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... |