Submission #199268

#	Time	Username	Problem	Language	Result	Execution time	Memory
199268		monus1042	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	5 ms	504 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<int> ans;
	int ss=w.size();
	
	int same=w[0], cnt1=1, cnt2=0, secel;
	unordered_set<int> posfir, possec;
	posfir.insert(0);
	bool oksame=true;
	for (int i=1; i<ss; i++){
		if (w[i]!=same) {oksame=false; cnt2++; secel=w[i]; possec.insert(i);}
		else {cnt1++; posfir.insert(i);}
	}
	if (!oksame){
		if (secel>=l and secel<=u) ans.push_back(*possec.begin());
		else if (same>=l and same<=u) ans.push_back(*posfir.begin());
		else{
			bool done=false;
			for (int i=1; i<=cnt1; i++){
				for (int j=1; j<=cnt2; j++){
					if (secel*j + same*i>=l and secel*j + same*i<=u){
						auto fi=posfir.begin(), se=possec.begin();
						for (int k=0; k<i; k++, fi++) ans.push_back(*fi);
						for (int k=0; k<j; k++, se++) ans.push_back(*se);
						done=true;
						break;
					}
				}
				if (done) break;
			}
		}
	}else{
		for (int i=1; i<=ss; i++){
			if (same*i>=l and same*i<=u){
				for (int j=0; j<i; j++) ans.push_back(j);
				break;
			}
		}
	}
    return ans;
}

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