UVA - 12504

  Updating a Dictionary 

In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given an old dictionary and a new dictionary, find out what were changed.

Each dictionary is formatting as follows:

 

{key:value,key:value,...,key:value}

Each key is a string of lower-case letters, and each value is a non-negative integer without leading zeros or prefix `+'. (i.e. -4, 03 and +77 are illegal). Each key will appear at most once, but keys can appear in any order.

 

Input 

The first line contains the number of test cases  T ( T$ \le$1000). Each test case contains two lines. The first line contains the old dictionary, and the second line contains the new dictionary. Each line will contain at most 100 characters and will not contain any whitespace characters. Both dictionaries could be empty.

 


WARNING: there are no restrictions on the lengths of each key and value in the dictionary. That means keys could be really long and values could be really large.

 

Output 

For each test case, print the changes, formatted as follows:

 

  • First, if there are any new keys, print `+' and then the new keys in increasing order (lexicographically), separated by commas.
  • Second, if there are any removed keys, print `-' and then the removed keys in increasing order (lexicographically), separated by commas.
  • Last, if there are any keys with changed value, print `*' and then these keys in increasing order (lexicographically), separated by commas.

If the two dictionaries are identical, print `No changes' (without quotes) instead.

Print a blank line after each test case.

 

Sample Input 

 

3
{a:3,b:4,c:10,f:6}
{a:3,c:5,d:10,ee:4}
{x:1,xyz:123456789123456789123456789}
{xyz:123456789123456789123456789,x:1}
{first:1,second:2,third:3}
{third:3,second:2}

 

Sample Output 

 

+d,ee
-b,f
*c

No changes

-first

 

 

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <map>
 5 
 6 using namespace std;
 7 
 8 map <string,string> ValueCatchOne;
 9 map <string,string> ValueCatchTwo;
10 
11 void Work(map<string,string>& IDcatch,string str) {
12     int ok = 0;
13     string key = "",value = "";
14     for (int i = 1,len = str.length();i < len;i++) {
15         if (ok == 0) {
16             if (str[i] == ':') {
17                 ok = 1;
18                 continue;
19             }
20             key += str[i];
21         }
22         else {
23             if (str[i] != ',' && str[i] != '}') value += str[i];
24             else {
25                 ok = 0;
26                 IDcatch[key] = value;
27                 key = "";value = "";
28             }
29         }
30     }
31 }
32 
33 int main () {
34     int T;
35     // freopen("1.in","r",stdin);
36     cin >> T;
37     getchar();
38     while (T--) {
39         string str;
40         ValueCatchOne.clear();
41         ValueCatchTwo.clear();
42         cin >> str;
43         Work(ValueCatchOne,str);
44         cin >> str;
45         Work(ValueCatchTwo,str);
46         if (ValueCatchOne.size() == ValueCatchTwo.size()) {
47             int ok = 1;
48             for (map<string,string>::iterator Iter = ValueCatchOne.begin();Iter != ValueCatchOne.end();Iter++) {
49                 if (ValueCatchTwo.count(Iter -> first) == 0 || ValueCatchTwo[Iter->first] != Iter -> second) {
50                     ok = 0;
51                     break;
52                 }
53             }
54             if (ok == 1) {
55                 cout << "No changes" << endl;
56                 cout << endl;
57                 continue;
58             }
59         }
60         {
61             int num = 0;
62             for (map<string,string>::iterator Iter = ValueCatchTwo.begin();Iter != ValueCatchTwo.end();Iter++) {
63                 if (ValueCatchOne.count(Iter -> first) == 0) {
64                     cout << (!num?'+':',') << Iter -> first;
65                     num++;
66                 }
67             }
68             if (num) cout << endl;
69             num = 0;
70             for (map<string,string>::iterator Iter = ValueCatchOne.begin();Iter != ValueCatchOne.end();Iter++) {
71                 if (ValueCatchTwo.count(Iter -> first) == 0) {
72                     cout << (!num?'-':',') << Iter -> first;
73                     num++;
74                 }
75             }
76             if (num) cout << endl;
77             num = 0;
78             for (map<string,string>::iterator Iter = ValueCatchOne.begin();Iter != ValueCatchOne.end();Iter++) {
79                 if (ValueCatchTwo.count(Iter -> first) && ValueCatchTwo[Iter -> first] != Iter -> second) {
80                     cout << (!num?'*':',') << Iter -> first;
81                     num++;
82                 }
83             }
84             if (num) cout << endl;
85         }
86         cout << endl;
87     }    
88 }
View Code

 

转载于:https://www.cnblogs.com/xiaoshanshan/p/4106993.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值