제출 #394337

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394337		EncryptingWolf	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	288 KiB

molecules

using namespace std;
typedef long long ll;
#include <vector>
vector<int> find_subset(int l, int u, vector<int> w)
{

	ll left = 0;
	ll right = 0;
	ll n = w.size();
	auto result = vector<int>(w.size(), 0);
	for (int i = 0; i < n; i++)
	{
		left += result[0];
		right += result[n - i - 1];

		if (l <= left && left <= u)
		{
			for (int j = 0; j <= i; j++)
			{
				result[j] = w[j];
			}
			result.resize(i + 1);
			return result;
		}
		else if (l <= right && right <= u)
		{
			for (int j = 0; j <= i; j++)
			{
				result[n-j-1] = w[n-j-1];
			}
			result.resize(i + 1);
			return result;
		}
		else if (l > left && u < right)
		{
			long double avg = ((long double) l + u) / 2;
			ll li = 1;
			ll ri = n - 1;
			ll total = w[0];
			for (int j = 0; j < i; j++)
			{
				if ((long double)total / (j + 1) > avg)
				{

					total += w[li];
					result[j] = w[li];
					li++;
				}
				else
				{
					result[j] = w[ri];
					total += w[ri];
					ri--;
				}
			}
			result.resize(i + 1);
			return result;
		}
	}
	return vector<int>(0);
}

/*int main()
{

	return 0;
}*/

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