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