题目地址:http://www.patest.cn/contests/mooc-ds/09-%E6%95%A3%E5%88%972
/*
09-散列2. QQ帐户的申请与登陆(25)
http://www.patest.cn/contests/mooc-ds/09-%E6%95%A3%E5%88%972
C++STL map直接ac 不过耗时,耗内存 确实比较大
*/
#include <cstdio>
#include <sstream>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <iterator>
using namespace std;
#define N 1002
int n;
unordered_map<string, int> umExits;
unordered_map<string, string> umUserPass;
int main()
{
//freopen("in", "r", stdin);
scanf("%d", &n);
int i;
char c;
string user, pass;
for (i = 0; i < n; i++)
{
cin >> c >> user >> pass;
if (c == 'L')
{
if (umExits[user] == 0)
{
printf("ERROR: Not Exist\n");
}
else{
if (umUserPass[user] == pass)
{
printf("Login: OK\n");
}
else{
printf("ERROR: Wrong PW\n");
}
}
}
else{
if (umExits[user])
{
printf("ERROR: Exist\n");
}
else{ // new成功 ,map 相应处理
umExits[user] = 1;
umUserPass[user] = pass;
printf("New: OK\n");
}
}
}
return 0;
}