zoukankan      html  css  js  c++  java
  • Codeforce:4C. Registration system (映射)

    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 name i does not yet exist in the database.

    Input

    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 32 characters, which are all lowercase Latin letters.

    Output

    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.

    Examples

    input

    4
    abacaba
    acaba
    abacaba
    acab
    

    output

    OK
    OK
    abacaba1
    OK
    

    input

    6
    first
    first
    second
    second
    third
    third
    

    output

    OK
    first1
    OK
    second1
    OK
    third1
    

    思路:这道题是一道映射题,name对应的有几个即可

    #include<bits/stdc++.h>
    using namespace std;
    int main() {
    	//freopen("in.txt","r",stdin);
    	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    	int t; cin >> t;
    	unordered_map<string, int>s; string str;//unordered_map 不进行排序优化时间,不过仅从900+ms减少到600+ms
    	while (t--) {
    		cin >> str; 
    		s[str]++;
    		if (s[str] > 1)cout << str << s[str] - 1 << endl;
    		else cout << "OK" << endl;
    	}
    }
    
    //dalao的优化时间算法:154ms
    #include<bits/stdc++.h>
    using namespace std;
    #define getchar_unlocked() _getchar_nolock()
    template<typename T> inline bool sc(T& num) { 
    	bool neg = 0; int c; num = 0; 
    	while (c = getchar_unlocked(), c < 33) { 
    		if (c == EOF) return false; 
    	} 
    	if (c == '-') { 
    		neg = 1; c = getchar_unlocked();
    	} 
    	for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48; if (neg) num *= -1; return true; }
    template<typename T, typename ...Args> inline void sc(T& num, Args&...args) { bool neg = 0; int c; num = 0; while (c = getchar_unlocked(), c < 33) { ; } if (c == '-') { neg = 1; c = getchar_unlocked(); } for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48; if (neg) num *= -1; sc(args...); }
    inline void getstr(string& str) { 
    	str.clear(); char cur; 
    	while (cur = getchar_unlocked(), cur < 33) { ; }
    	while (cur > 32) { str += cur; cur = getchar_unlocked(); } 
    }
    
    int32_t main()
    {
    	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    	int n;
    	sc(n);
    	unordered_map<string, int> arr;
    	string str;
    	for (int i = 0; i < n; i++)
    	{
    		getstr(str);
    		int r = arr[str]++;
    		if (!r)
    		{
    			cout << "OK\n";
    		}
    		else
    		{
    			cout << str << r << '\n';
    		}
    	}
    
    	return 0;
    }
    
  • 相关阅读:
    memcache清理缓存
    JqGrid常见使用方法
    SQLyog 最新版本12.5-64bit 完美破解,亲测可用!
    Navicat Premium 最新版本12.1.16-64bit 完美破解,亲测可用!
    【JAVA基础】一:聊聊笔试常见到的 “==、equal” 比较是否相等的内在差别
    scrapy 爬虫返回json格式内容unicode编码转换为中文的问题解决
    Python3的桌面程序开发利器:Eric6的环境搭建、使用
    通过Redis、Memcache的 incr 原子操作防刷机制的使用差别
    从零开始搭建一个从Win7环境备份至CentOS7的SVN双机备份环境
    通过Quartz 配置定时调度任务:使用cron表达式配置时间点
  • 原文地址:https://www.cnblogs.com/RioTian/p/13360874.html
Copyright © 2011-2022 走看看