| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370613 | n.bahizi_dylan | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define pb push_back
typedef long long ll;
v<int> find_subset(int l , int u, v<int> we) {
int n = we.size();
for(int i = 0; i < n; i++) {
ll su = 0;
for(int j = i; j < n; j++) {
su += we[j];
if(su <= u && su >= l) {
return{i, j};
}
}
}
return {};
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
