Submission #1072280

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072280		LCJLY	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	39 ms	5720 KiB

molecules

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

#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef array<int,4>pi2;

vector<int>find_subset(int l, int u, vector<int>w){
	int n=w.size();
	long long counter=0;
	int ptr=-1;
	pii arr[n];
	for(int x=0;x<n;x++) arr[x]={w[x],x};
	sort(arr,arr+n);
	for(int x=0;x<n;x++){
		if(counter+arr[x].first>u) break;
		counter+=arr[x].first;
		ptr=x;
	}
	//show(counter,counter);
	vector<int>ans;
	if(counter>=l){
		for(int y=0;y<=ptr;y++) ans.push_back(arr[y].second);
		return ans;
	}
	int cur=n-1;
	for(int x=ptr;x>=0;x--){
		counter+=arr[cur].first;
		counter-=arr[x].first;
		//cur--;
		//show2(x,x,counter,counter);
		if(counter>=l&&counter<=u){
			for(int y=0;y<x;y++){
				ans.push_back(arr[y].second);
			}
			for(int y=n-1;y>=cur;y--){
				ans.push_back(arr[y].second);
			}
			return ans;
		}	
		cur--;
	}
	return ans;
}

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