| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299587 | alexiah | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 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;
}
vector<int> ans , fin;
int count = 0;
int ini = 0;
for(int i = 0; i < n; i++){
if(count + w[i] <= u){
count += w[i];
ans.push_back(v[i].second);
}
else{
if(count < l){
count -= w[ini]; ans[ini] = -1; ini++;
}
}
}
for(auto x : ans){
if(x != -1) fin.push_back(x);
}
if(count < l || count > u) return vector<int>();
else return fin;
}
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... | ||||
