301965: CF373A. Collecting Beats is Fun

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Collecting Beats is Fun

题意翻译

一共有 $4\times4=16$ 个格子,每个格子 $(i,j)$ 需要在 $t_{i,j}$ 时刻点击(若为星号则不需要点击),你每只手同一时刻只能点击 $k$ 个格子(**注意你有两只手!**),求你是否能完成任务。 $t_{i,j}$ 是一个 $1-9$ 的数字。

题目描述

Cucumber boy is fan of Kyubeat, a famous music game. Kyubeat has $ 16 $ panels for playing arranged in $ 4×4 $ table. When a panel lights up, he has to press that panel. Each panel has a timing to press (the preffered time when a player should press it), and Cucumber boy is able to press at most $ k $ panels in a time with his one hand. Cucumber boy is trying to press all panels in perfect timing, that is he wants to press each panel exactly in its preffered time. If he cannot press the panels with his two hands in perfect timing, his challenge to press all the panels in perfect timing will fail. You are given one scene of Kyubeat's panel from the music Cucumber boy is trying. Tell him is he able to press all the panels in perfect timing.

输入输出格式

输入格式


The first line contains a single integer $ k $ ( $ 1<=k<=5 $ ) — the number of panels Cucumber boy can press with his one hand. Next 4 lines contain 4 characters each (digits from 1 to 9, or period) — table of panels. If a digit $ i $ was written on the panel, it means the boy has to press that panel in time $ i $ . If period was written on the panel, he doesn't have to press that panel.

输出格式


Output "YES" (without quotes), if he is able to press all the panels in perfect timing. If not, output "NO" (without quotes).

输入输出样例

输入样例 #1

1
.135
1247
3468
5789

输出样例 #1

YES

输入样例 #2

5
..1.
1111
..1.
..1.

输出样例 #2

YES

输入样例 #3

1
....
12.1
.2..
.2..

输出样例 #3

NO

说明

In the third sample boy cannot press all panels in perfect timing. He can press all the panels in timing in time 1, but he cannot press the panels in time 2 in timing with his two hands.

Input

题意翻译

一共有 $4\times4=16$ 个格子,每个格子 $(i,j)$ 需要在 $t_{i,j}$ 时刻点击(若为星号则不需要点击),你每只手同一时刻只能点击 $k$ 个格子(**注意你有两只手!**),求你是否能完成任务。 $t_{i,j}$ 是一个 $1-9$ 的数字。

加入题单

上一题 下一题 算法标签: