CF1194C.From S To T

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given three strings $s$ , $t$ and $p$ consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.

During each operation you choose any character from $p$ , erase it from $p$ and insert it into string $s$ (you may insert this character anywhere you want: in the beginning of $s$ , in the end or between any two consecutive characters).

For example, if $p$ is aba, and $s$ is de, then the following outcomes are possible (the character we erase from $p$ and insert into $s$ is highlighted):

aba $\rightarrow$ ba, de $\rightarrow$ ade;
aba $\rightarrow$ ba, de $\rightarrow$ dae;
aba $\rightarrow$ ba, de $\rightarrow$ dea;
aba $\rightarrow$ aa, de $\rightarrow$ bde;
aba $\rightarrow$ aa, de $\rightarrow$ dbe;
aba $\rightarrow$ aa, de $\rightarrow$ deb;
aba $\rightarrow$ ab, de $\rightarrow$ ade;
aba $\rightarrow$ ab, de $\rightarrow$ dae;
aba $\rightarrow$ ab, de $\rightarrow$ dea;

Your goal is to perform several (maybe zero) operations so that $s$ becomes equal to $t$ . Please determine whether it is possible.

Note that you have to answer $q$ independent queries.

输入格式

The first line contains one integer $q$ ( $1 \le q \le 100$ ) — the number of queries. Each query is represented by three consecutive lines.

The first line of each query contains the string $s$ ( $1 \le |s| \le 100$ ) consisting of lowercase Latin letters.

The second line of each query contains the string $t$ ( $1 \le |t| \le 100$ ) consisting of lowercase Latin letters.

The third line of each query contains the string $p$ ( $1 \le |p| \le 100$ ) consisting of lowercase Latin letters.

输出格式

For each query print YES if it is possible to make $s$ equal to $t$ , and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

输入输出样例

输入#1

4
ab
acxb
cax
a
aaaa
aaabbcc
a
aaaa
aabbcc
ab
baaa
aaaaa

输出#1

YES
YES
NO
NO

说明/提示

In the first test case there is the following sequence of operation:

$s = $ ab, $t = $ acxb, $p = $ cax;
$s = $ acb, $t = $ acxb, $p = $ ax;
$s = $ acxb, $t = $ acxb, $p = $ a.

In the second test case there is the following sequence of operation:

$s = $ a, $t = $ aaaa, $p = $ aaabbcc;
$s = $ aa, $t = $ aaaa, $p = $ aabbcc;
$s = $ aaa, $t = $ aaaa, $p = $ abbcc;
$s = $ aaaa, $t = $ aaaa, $p = $ bbcc.

首页