| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 341155 | YJU | Detecting Molecules (IOI16_molecules) | C++14 | 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"moleclues.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e3+7;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
vector<ll> find_subset(ll l,ll r,vector<ll> w){
vector<ll> lis;
REP(i,SZ(w))lis.pb(i);
sort(lis.begin(),lis.end(),[](ll a,ll b){
return (w[a]<w[b]);
});
ll sum=0;
vector<ll> ans;
REP(i,SZ(lis)){
sum+=w[lis[i]];
ans.pb(lis[i]);
if(sum>=l&&sum<=r){
return ans;
}else if(sum>r){
sum-=w[ans[0]];
ans.erase(ans.begin(),next(ans.begin()));
return ans;
}
}
return 0;
}