| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312417 | coderg | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h"
#include "molecules.h"
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
void setIO(string name = ""){if(name.size()){ freopen((name + ".in").c_str(), "r", stdin);freopen((name + ".out").c_str(), "w", stdout);}}
#define F(i,l,r) for(int i=(l);i<(r);++i)
#define FR(i,l,r) for(int i=(l);i>=(r);--i)
typedef long long ll;
const int maxn=1000005;
const int mod=1e9+7;
const int mox=2000*500+505;
const int inf=1e9;
vector<int> find_subset(int l,int u,vector<int> w){
int n=w.size();
vector<pii> molecules(n);
F(i,0,n)molecules[i]=mp(w[i],i);
sort(molecules.begin(),molecules.end());
ll cursum=0,left=0,right=0;
while(right<n){
cursum+=molecules[right].fi;
while(cursum>u && left<=right){
cursum-=molecules[left].fi;
left++;
}
if(cursum>=l && cursum<=u){
vector<int> res(k);
F(i,left,right+1)res.pb(molecules[i].se);
return res;
}
right++;
}
return {};
}
