제출 #338904

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

molecules

#include "bits/stdc++.h"
#include "molecules.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>pub;
bool cmp(int x,int y){
	return (pub[x]<pub[y]);	
}
vector<int> find_subset(int l, int u, vector<int> w) {
	int n=int(w.size());pub=w;
	vector<int>ind,ans;
	for(int i=0;i<n;i++)
		ind.pb(i);
	sort(all(ind),cmp);
	int sum=0,p=0;
	for(int i=0;i<n;i++){
		while(p<n and sum+w[ind[p]]<=u)
			sum+=w[ind[p++]];
		if(sum>=l){
			for(int j=i;j<p;j++)
				ans.pb(ind[j]);
			return ans;
		}sum-=w[ind[i]];
	}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: 0 / 31