| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366560 | yavor_ptv | Detecting Molecules (IOI16_molecules) | C++20 | 27 ms | 4124 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
//#include "grader.cpp"
using namespace std;
vector<int> find_subset(int L, int R, vector<int> w)
{
vector <pair<int,int>> v;
int n = w.size();
for (int i = 0; i < n; i++)
{
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
int l = 0, r = 0;
long long sum = v[0].first;
while (sum < L || sum > R)
{
if (sum < L)
{
if (r == n - 1) return {};
r++;
sum += v[r].first;
}
else
{
sum -= v[l].first;
l++;
if (l == n) return {};
}
}
vector<int> ans;
for (int i = l; i <= r; i++)
{
ans.push_back(v[i].second);
}
return ans;
}
/*
4 15 17
6 8 8 7
2
2 1
*/
| # | 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... | ||||
