Submission #54888

#	Time	Username	Problem	Language	Result	Execution time	Memory
54888		WA_TLE	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	85 ms	32856 KiB

molecules

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase

/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int i,j,k,n=w.size();
	vector<pair<llint,int>>ww(n);
	for(i=0;i<n;i++){ww[i]=mp(w[i],i);}
	SO(ww);
	llint ka=0,om=0;
	bool can=false;
	for(i=0;i<n;i++){
		ka+=ww[i].fir;
		om+=ww[n-i-1].fir;
		if(l<=om){can=true;i++;break;}
	}
	if(!can||u<ka){return vector<int>();}
	//i個おく
	//j個重い
	llint gen=0;
	for(j=0;j<i;j++){gen+=ww[j].fir;}
	for(j=0;j<=i;j++){
		if(u<gen){return vector<int>();}//おもすぎ
		if(l<=gen){
			vector<int>ans;
			for(k=0;k<i-j;k++){ans.pub(ww[k].sec);}
			for(k=n-j;k<n;k++){ans.pub(ww[k].sec);}
			SO(ans);
			return ans;
		}
		gen-=ww[i-j-1].fir;
		gen+=ww[n-j-1].fir;
		if(j==i){break;}
	}
	return vector<int>();
}

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