# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1068365 | andrei_iorgulescu | Detecting Molecules (IOI16_molecules) | C++14 | 46 ms | 7364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
#warning That's not FB, that's my FB
using namespace std;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<pair<int,int>> v;
for (int i = 0; i < w.size(); i++)
v.push_back({w[i],i});
v.push_back({0,0});
sort(v.begin(),v.end());
int n = v.size() - 1;
vector<ll> sp(n + 1);
for (int i = 1; i <= n; i++)
sp[i] = sp[i - 1] + v[i].first;
for (int i = 1; i <= n; i++)
{
if (sp[i] > u or sp[n] - sp[n - i] < l)
continue;
for (int st = 1; st <= n - i + 1; st++)
{
if (sp[st + i - 1] - sp[st - 1] >= l and sp[st + i - 1] - sp[st - 1] <= u)
{
vector<int> ans;
for (int j = st; j < st + i; j++)
ans.push_back(v[j].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... |