UVA11362 Phone List Answer key

Topic link ：UVA11362 Phone List

The question ： Given $n$ No longer than $10$ A string of numbers , Determine whether there are two strings $A$ and $B$, Satisfy $A$ yes $B$ The prefix of , If you have any , Output NO, If there is no , Output YES.

In fact, you can build a $\mathtt{trie}$ The tree then dfs Of

But for convenience , direct sort You can get through it

Time complexity $O(Q{n}^2)$

Code ：

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iomanip>
#include <random>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define N (int)(1e4+15)

int Q,n;
string s[N];
signed main()
{
    
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    // freopen("check.in","r",stdin);
    // freopen("check.out","w",stdout);
    cin >> Q;
    while(Q--)
    {
    
        cin >> n;
        for(int i=1; i<=n; i++)
            cin >> s[i];
        sort(s+1,s+1+n);
        int ok=0;
        for(int i=2; i<=n&&!ok; i++)
            if(s[i].find(s[i-1])==0)ok=1;
        cout << (ok?"NO\n":"YES\n");
    }
    return 0;
}

Reprint please explain the source