제출 #647516

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647516		jamezzz	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	57 ms	8828 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(x) x.begin(),x.end()
typedef long long ll;
typedef pair<int,int> ii;
#define maxn 200005

vector<ii> v;
ll pfx[maxn],sfx[maxn];

vector<int> find_subset(int l,int u,vector<int> w){
    int n=w.size();
    for(int i=0;i<n;++i){
		v.push_back({w[i],i});
	}
	sort(all(v));
	for(int i=0;i<n;++i){
		if(i!=0)pfx[i]=pfx[i-1];
		pfx[i]+=v[i].fi;
	}
	for(int i=n-1;i>=0;--i){
		sfx[i]=sfx[i+1]+v[i].fi;
	}
	for(int i=1;i<=n;++i){
		if(pfx[i-1]<l&&sfx[n-i]<l)continue;
		if(pfx[i-1]>u)return vector<int>(0);
		for(int s=0;s+i-1<n;++s){
			ll cur=pfx[s+i-1];
			if(s!=0)cur-=pfx[s-1];
			if(l<=cur&&cur<=u){
				vector<int> ans;
				for(int j=s;j<s+i;++j){
					ans.push_back(v[j].se);
				}
				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