1703D. Double Strings

D. Double Strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given nn strings s1,s2,…,sns1,s2,…,sn of length at most 88.

For each string sisi, determine if there exist two strings sjsj and sksk such that si=sj+sksi=sj+sk. That is, sisi is the concatenation of sjsj and sksk. Note that jj can be equal to kk.

Recall that the concatenation of strings ss and tt is s+t=s1s2…spt1t2…tqs+t=s1s2…spt1t2…tq, where pp and qq are the lengths of strings ss and tt respectively. For example, concatenation of "code" and "forces" is "codeforces".

Input

The first line contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases.

The first line of each test case contains a single integer nn (1≤n≤1051≤n≤105) — the number of strings.

Then nn lines follow, the ii-th of which contains non-empty string sisi of length at most 88, consisting of lowercase English letters. Among the given nn strings, there may be equal (duplicates).

The sum of nn over all test cases doesn't exceed 105105.

Output

For each test case, output a binary string of length nn. The ii-th bit should be 11 if there exist two strings sjsj and sksk where si=sj+sksi=sj+sk, and 00 otherwise. Note that jj can be equal to kk.

Example

input

Copy

3
5
abab
ab
abc
abacb
c
3
x
xx
xxx
8
codeforc
es
codes
cod
forc
forces
e
code

output

Copy

10100
011
10100101

Note

In the first test case, we have the following:

• s1=s2+s2s1=s2+s2, since abab=ab+ababab=ab+ab. Remember that jj can be equal to kk.
• s2s2 is not the concatenation of any two strings in the list.
• s3=s2+s5s3=s2+s5, since abc=ab+cabc=ab+c.
• s4s4 is not the concatenation of any two strings in the list.
• s5s5 is not the concatenation of any two strings in the list.

Since only s1s1 and s3s3 satisfy the conditions, only the first and third bits in the answer should be 11, so the answer is 1010010100.

昨天就是被这道屑题卡住，想的太复杂，不如直接动手做。

题意大概是找到该字符串在整个字符串组中有没有两个字符串加来等于该字符串的，有的话，该位置就是1否则就是0.

思路大概就是把字符串以此分成两份，再到整个字符串组中去找这两个字符串是否存在。

#include<iostream>
#include<algorithm>
#include<string>
#include<set>
using namespace std;
const int manx = 2e6 + 10;
long long a[manx];
long long b[manx];
string s[manx];
int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		int n;
		cin >> n;
		string k;
		set<string>yuuka;//放到set中进行查找工作。
		for (int i = 0; i < n; i++)
		{
			cin >> s[i];
			yuuka.insert(s[i]);
		}
		for (int i = 0; i < n; i++)	
		{	
			int ok = 0;
			for (int j = 1; j < s[i].size(); j++)
			{
			
			string x = s[i].substr(0, j); 
			string y = s[i].substr(j);//把s[i]分成两个字串如aba分为a，ab，下一个循环分为ab，a。
				
			if (yuuka.count(x) && yuuka.count(y))//如果在整个字符串数组中能同时查到x，y就说明存在否则就不存在。
				ok = 1;
			}
			k.push_back('0' + ok);	
		}
		cout << k;
		cout << endl;
	}
}