제출 #233794

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

molecules

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

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {

int gg = w[0], funcionaaa = w.size(), sum = 0;
bool afirmo;

vector<int>covid;
vector<int>nada;

if(l == u and  w[0]!= l)return nada;
else{
	int guardar = 1;
	for(int i=1; i<=funcionaaa;i++){

		if(gg * funcionaaa < min(l,u) or sum > max(l,u)){
			break;
		}
		sum = sum + gg;
		covid.push_back(guardar);
		guardar++;
		if(sum >= min(l,u) and sum <= max(l,u)){
			afirmo = true;
			break;
		}
	}
	if(afirmo == true)return covid;
	else return nada;
}


}
//:v  ??

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