| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 88346 | amiratou | Detecting Molecules (IOI16_molecules) | C++14 | 3 ms | 692 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;
vector<int> ans;
void process(int j,int i){
for (int idx = j; idx <= i ; ++idx)
ans.push_back(idx);
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
for (int i = 1; i < w.size(); ++i)
w[i]+=w[i-1];
for (int i = 0; i < w.size(); ++i)
{
if(w[i]>=l&&w[i]<=u){
process(0,i);
return ans;
}
else if(w[i]>u){
auto search=lower_bound(w.begin(),w.begin()+i,w[i]-l);
if(search==w.begin()+i) continue;
if((w[i]-*search)>=l&&(w[i]-*search)<=u){
process((search-w.begin())+1,i);
return ans;
}
}
}
return vector<int>(0);
}
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... | ||||
