Submission #341199

#	Time	Username	Problem	Language	Result	Execution time	Memory
341199		YJU	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	65 ms	6240 KiB

molecules

#include<bits/stdc++.h>
#include"molecules.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long 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<int> find_subset(int l,int r,vector<int> 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,id=0,st;
	vector<int> ans;
	REP(i,SZ(lis)){
		st=i;
		while(id<SZ(lis)&&sum<l)sum+=w[lis[id++]];
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
		sum-=w[lis[i]];
		st=i+1;
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
	}
	return vector<int>(0);
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31