2018 Mid-Atlantic USA Regional Contest

#### Start

2018-11-10 08:00 AKST

## 2018 Mid-Atlantic USA Regional Contest

#### End

2018-11-10 13:00 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -1052 days 19:32:31

5:00:00

0:00:00

# Problem BOrphan Backups

GigantoCorp has a problem. They have removed all tape drives from their data center and are doing all of their backups to disk storage. However, they seem to have used more disk space than their backup software indicates should be in use. They think that there are files on the backup storage that are not in the backup software index. They would like your team to write a program to determine if there are“orphan” files on the backup storage that are not in the index or “orphan” index entries that have no corresponding files on the backup storage.

Your program will be provided with two lists – an index of valid backup image names, followed by a list of backup file names.

Your program is to compare the two lists and determine if there are either backup images in the index that have with no files or files that are not associated with any backup image in the index.

## Input

Input is structured in two blocks.

The first is a list of backup images, one per line. Each backup image name consists of $1$ to $32$ printable ASCII characters (no spaces). There may be up to $100\, 000$ images. Each image name is unique, and they may occur in any order.

The end of this block is signaled by an empty line.

The second block contains a list of backup file names, one per line, left justified. A backup file name has the format

imageName_integer_type

where imageName is a backup image name in the format described above, integer is an integer in the range $0\ldots 2\, 000\, 000\, 000$ denoting the time in seconds since January 1, 1970 at 00:00 GMT (the “UNIX epoch”), and type is an uppercase English alphabetic character string of $1$ to $6$ characters. There may be up to $300\, 000$ backup file names. File names are unique, and they may occur in any order.

The end of the second block is signaled by the end of file.

## Output

First, print the list of files with no index entries, one per line, by printing the character “F”, a single space, and then the file name.

After all the orphan files are printed, print the orphan index entries one per line by printing the character “I”, a single space, and then the backup image name.

Entries in each list are to be printed in ASCII lexicographic order.

If every file has an index entry and every index entry has one or more files, print only a line containing the string “No mismatches.”.

Sample Input 1 Sample Output 1
payroll.xls
projects.doc
employees.dat
products.txt

payroll.xls_1539199053_INCR
employees.dat_1539199053_INCR
payroll.xls_1539112653_INCR
employees.dat_1539112653_INCR
payroll.xls_1539026253_FULL
employees.dat_1539026253_FULL
customers.dat_1539026253_FULL
F customers.dat_1539026253_FULL
I products.txt
I projects.doc