RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
USACO0353 파일 입출력

Guess the Animal

Silver III 실버 III
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

When bored of playing their usual shell game, Bessie the cow and her friend
Elsie like to play another common game called "guess the animal".

Initially, Bessie thinks of some animal (most of the time, this animal is a cow,
making the game rather boring, but occasionally Bessie is creative and thinks
of something else). Then Elsie proceeds to ask a series of questions to figure
out what animal Bessie has selected. Each question asks whether the animal has
some specific characteristic, and Bessie answers each question with "yes" or
"no". For example:

Elsie: "Does the animal fly?"
Bessie: "No"
Elsie: "Does the animal eat grass?"
Bessie: "Yes"
Elsie: "Does the animal make milk?"
Bessie: "Yes"
Elsie: "Does the animal go moo?"
Bessie: "Yes"
Elsie: "In that case I think the animal is a cow."
Bessie: "Correct!"

If we call the "feasible set" the set of all animals with characteristics
consistent with Elsie's questions so far, then Elsie keeps asking questions
until the feasible set contains only one animal, after which she announces this
animal as her answer. In each question, Elsie picks a characteristic of some
animal in the feasible set to ask about (even if this characteristic might not
help her narrow down the feasible set any further). She never asks about the
same characteristic twice.

Given all of the animals that Bessie and Elsie know as well as their
characteristics, please determine the maximum number of "yes" answers Elsie
could possibly receive before she knows the right animal.

Problem credits: Brian Dean

제약

Problem credits: Brian Dean

입력 형식

The first line of input contains the number of animals, \(N\)
(\(2 \leq N \leq 100\)). Each of the next \(N\) lines describes an animal. The
line starts with the animal name, then an integer \(K\) (\(1 \leq K \leq 100\)),
then \(K\) characteristics of that animal. Animal names and characteristics are
strings of up to 20 lowercase characters (a..z). No two animals have exactly
the same characteristics.

출력 형식

Please output the maximum number of "yes" answers Elsie could receive before the
game ends.

파일 입력 / 출력
이 문제는 표준 입출력을 사용하지 않습니다. 프로그램은 다음 파일을 읽고 써야 합니다:
입력을 읽을 파일 guess.in
출력을 쓸 파일 guess.out
예제 1
입력
4
bird 2 flies eatsworms
cow 4 eatsgrass isawesome makesmilk goesmoo
sheep 1 eatsgrass
goat 2 makesmilk eatsgrass
출력
3
설명

In this example, it is possible for Elsie to generate a transcript with 3 "yes"
answers (the one above), and it is not possible to generate a transcript with
more than 3 "yes" answers.

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2018-2019 > January > Bronze

태그

평가 및 의견

Guess the Animal

개요
출제자 난이도 Silver III 실버 III 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Guess the Animal

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8