페이지가 로드되지 않나요? 여기를 눌러보면 고쳐질 수도 있어요.
Placeholder

#7072
서브태스크
다국어

Bingo 1초 1024MB

문제

It’s time to play Bingo!

To play Bingo, you need a game master and a drum with 90 balls, each containing a number from 1 to 90, sucha that every number appears on exactly one ball.

Before the game starts, the game master gives each of the n players a board of size 5 \times 5. Each field of the board contains an integer between 1 and 90, where all the integers on the board are distinct. Each player gets a unique board.

After the players receive their boards, the game can begin.

The game master starts drawing balls from the drum. After drawing a ball with the number x_i, he announces that number and puts the ball aside. The players then check their boards and, if they have the drawn number, they mark it.

When a player marks all the 5 numbers in a row, column, main diagonal or antidiagonal, he has a Bingo! and shouts it out. The game ends and that player wins.

To make the game more interesting, the game master has decided to introduce an additional rule. Namely, the game master will draw m balls from the drum before anyone is allowed to shout Bingo! (even if he has already marked all the numbers in a row, column, or diagonal).

But, as soon as the game master drew m balls, there was a commotion: all the players shouted Bingo! at the same time.

The game master is confused and doesn’t know who to trust. To resolve this situation, he asked you for help. Determine which players had a Bingo! after drawing m balls, i.e. which players had all the numbers marked in at least one row, column, or diagonal.


입력

The first line contains the integer n (1 ≤ n ≤ 50), the number of players.

Then, n times six lines follows:

  • The first of these lines contains a string of at most 20 lowercase English letters, the name of the player. No two players have the same name.

  • Then five lines follow with five integers between 1 and 90, which describe the player’s board. All the integers on the board are distinct.

The next line contains the integer m (1 ≤ m ≤ 90), the number of balls the game master drew before the players shouted Bingo!.

The next line contains a sequence of m integers between 1 and 90, the numbers the game master drew from the drum. Each number is drawn at most once.


출력

In the first line, output k, the number of players that had a Bingo! after drawing m balls.

In the next k lines, output the names of the players that had a Bingo! after drawing m balls. The names should be output in the same order as they appear in the input.


부분문제

번호 점수 조건
#124점

There is only one player, i. e. n = 1

#244점

At most one player will have Bingo!

#332점

No additional constraints.


예제1

입력
3
babylasagna
1011121314
1516171819
2021222324
2526272829
3031323334
nataliebalmix
1020304050
1121314151
1222324252
1323334353
1424344454
lettri
8988878610
8584831182
8180127978
7713767574
1473727170
6
101112131415
출력
3
babylasagna
nataliebalmix
lettri

babylasagna has a Bingo! in the first row.

nataliebalmix has a Bingo! in the first column.

lettri has a Bingo! in the diagonal starting from the bottom-left corner to the top-right corner.


예제2

입력
1
honi
12345
678910
1112131415
1617181920
2122232425
4
124950
출력
0

Only 4 balls were drawn, so no player can have marked all the 5 numbers in a row, column, or diagonal.


예제3

입력
4
rim
1523142634
1211131617
9067452418
8582776622
627132357
tim
6189256312
2930313233
1117422418
8882776622
447154357
dagi
1523142634
1211131617
9067452418
8582776622
627136357
dim
1523142634
1211131617
9067452418
8582776622
425132337
7
1511667423061
출력
1
tim

출처

COCI 2023/2024 Contest #4 1번

역링크