Problem
On Unix computers, data is stored in directories. There is one root directory, and this might have several directories contained inside of it, each with different names. These directories might have even more directories contained inside of them, and so on.A directory is uniquely identified by its name and its parent directory (the directory it is directly contained in). This is usually encoded in a path, which consists of several parts each preceded by a forward slash ('/'). The final part is the name of the directory, and everything else gives the path of its parent directory. For example, consider the path:
/home/gcj/finals
This refers to the directory with name "finals" in the directory described by "/home/gcj", which in turn refers to the directory with name "gcj" in the directory described by the path "/home". In this path, there is only one part, which means it refers to the directory with the name "home" in the root directory.To create a directory, you can use the mkdir command. You specify a path, and thenmkdir will create the directory described by that path, but only if the parent directory already exists. For example, if you wanted to create the "/home/gcj/finals" and "/home/gcj/quals" directories from scratch, you would need four commands:
mkdir /home
mkdir /home/gcj
mkdir /home/gcj/finals
mkdir /home/gcj/quals
Given the full set of directories already existing on your computer, and a set of new directories you want to create if they do not already exist, how many mkdir commands do you need to use?
Input
The first line of the input gives the number of test cases, T. T test cases follow. Each case begins with a line containing two integers N and M, separated by a space.The next N lines each give the path of one directory that already exists on your computer. This list will include every directory already on your computer other than the root directory. (The root directory is on every computer, so there is no need to list it explicitly.)
The next M lines each give the path of one directory that you want to create.
Each of the paths in the input is formatted as in the problem statement above. Specifically, a path consists of one or more lower-case alpha-numeric strings (i.e., strings containing only the symbols 'a'-'z' and '0'-'9'), each preceded by a single forward slash. These alpha-numeric strings are never empty.
Output
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the number of mkdir you need.Limits
1 ≤ T ≤ 100.No path will have more than 100 characters in it.
No path will appear twice in the list of directories already on your computer, or in the list of directories you wish to create. A path may appear once in both lists however. (See example case #2 below).
If a directory is listed as being on your computer, then its parent directory will also be listed, unless the parent is the root directory.
The input file will be no longer than 100,000 bytes in total.
Small dataset
0 ≤ N ≤ 10.1 ≤ M ≤ 10.
Large dataset
0 ≤ N ≤ 100.1 ≤ M ≤ 100.
Sample
Solution
To attack this problem we can use the famous TRIE data structure. We have already seen enough about this data structure in steps and this becomes so handy in this particular problem.
A TRIE data structure simply stores the data that becomes easy for retrieval. But lets not bother about the retrieval part in this particular problem. We will simply increase our counter whenever we add a new folder to the existing directory structure. The place where we optimize this problem involves in its running time. Whenever we see a new directory structure, we simply pass through it in the length times instead which is linear in time jargons. The solution is given below.
private int solve(String[] already, String[] fresh) {
Trie trieDSA = new Trie();
for(int i=0;i<already.length;i++){
trieDSA.insert(already[i],false);
}
for(int i=0;i<fresh.length;i++){
trieDSA.insert(fresh[i], true);
}
return trieDSA.counter;
}
So clean, isnt it? The TRIE and the Node classes are given below. Remember, please go through my TRIE data structure introduction for few minutes, its definitely a knowledgeable one! Trust me :)
class Node {
String currentPath;
boolean marker;
Collection<Node> child;
public Node(String path){
child = new HashSet<Node>();
marker = false;
currentPath = path;
}
public Node subNode(String path){
if(child!=null){
for(Node eachChild:child){
if(eachChild.currentPath.equals(path)){
return eachChild;
}
}
}
return null;
}
}
class Trie{
private Node root;
public int counter = 0;
public Trie(){
root = new Node("");
}
public void insert(String pathArray, boolean shouldTrack){
Node current = root;
String[] paths = pathArray.substring(1).split("\\/");
if(paths.length==0){
//DO NOTHING
current.marker=true;
}
for(int i=0;i<paths.length;i++){
Node child = current.subNode(paths[i]);
if(child!=null){
current = child;
}
else{
current.child.add(new Node(paths[i]));
current = current.subNode(paths[i]);
if(shouldTrack){
counter++;
}
}
// Set marker to indicate end of the word
if(i==paths.length-1)
current.marker = true;
}
}
}
Complete source code : here
Sample Input : here
Cheers!!
Bragaadeesh.
