제출 #313854

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

molecules

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

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int n = w.size();
	std::vector <std::pair <int , int> > subset;
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < n; j++ ) {
			subset.push_back(std::make_pair (i , j));
		}
	}	
	std::vector <int> ans;
	for (int i = 0;i < subset.size(); i++) {
		int sum = 0;
		for (int j = std::min (subset[i].first , subset[i].second) ;j < std::max(subset[i].second,subset[i].first); j++) {
			sum += w[j];
		}
		ans.clear();
		if (sum >= l && sum <= u) {
			for (int k = subset[i].first;k < subset[i].second;k++) {
				ans.push_back(k);
			}
			return ans;
		} 
	}
	return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:16:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for (int i = 0;i < subset.size(); 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