제출 #233773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
233773		jam_xd_	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	4 ms	256 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;
nada.clear();
if(l == 0 and u == 0 and w[0] != 0)return nada;

for(int i=0;i<funcionaaa;i++){
	
	if(sum > max(l,u)){
		break;
	}
	sum = sum + gg;
	covid.push_back(i+1);

	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