| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365405 | temurbek1371 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 344 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int lf = 0,rt = 0;
int cs = w[0];
sort(w.begin(),w.end());
int n = w.size();
while(lf<n){
while(rt<n && w[rt+1]+cs<=u){
cs+=w[++rt];
}
if(cs>=l && cs<=u){
vi ans;
for(int i = lf;i<=rt;i++)ans.push_back(i);
return ans;
}
cs-=w[lf++];
}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... | ||||
