湖南省第八届程序设计竞赛C
来源:互联网 发布:oppor9s和oppor9知乎 编辑:程序博客网 时间:2024/05/03 01:03
Problem C. Updating a Dictionary
In this problem, a dictionary is collectionof key-value pairs, where keys are lower-case letters, and values are non-negativeintegers. Given an old dictionary and a new dictionary, find out what werechanged.
Each dictionary is formatting asfollows:
{key:value,key:value,...,key:value}
Each key is a string oflower-case letters, and each value is a non-negative integer without leadingzeros or prefix '+'. (i.e. -4, 03 and +77 are illegal). Each key will appear atmost once, but keys can appear in any order.
Input
The first line contains thenumber of test cases T (T<=1000). Each test case contains twolines. The first line contains the old dictionary, and the second line containsthe new dictionary. Each line will contain at most 100 characters and will notcontain any whitespace characters. Both dictionaries could be empty.
WARNING: there are no restrictions on thelengths of each key and value in the dictionary. That means keys could bereally long and values could be really large.
Output
For eachtest case, print the changes, formatted as follows:
l First, if there are any new keys,print '+' and then the new keys in increasing order (lexicographically),separated by commas.
l Second, if there are any removedkeys, print '-' and then the removed keys in increasing order(lexicographically), separated by commas.
l Last, if there are any keys withchanged value, print '*' and then these keys in increasing order(lexicographically), separated by commas.
If thetwo dictionaries are identical, print 'No changes' (without quotes) instead.
Print ablank line after each test case.
Sample Input Output for 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}
+d,ee
-b,f
*c
No changes
-first
代码:
// Rujia Liu#include<iostream>#include<string>#include<sstream>#include<cctype>#include<map>#include<vector>#include<algorithm>using namespace std;void make_dict(string s, map<string,string>& m, vector<string>& keys) { for(int i = 0; i < s.size(); i++) { if(!isalpha(s[i]) && !isdigit(s[i])) s[i] = ' '; } stringstream ss(s); string key, value; while(ss >> key) { ss >> value; m[key] = value; keys.push_back(key); }}void print_list(const vector<string> v) { for(int i = 0; i < v.size(); i++) { if(i != 0) cout << ','; cout << v[i]; } cout << '\n';}int main() { int T; cin >> T; while(T--) { string d1, d2; map<string,string> m1, m2; vector<string> all, added, removed, changed; cin >> d1 >> d2; make_dict(d1, m1, all); make_dict(d2, m2, all); sort(all.begin(), all.end()); all.erase(unique(all.begin(), all.end()), all.end()); for(int i = 0; i < all.size(); i++) { string key = all[i]; if(!m1.count(key) && m2.count(key)) added.push_back(key); if(m1.count(key) && !m2.count(key)) removed.push_back(key); if(m1.count(key) && m2.count(key) && m1[key] != m2[key]) changed.push_back(key); } int flag = 0; if(!added.empty()) { flag = 1; cout << "+"; print_list(added); } if(!removed.empty()) { flag = 1; cout << "-"; print_list(removed); } if(!changed.empty()) { flag = 1; cout << "*"; print_list(changed); } if(!flag) cout << "No changes\n"; cout << "\n"; } return 0;}
- 湖南省第八届程序设计竞赛C
- 湖南省第八届程序设计竞赛 A
- 湖南省第八届程序设计竞赛 B
- 湖南省第八届程序设计竞赛D
- 湖南省第八届程序设计竞赛E
- 湖南省第八届程序设计竞赛F
- 湖南省第八届程序设计竞赛G
- 湖南省第八届程序设计竞赛H
- 湖南省第八届程序设计竞赛I
- 湖南省第八届程序设计竞赛J
- 湖南省第八届程序设计竞赛K
- 湖南省第八届程序设计竞赛L
- 湖南省第八届大学生计算机程序设计竞赛C题(UVA 12504)
- 湖南省第八届大学生计算机程序设计竞赛C题 Updating a Dictionary
- 病毒(湖南省第八届大学生计算机程序设计竞赛)
- 湖南省第八届大学生计算机程序设计竞赛部分题解
- 湖南省第三届大学生程序设计竞赛 C 数字整除
- 最短的名字(湖南省第八届大学生计算机程序设计竞赛)
- XML--XSD--类的循环编程过程
- 湖南省第八届程序设计竞赛 B
- jasperReports入门
- sql server 08 安装报错
- unity3d_webplayer_缓存文件结构
- 湖南省第八届程序设计竞赛C
- 黑马程序员---IO流
- 理解 JavaScript 闭包
- eclipse下快捷键总结【永久更新】
- UART中的硬件流控RTS与CTS
- 湖南省第八届程序设计竞赛D
- html标签Object的功能
- java的多重继承~interface模拟
- apache+php配置