PHONELST - Phone List
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
- Emergency 911
- Alice 97 625 999
- Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.
The first line of input gives a single integer, 1 <= t <= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 <= n <= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.
For each test case, output “YES” if the list is consistent, or “NO” otherwise.
Input: 2 3 911 97625999 91125426 5 113 12340 123440 12345 98346 Output: NO YES
Got 4 SIGFPEs for it (because I'm silly and can't do simple math), but the 0.01s was worth it. Could probably get 0.00s but I'm too lazy to write my own sort function.
NO need of trie, sort the string of array lexigraphically and do a pairwise checking from top :-D
AC in one go
Last edit: 2017-02-13 16:46:11
Clear the Trie For Each TEST case ! Costed me 2 WA!!
In first TRIE! AC (:Last edit: 2016-09-17 09:06:06
my first problem using Trie , easy one :)
Wooooow got AC first (Trie) :P
Easy Trie :)