Phone List
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18382 Accepted Submission(s): 6189
1. Emergency 911
2. Alice 97 625 999
3. 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.
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <iostream>
#include <stack>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
//#include <bits/stdc++.h>
//#define LOACL
#define MAX 30
#define space " "
using namespace std;
//typedef long long LL;
typedef __int64 Int;
typedef pair<int, int> paii;
const int INF = 0x3f3f3f3f;
const double ESP = 1e-5;
const double PI = acos(-1.0);
const int MAXN = 1000000 + 10;
char str[30];
bool flag;
struct Trie {
Trie *next[MAX];
int endd;
};
Trie *root;
void create_trie(char str[]) {
int len = strlen(str);
Trie *p = root, *q;
for(int i = 0; i < len; i++) {
int id = str[i] - '0';
if(p->next[id] == NULL) {
q = new Trie;
q->endd = 0;
for(int j = 0; j < MAX; j++) {
q->next[j] = NULL;
}
p->next[id] = q;
}
else {
if(p->next[id]->endd == 1 || str[i + 1] == '\0') {
flag = false; return;
}
}
p = p->next[id];
}
p->endd = 1;
}
void free_trie(Trie* T) {
for(int i = 0; i < 10; i++) {
if(T->next[i] != NULL)
free_trie(T->next[i]);
}
free(T);
}
int main() {
int T, n;
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
flag = true;
root = new Trie;
for(int i = 0;i < 10; i++) {
root->next[i] = NULL;
root->endd = 0;
}
for(int i = 0; i < n; i++) {
scanf("%s", str);
if(flag) create_trie(str);
}
if(flag) printf("YES\n");
else printf("NO\n");
free_trie(root);
}
return 0;
}