아직 만들고 있는 페이지입니다.

이 페이지는 아직 만드는 중입니다. 보이는 내용은 바뀔 수 있습니다.

Toxic Gene

시간 제한1초메모리 제한1024 MB

요약
한 번에 300마리까지, 최대 600번 질의할 수 있는 기계로 생존자 수만 보고 n종의 박테리아를 보통, 강함, 독성으로 분류한다.
난이도

보통10점 중 7점

유형
이분 탐색, 수학, 조합론, 구현
정답자
아직 제출이 없습니다

문제

Benson the Rabbit’s plane has been overwhelmed by toxic bacteria, and he has to investigate it!

Benson the Rabbit has nn species of bacteria. Each of them falls into exactly one of 33 types: Regular, Strong, Toxic. tt of them are Toxic. It is guaranteed that there is at least 11 Toxic bacteria, i.e.t≥1 t ≥ 1. Note that Benson does not know the value of tt.

Benson wants to identify the type of each bacteria. To analyze the bacteria, he can place bacteria specimens into a machine. He can specify the species of each bacteria, and he can add any number of each species into the machine, including 00. This forms a single sample. Due to size constraints, the total number of bacteria in a sample cannot exceed 300300.

Each of the 33 types of bacteria have the following properties:

  • Regular bacteria will survive if there are no Toxic bacteria in the sample, and will die if there is at least one Toxic bacteria in the sample.
  • Strong bacteria will always survive.
  • Toxic bacteria produce a toxin which kills all bacteria in the sample that are not Strong bacteria. Toxic bacteria will always die.

After a sample is selected, the machine will tell Benson how many bacteria survived in total. Each use of the machine takes time, and Benson does not have a lot of time. He may only use the machine up to 600600 times. Help Benson determine for each bacteria, whether it is Regular, Strong or Toxic in as few samples as possible.

예제

이 문제는 공개된 예제가 없습니다.