Submission #997103

#	Time	Username	Problem	Language	Result	Execution time	Memory
997103		codefox	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	348 KiB

molecules

#include<bits/stdc++.h>

using namespace std;

#define pii pair<int, int>

vector<int> find_subset(int l, int u, vector<int> w)
{
	vector<pii> nums;
	for (int i = 0; i < w.size(); i++) nums.push_back({w[i], i});
	sort(nums.begin(), nums.end());
	int left=0, right=0;
	long long sum = 0;
	while (sum < l)
	{
		sum += nums[right].first;
		right++;
	}
	right--;	
	sum -= nums[right].first;
	while (sum <= u)
	{
		sum += nums[right].first;
		right++;
		sum -= nums[left].first;
		left++;
	}
	right--;
	sum -= nums[right].first;
	left--;
	sum += nums[left].first;

	if (sum >= l)
	{
		vector<int> ans(right-left);
		for (int i = left; i < right; i++)
		{
			ans[i-left] = nums[i].second;
		}
		return ans;
	}
	else 
	{
		vector<int> ans(0);
		return ans;
	}
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int i = 0; i < w.size(); i++) nums.push_back({w[i], i});
      |                  ~~^~~~~~~~~~

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