Submission #156643

#	Time	Username	Problem	Language	Result	Execution time	Memory
156643		a_player	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	65 ms	8364 KiB

molecules

#include <bits/stdc++.h>

#define f first
#define s second
#define mp make_pair
#define pb push_back

using namespace std;

typedef long long ll;
pair<ll,int> p[200001];
ll pr[200001];
ll su[200001];
vector<int> find_subset(int l,int u,vector<int> w){
	
	int N=w.size();
	for(int i=0;i<N;i++){
		p[i].f=(ll)w[i];
		p[i].s=i;
		}
		sort(p,p+N);
		vector<int> sol;
		int j=N;
		ll s=0;
		ll s1=0;
		for(int i=0;i<N;i++){
			s+=p[i].f;
			s1+=p[N-i-1].f;
			pr[i]=s;
			su[N-i-1]=s1;
			if(s1>(ll)u&&j==N)j=N-i;
			}
		if(su[j]>=(ll)l&&su[j]<=(ll)u){
			for(int i=N-1;i>=j;i--)sol.push_back(p[i].s);
			return sol;
			}
		for(int i=0;i<N;i++){
			for(;j<N&&su[j]+pr[i]>(ll)u;j++){}
			if(pr[i]+su[j]>=(ll)l&&su[j]+pr[i]<=(ll)u){
				for(int k=N-1;k>=j;k--)sol.push_back(p[k].s);
				for(int k=0;k<=i;k++)sol.push_back(p[k].s);
			    return sol;
				}
			}
	return sol;
	}

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