제출 #961218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961218		raspy	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	39 ms	6348 KiB

molecules

#include "molecules.h"
#include <iostream>
#include <algorithm>

using namespace std;
typedef long long ll;

vector<int> find_subset(int l, int u, vector<int> ww)
{
	vector<pair<int, int>> w;
	int ix = 0;
	for (auto v : ww)
		w.push_back({v, ix++});
	sort(w.begin(), w.end());
	ll lf = 0, rg = 0;
	ll trs = 0;
	while (rg <= w.size() && (lf < rg || rg == 0))
	{
		// cout << lf << " " << rg << " " << trs << "\n";
		if (trs > (ll)u)
		{
			trs -= w[lf].first;
			lf++;
		}
		else if (trs < (ll)l)
		{
			trs += w[rg].first;
			rg++;
		}
		else
		{
			vector<int> rez;
			for (int i = lf; i < rg; i++)
				rez.push_back(w[i].second);
			return rez;
		}
	}
	return vector<int>(0);
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:17:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  while (rg <= w.size() && (lf < rg || rg == 0))
      |         ~~~^~~~~~~~~~~

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