제출 #954745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954745		Angus_Yeung	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	42 ms	9664 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
	ll n = w.size(), ptr = 0;
	vector<pair<ll, ll>> a;
	vector<int> ans;
	a.push_back({0, 0});
	for (int i = 0; i < n; i++) a.push_back({w[i], i});
	sort(a.begin(), a.end());
	for (int i = 1; i <= n; i++) a[i].first += a[i-1].first;
	for (int i = 1; i <= n; i++) {
		while (ptr < n && a[ptr].first-a[i-1].first < l) ptr++;
		if (l <= a[ptr].first-a[i-1].first && a[ptr].first-a[i-1].first <= u) {
			for (int j = i; j <= ptr; j++) ans.push_back(a[j].second);
			return ans;
		}
	}
	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