303737: CF722B. Verse Pattern

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

Description

Verse Pattern

题意翻译

你现在有 $n$ 句话,还有他们分别对应的应有的元音个数,现在要你判断每句话是否都含有正确的元音($\verb!a,e,i,o,u,y!$)个数。

题目描述

You are given a text consisting of $ n $ lines. Each line contains some space-separated words, consisting of lowercase English letters. We define a syllable as a string that contains exactly one vowel and any arbitrary number (possibly none) of consonants. In English alphabet following letters are considered to be vowels: 'a', 'e', 'i', 'o', 'u' and 'y'. Each word of the text that contains at least one vowel can be divided into syllables. Each character should be a part of exactly one syllable. For example, the word "mamma" can be divided into syllables as "ma" and "mma", "mam" and "ma", and "mamm" and "a". Words that consist of only consonants should be ignored. The verse patterns for the given text is a sequence of $ n $ integers $ p_{1},p_{2},...,p_{n} $ . Text matches the given verse pattern if for each $ i $ from $ 1 $ to $ n $ one can divide words of the $ i $ -th line in syllables in such a way that the total number of syllables is equal to $ p_{i} $ . You are given the text and the verse pattern. Check, if the given text matches the given verse pattern.

输入输出格式

输入格式


The first line of the input contains a single integer $ n $ ( $ 1<=n<=100 $ ) — the number of lines in the text. The second line contains integers $ p_{1},...,p_{n} $ ( $ 0<=p_{i}<=100 $ ) — the verse pattern. Next $ n $ lines contain the text itself. Text consists of lowercase English letters and spaces. It's guaranteed that all lines are non-empty, each line starts and ends with a letter and words are separated by exactly one space. The length of each line doesn't exceed $ 100 $ characters.

输出格式


If the given text matches the given verse pattern, then print "YES" (without quotes) in the only line of the output. Otherwise, print "NO" (without quotes).

输入输出样例

输入样例 #1

3
2 2 3
intel
code
ch allenge

输出样例 #1

YES

输入样例 #2

4
1 2 3 1
a
bcdefghi
jklmnopqrstu
vwxyz

输出样例 #2

NO

输入样例 #3

4
13 11 15 15
to be or not to be that is the question
whether tis nobler in the mind to suffer
the slings and arrows of outrageous fortune
or to take arms against a sea of troubles

输出样例 #3

YES

说明

In the first sample, one can split words into syllables in the following way: `in-tel<br></br>co-de<br></br>ch al-len-ge<br></br>`Since the word "ch" in the third line doesn't contain vowels, we can ignore it. As the result we get $ 2 $ syllabels in first two lines and $ 3 $ syllables in the third one.

Input

题意翻译

你现在有 $n$ 句话,还有他们分别对应的应有的元音个数,现在要你判断每句话是否都含有正确的元音($\verb!a,e,i,o,u,y!$)个数。

加入题单

上一题 下一题 算法标签: