codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

501B.md (1967B)


      1 Source: https://codeforces.com/problemset/problem/501/B
      2 
      3 B. Misha and Changing Handles
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But each new handle must not be equal to any handle that is already used or that was used at some point.
     22 
     23 Misha has a list of handle change requests. After completing the requests he wants to understand the relation between the original and the new handles of the users. Help him to do that.
     24 
     25 Input
     26 
     27 The first line contains integer *q* (1 ≤ *q* ≤ 1000), the number of handle change requests.
     28 
     29 Next *q* lines contain the descriptions of the requests, one per line.
     30 
     31 Each query consists of two non-empty strings *old* and *new*, separated by a space. The strings consist of lowercase and uppercase Latin letters and digits. Strings *old* and *new* are distinct. The lengths of the strings do not exceed 20.
     32 
     33 The requests are given chronologically. In other words, by the moment of a query there is a single person with handle *old*, and handle *new* is not used and has not been used by anyone.
     34 
     35 Output
     36 
     37 In the first line output the integer *n* — the number of users that changed their handles at least once.
     38 
     39 In the next *n* lines print the mapping between the old and the new handles of the users. Each of them must contain two strings, *old* and *new*, separated by a space, meaning that before the user had handle *old*, and after all the requests are completed, his handle is *new*. You may output lines in any order.
     40 
     41 Each user who changes the handle must occur exactly once in this description.
     42 
     43 Examples
     44 
     45 Input
     46 
     47 ```
     48 5  
     49 Misha ILoveCodeforces  
     50 Vasya Petrov  
     51 Petrov VasyaPetrov123  
     52 ILoveCodeforces MikeMirzayanov  
     53 Petya Ivanov
     54 ```
     55 
     56 Output
     57 
     58 ```
     59 3  
     60 Petya Ivanov  
     61 Misha MikeMirzayanov  
     62 Vasya VasyaPetrov123
     63 ```