C++(g++ 7.5.0) 解法, 执行用时: 100ms, 内存消耗: 14236K, 提交时间: 2022-11-08 20:17:09

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
int trie[N][30], val[N], k, flag;
void init()
{
	memset(trie, 0, sizeof trie);
	memset(val, 0, sizeof val);
	k = 0;
	flag = 1;
}
void insert(string s)
{
	if(flag == 0) return ; 
	int p = 0;
	int len = s.size();
	for(int i = 0; i < len; i++)
	{
		int u = s[i] - '0';
		if(trie[p][u] == 0) trie[p][u] = ++k;
		p = trie[p][u];
		if(val[p] == 1)
		{
			flag = 0;
			return ;
		}
	}
	val[p] = 1;
	if(p != k) flag = 0;
}
int main()
{
	string s1;
	int t, n;
	cin >> t;
	while(t--)
	{	
		init();
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> s1;
			insert(s1);
		}
		if(flag) cout << "YES\n";
		else cout << "NO\n";
	}
	return 0;
}

C++ 解法, 执行用时: 71ms, 内存消耗: 3456K, 提交时间: 2022-01-16 11:19:30

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin>>t;
	string s[100003];
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=0;i<n;i++)
		cin>>s[i];
		sort(s,s+n);
		int q=0;
		for(int i=0;i<n;i++)
		{
			string a,b;
			a=s[i],b=s[i+1];
			if(b.find(a)==0)
			  q=1;
		}
		if(q)
		cout<<"NO"<<endl;
		else
		cout<<"YES"<<endl;
	}
}