144 人解决，207 人已尝试。
201 份提交通过，共有 1006 份提交。
3.7 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
WHU ACM Team is working on a brand new web browser named “Whu-Super-Browser”. You’re in response for a powerful feature: recording the previous addresses. Moreover, when a string is inputted, the browser will display all the addresses start with it. The addresses shall be sorted by visited times, in descending order. This feature is very useful to users.
Can you complete it?
There’re two kinds of operations:
[url_str]: visit a website with the URL: [url_str].[str]: display all addresses start with [str] and sort them by visited times, in descending order. If two addresses have the same visited times, then sort them in the lexicographical order.The input consists of multiple test cases. The first line of input contains an integer T, which is the number of test cases.
Each test case is on several lines.
The first line of each test case consists of an integer $N$.
Each of the following $N$ lines consists of an operation, Visit or Display.
$T$ is an integer, and $T \leq 10$.
$N$ is an integer, and $1 \leq N \leq 100$.
There’s NO blank line between test cases.
[url_str] and [str] only contains lower case letters a - z, ., /, :.
The length of [url_str] and [str] is greater than $0$ and won’t exceed $100$.
For each test case, display addresses as required, each address on a separated line.
Add a blank line after each Display operation.
1 10 Visit http://acm.whu.edu.cn Visit http://acm.pku.edu.cn Visit http://acm.timus.ru Visit http://acm.whu.edu.cn Visit http://acm.whu.edu.cn Visit http://acm.pku.edu.cn Display http://acm Visit baidu.com Visit www.whu.edu.cn Display b
http://acm.whu.edu.cn http://acm.pku.edu.cn http://acm.timus.ru baidu.com
144 人解决，207 人已尝试。
201 份提交通过，共有 1006 份提交。
3.7 EMB 奖励。
创建: 15 年，8 月前.
修改: 6 年，3 月前.
最后提交: 8 月，1 周前.
来源: The 4th Baidu Cup Central China Invitational Programming Contest