# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069051 | quangminh412 | Detecting Molecules (IOI16_molecules) | C++14 | 1028 ms | 348 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>
using namespace std;
/*
John Watson
https://codeforces.com/profile/quangminh98
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
vector<int> solve(int l, int u, vector<pair<ll, int>>& p, vector<ll>& pre, int k)
{
for (int i = k - 1; i < pre.size(); i++)
{
ll sum = pre[i] - (i - k < 0 ? 0 : pre[i - k]);
if (l <= sum && sum <= u)
{
vector<int> ans;
for (int j = i - k + 1; j <= i; j++)
ans.push_back(p[j].second);
return ans;
}
}
return {};
}
vector<int> find_subset(int l, int u, vector<int> w)
{
int n = w.size();
vector<pair<ll, int>> p;
for (int i = 0; i < n; i++)
p.push_back(make_pair(w[i], i));
sort(p.begin(), p.end());
vector<ll> pre(n);
for (int i = 0; i < n; i++)
pre[i] = (i == 0 ? 0 : pre[i - 1]) + p[i].first;
int i = 1, j = n;
while (i != j)
{
int mid = i + j >> 1;
vector<int> tmp = solve(l, u, p, pre, mid);
if (tmp.empty())
i = j + 1;
else
return tmp;
}
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... |