제출 #172237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172237		yum	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	2 ms	376 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = (int)w.size();
	vector<int> arr(n);
	iota(arr.begin(), arr.end(), 0);
	sort(arr.begin(), arr.end(), [&](int i, int j) {return w[i] < w[j];});
	ll p1 = 0, sum = 0; 
	for (int i = 0; i < n; ++i) {
		while (p1 < n && sum < l) sum += w[arr[p1++]];
		if (l <= sum && sum <= u) {
			vector<int> ans;
			for (int j = i; j < p1; ++j) ans.push_back(arr[i]);
			sort(ans.begin(), ans.end());
			return ans;
		}
	}
	return vector<int>();
}

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