| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1109063 | hainam2k9 | 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 <bits/stdc++.h>
#include <molecules.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
using namespace std;
const int MOD = 1e9+7, MAXN = 1e5+5;
const string NAME = "";
int find_subset(int l, int u, int w[], int n, int result[]){
pair<int,int> p[n];
for(int i = 0; i<n; ++i)
p[i].fi=w[i], p[i].se=i;
sort(p,p+n);
deque<int> dq;
int sum=0;
for(int i = 0; i<n; ++i){
sum+=p[i].fi, dq.pb(i);
if(sum<l){
int pos=lb(p+i+1,p+n,make_pair(l-sum,0))-p;
if(pos>=0&&pos<n&&sum+p[pos].fi<=u){
dq.pb(p[pos].se);
for(int i = 0; i<sz(dq); ++i)
result[i]=p[dq[i]].se;
return sz(dq);
}
}
while(sum>u) sum-=p[dq.front()].fi, dq.pof();
if(sum>=l&&sum<=u){
for(int i = 0; i<sz(dq); ++i)
result[i]=p[dq[i]].se;
return sz(dq);
}
}
return 0;
}
//int n,l,u,w[105],result[105];
//int main()
//{
// tt;
// if(fopen((NAME + ".INP").c_str(), "r")) fo;
// cin >> n >> l >> u;
// for(int i = 0; i<n; ++i)
// cin >> w[i];
// cout << find_subset(l,u,w,n,result);
//}