Codeforces 748B Santa Claus and Keyboard Check
来源:互联网 发布:grub 启动windows 编辑:程序博客网 时间:2024/06/06 08:24
比较两个字符串,找出其可以相互替换的字母,使得两个字符串转换成相同的。
遍历,如果不相同就进行替换。
#include <iostream> #include <cstdio>#include <cstdlib>#include <cmath>#include <fstream>#include <algorithm>#include <queue>#include <climits>#include <cstring>#include <string>#include <set>#include <map>#include <queue>#include <stack>#include <vector>#include <list>const int INF = 1e9;using namespace std;typedef long long ll;typedef unsigned long long ull; string s1,s2;map<char,char> mp;set<char> st;map<char,char>::iterator it;int main(){ios::sync_with_stdio(false); cin >> s1>>s2;if(s1==s2){cout << "0"<<endl;return 0;}for(int i=0;i<s1.size();i++){if(s1[i]!=s2[i]){if(st.count(s1[i])||st.count(s2[i]))continue;mp[s1[i]] = s2[i];st.insert(s1[i]);st.insert(s2[i]);char t1 = s1[i];char t2 = s2[i];for(int j=0;j<s1.size();j++){if(s1[j]==t1){s1[j] = t2;continue;}if(s1[j]==t2){s1[j] = t1;}}}}//cout << s1<<endl<<s2<<endl;if(s1!=s2){cout <<"-1"<<endl;return 0;} int re = 0;vector<char> a;vector<char> b; for(it = mp.begin();it!=mp.end();it++){//if(mp[it->second]==it->first)//{re++;a.push_back(it->first);b.push_back(it->second);//mp.erase(mp[it->second]);//}}cout <<re<<endl;for(int i=0;i<re;i++){cout << a[i]<<" "<<b[i]<<endl;}return 0;}
0 0
- 【Codeforces 748 B Santa Claus and Keyboard Check】
- Codeforces 748B-Santa Claus and Keyboard Check
- Codeforces 748B Santa Claus and Keyboard Check
- 【CodeForces 748B 】Santa Claus and Keyboard Check
- 748 B. Santa Claus and Keyboard Check
- 748B Santa Claus and Keyboard Check
- 【codeforces 752B】Santa Claus and Keyboard Check
- 【Codeforces Round #389】Codeforces 752B Santa Claus and Keyboard Check
- Codeforces Round 389 Div.2 B. Santa Claus and Keyboard Check(模拟)
- Codeforces Round #389 (Div. 2)B. Santa Claus and Keyboard Check(模拟)
- 748 C. Santa Claus and Robot codeforces
- CodeForces 748E. Santa Claus and Tangerines
- Codeforces 748 E Santa Claus and Tangerines
- 【Codeforces 748 C Santa Claus and Robot】+ 思维
- CodeForces 748E. Santa Claus and Tangerines(二分,递推)
- Codeforces 748 D Santa Claus and a Palindrome
- 【codeforces 752C】Santa Claus and Robot
- 【codeforces 752E】Santa Claus and Tangerines
- 终结处理和垃圾回收器如何工作
- Visual Studio C1128错误解决方案
- JDK开发环境
- Chrome开发者工具详解 (5):Application、Security、Audits面板
- 1.10 4 (2015 4)
- Codeforces 748B Santa Claus and Keyboard Check
- jdk安装
- 额外惹我fewfew分
- JavaAPI详解系列(7):Class类(1)
- sscanf函数使用
- 平衡树学习导引
- 腾讯开源手游热更新方案Xlua尝鲜(三)——C#访问Lua
- 个人记录-LeetCode 80. Remove Duplicates from Sorted Array II
- zoj1284