nyoj 991-Registration system (map)

991-Registration system

内存限制:64MB 时间限制:1000ms 特判: No
通过数:3 提交数:4 难度:2

题目描述:

A new e-mail service "Berlandesk" is going to be opened in Berland in the near future.

 The site administration wants to launch their project as soon as possible, that's why they

 ask you to help. You're suggested to implement the prototype of site registration system. 

The system should work on the following principle.

Each time a new user wants to register, he sends to the system a request with his name.

 If such a name does not exist in the system database, it is inserted into the database, and 

the user gets the response OK, confirming the successful registration. If the name already 

exists in the system database, the system makes up a new user name, sends it to the user 

as a prompt and also inserts the prompt into the database. The new name is formed by the

 following rule. Numbers, starting with 1, are appended one after another to name (name1,

 name2, ...), among these numbers the least i is found so that namei does not yet exist in

 the database.

输入描述:

The first line contains number n (1 ≤ n ≤ 105). The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 1000 characters, which are all lowercase Latin letters.

输出描述:

Print n lines, which are system responses to the requests: OK in case of successful registration, or a prompt with a new name, if the requested name is already taken.

样例输入:

复制

4
abacaba
acaba
abacaba
acab

样例输出:

OK
OK
abacaba1
OK

C/C++:

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
const int MAX=2e5 + 10;

int n;
char buf[MAX];
map <string, int> m;

int main()
{
    scanf("%d", &n);
    while (n --)
    {
        scanf("%s", &buf);
        if (m.find(buf) != m.end())
        {
            cout <<buf <<++ m[buf] <<endl;
        }
        else
        {
            cout <<"OK" <<endl;
            m.insert(make_pair(buf, 0));
        }
    }
    return 0;
}