| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299605 | alexiah | Detecting Molecules (IOI16_molecules) | C++20 | 32 ms | 3496 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int , int>> v(n);
for(int i = 0; i < n; i++){
v[i].first = w[i]; v[i].second = i;
}
sort(v.begin() , v.end());
vector<int> ans;
int count = v[0].first;
int ini = 0 , fin = 0;
while(true){
if(ini > fin){
fin++; count += v[fin].first;
}
if(count >= l && count <= u){
for(; ini <= fin; ini++) ans.push_back(v[ini].second);
return ans;
}
if(count > u){
count -= v[ini].first; ini++;
}
if(count < l){
fin++;
if(fin >= n){
return vector<int> ();
}
count += v[fin].first;
}
if(count >= l && count <= u){
for(; ini <= fin; ini++) ans.push_back(v[ini].second);
return ans;
}
}
return vector<int>();
}
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... | ||||
