# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233754 | jam_xd_ | Detecting Molecules (IOI16_molecules) | C++17 | 5 ms | 256 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> find_subset(int l, int u, vector<int> w) {
vector<int>resp;
vector<int> nada;
bool si,nel;
int funcionaaaaa = w.size();
int sum =0 ;
for(int i=0;i<funcionaaaaa;i++){
sum = sum + w[i];
resp.push_back(i+1);
if(sum >= min(u,l) and sum <= max(u,l)){
si = true;
break;
}
if(sum > max(u,l)){
nel = true;
break;
}
}
if(si == true)return resp;
else return nada;
}
//:v ??
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... |