| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1337449 | hyyh | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB |
#include "molecules.h"
#include <vector>
#include <deque>
#include <iostream>
using namespace std;
using pii = pair<int,int>;
#define endl '\n'
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int p1 = 0;
int p2 = 0;
int sum = 0;
while(p2 < w.size()){
sum += w[p2];
while(sum > u) sum -= w[p1],p1++;
if(sum >= l){
vector<int> ans;
for(int i{p1};i <= p2;i++){
ans.emplace_back(i);
}
return ans;
}
p2++;
}
return std::vector<int>(0);
}
| # | 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... | ||||
