| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1002116 | rahidilbayramli | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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 "molecules.h"
#include<bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
vi find_subset(ll l, ll u, vi w) {
ll f = min(l, u);
ll g = max(l, u);
l = f, u = g;
vl ans;
vector<pair<ll, int>>vect;
ll n = w.size(), i;
vect.pb({0, 0});
for(ll i = 0; i < n; i++)
vect.pb({w[i] * 1LL, i});
sort(all(vect));
long long pref[n+5];
pref[0] = 0LL;
for(i = 1; i <= n; i++)
pref[i] = pref[i-1] * 1LL + vect[i].f * 1LL;
//for(i = 1; i <= n; i++)
//cout << pref[i]<< "\n";
for(i = 1; i <= n; i++)
{
ll lo = i, hi = n;
//cout << "i: " << i << "\n";
while(lo <= hi)
{
ll mid = (lo + hi) / 2;
ll sum = pref[mid] * 1LL - pref[i-1] * 1LL;
//cout << "mid: " << mid << " sum: " << sum << "\n";
if(sum > u)
hi = mid - 1;
else if(sum < l)
lo = mid + 1;
else if(l <= sum && sum <= u)
{
for(ll j = i; j <= mid; j++)
ans.pb(vect[j].s);
return ans;
}
}
}
return ans;
}