| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 996750 | stdfloat | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 400 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"
#include "molecules.h"
using namespace std;
using ll = long long;
vector<int> find_subset(int L, int R, vector<int> w) {
int n = (int)w.size();
ll sm = 0;
int l = 0;
for (int i = 0; i < n; i++) {
sm += w[i];
while (sm > R) sm -= w[l++];
if (L <= sm) {
vector<int> v;
while (l <= i) v.push_back(l++);
return v;
}
}
return {};
}| # | 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... | ||||
