제출 #299367

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define PB push_back
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int>respuesta;
	//sort(w.begin(), w.end());
	long long sum=0, n=w.size();
	long long menor=w[0], mayor=w[n-1], nn=0, mm=0;
	set<int>menores, mayores;
	for(int i = 0 ; i < n ; i ++){
		if(w[i]==menor)nn++;
		else mm++;
		if(w[i]==menor)menores.insert(i);
		else mayores.insert(i);
	}
	//cout<<menor<<" "<<mayor;
	for(int i = 0 ; i <= nn ; i ++){
		for(int j = 0 ; j <= mm ; j++){
			if(i*menor+j*mayor>=l&&i*menor+j*mayor<=u){
				long long cont=0;
				for(auto x:menores){
					if(cont==nn)break;
					cont++;
					respuesta.push_back(x);
					//if(cont==nn)break;
				}
				cont=0;
				for(auto x:mayores){
					if(cont==mm)break;
					cont++;
					respuesta.push_back(x);

				}
				return respuesta;
			}
		}
	}
	return respuesta;
    //return std::vector<int>respuesta;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:12: warning: unused variable 'sum' [-Wunused-variable]
    8 |  long long sum=0, n=w.size();
      |            ^~~

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