CF 324C. Marina and Vasya
来源:互联网 发布:在淘宝上买狗安全吗 编辑:程序博客网 时间:2024/06/08 09:09
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<list>#include<queue>using namespace std;const int maxn=100010;char stra[maxn];char strb[maxn];char strc[maxn];int main(){ int n,t,i,j,k,num; scanf("%d%d",&n,&t); scanf("%s%s",stra,strb); int sam=0; for(i=0;i<n;++i){ if(stra[i]==strb[i])sam++; } int a=0,b=0;t=n-t;num=0; a=min(t,sam);b=min(t,sam); for(i=0;i<n;++i){ if(stra[i]==strb[i]&&num<t){ strc[i]=stra[i];num++; } else if(stra[i]==strb[i]){ for(j=0;j<26;++j){ if('a'+j!=stra[i]){ strc[i]='a'+j;break; } } } else if(a<t){ strc[i]=stra[i];a++; } else if(b<t){ strc[i]=strb[i];b++; } else { for(j=0;j<26;++j){ if('a'+j!=stra[i]&&'a'+j!=strb[i]){ strc[i]='a'+j;break; } } } } if(a<t||b<t){ printf("-1\n"); } else { strc[n]=0; printf("%s\n",strc); } return 0;}
0 0
- CF 324C. Marina and Vasya
- CF#324-C-Marina and Vasya-字符串水题
- cf#324 Div.2 Problem C Marina and Vasya
- Codeforces Round #324 C Marina and Vasya
- codeforces 324# C. Marina and Vasya (贪心)
- Codeforces Round #324 (Div. 2)C. Marina and Vasya
- Codeforces Round #324 (Div. 2) 584C. Marina and Vasya
- Codeforces Round #324 (Div. 2) C. Marina and Vasya
- Codeforces #324 Div2 C Marina and Vasya(构造)
- Codeforces Round #324 (Div. 2)C. Marina and Vasya
- Codeforces 584C Marina and Vasya
- codeforces 584C Marina and Vasya
- Codeforces 584C Marina and Vasya 【构造】
- Codeforces 584C Marina and Vasya
- CodeForces 584C - Marina and Vasya(构造)
- codeforces 584C Marina and Vasya
- cf C. Marina and Vasya (字符串处理_模拟吧)
- 【打CF,学算法——二星级】Codeforces 584C Marina and Vasya (简单构造)
- leetcode182-Duplicate Emails(找出出现重复的数据)
- 使用CSS修改HTML5 input placeholder颜色
- PHP 常用函数整理
- C++多线程编程简单实例(转载的,留着备用)
- Linux-source和export命令小结
- CF 324C. Marina and Vasya
- 公司、办公司内如何限制上外网因特网、只能连内网局域网 - 注册表工具软件、批处理办法 - 注册表转换成批处理BAT,批处理如何修改注册表
- 自定义Django Form中choicefield下拉菜单选取数据库内容
- Android Studio 2.0出炉
- php 比较字符串或文章的相似度
- iOS、mac开源项目及库汇总
- Android 开发java知识整理
- nfs 快速搭建
- 设计模式——单一职责原则