J3. Special Event
레이팅 미적용의견: 0
You are trying to schedule a special event on one of five possible
days.
Your job is to determine on which day you should schedule the event,
so that the largest number of interested people are able to attend.
The first line of input will contain a positive integer \(N\), representing the number of people
interested in attending your event. The next \(N\) lines will each contain one person’s
availability using one character for each of Day 1, Day 2, Day 3, Day 4,
and Day 5 (in that order). The character Y means the person
is able to attend and a period (.) means the person is not
able to attend.
The output will consist of one line listing the day number(s) on
which the largest number of interested people are able to attend.
If there is more than one day on which the largest number of people
are able to attend, output all of these day numbers in increasing order
and separated by commas (without spaces).
| 서브태스크 | 점수 | 설명 |
|---|---|---|
1 | 40점 | There will be exactly one day on which every person will be able to attend. |
2 | 40점 | There will be exactly one day on which the largest number of people will be able to attend. |
3 | 20점 | There might be more than one day on which the largest number of people will be able to attend. |
3
YY.Y.
...Y.
.YYY.4All three people are able to attend on Day 4, and they are not all
available on any other day.
5
YY..Y
.YY.Y
.Y.Y.
.YY.Y
Y...Y2,5There is no day on which all five people are able to attend. Four
people are able to attend on both Day 2 and Day 5.
평가 및 의견
J3. Special Event
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
J3. Special Event