제출 #1026055

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

molecules

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

using namespace std;

#define int long long
#define vec vector

std::vector<int32_t> find_subset(int32_t l, int32_t u, std::vector<int32_t> w) {
	int n = w.size();

	vec<int> wi(n);
	iota(wi.begin(), wi.end(), 0);
	sort(wi.begin(), wi.end(), [&](int i, int j) { return w[i] < w[j]; });
	sort(w.begin(), w.end());
	int k = 0;
	int sum = 0;
	while(k < w.size() && sum + w[k] <= u) {
		sum += w[k];
		k++;
	}

	int j = 0;
	while(j+k < n && sum < l) {
		sum += w[j+k];
		sum -= w[j];
		j++;
	}

	if(sum < l) return {};

	vec<int32_t> ans(0);
	for(int i = j; i < j+k; i++) {
		ans.push_back(wi[i]);
	}

    return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int32_t, int32_t, std::vector<int>)':
molecules.cpp:18:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  while(k < w.size() && sum + w[k] <= u) {
      |        ~~^~~~~~~~~~

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