# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872498 | Zero | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 348 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>
#define ll long long
// #include "molecules.h"
#define pb push_back
using namespace std;
vector<int> find_subset(int l, int u, vector<int> a){
ll n = a.size();
vector<int> v;
ll s = 0;
bool jj = true;
for(ll i=0,j=0; i < n && j < n;){
if(s>=l && s <= u){
j--;
if(i == j) v.pb(i);
else v.pb(i),v.pb(j);
break;
}
if(s < l) s += a[j],j++;
else if(s>u) s-=a[i], i ++;
}
return 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... |