제출 #252618

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

molecules

#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<pair<int,int>> v(n);
	for (int i = 0; i < n; i++) v[i] = {w[i],i};
	sort(v.begin(),v.end());
	int low = v[0].first;
	for (pair<int,int> &p : v) p.first -= low;
	long long sumHigh = 0, sumLow = 0;
	for (int sz = 1; sz <= n; sz++) { //sum + low * sz >= l ?
		sumHigh += v[n-sz].first; sumLow += v[sz-1].first;
		if (sumHigh + low * sz >= l && sumLow + low * sz <= u) { //found an answer
			long long cur = sumLow + low * sz;
			for (int st = 0; st < n; st++) {
				if (st) cur -= v[st-1].first, cur += v[st+sz-1].first;
				if (l <= cur && cur <= u) {
					vector<int> ret;
					for (int j = st; j < st + sz; j++) ret.push_back(v[j].second);
					return ret;
				}
			}
		}
	}
	return {};
}

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