Codeforces Round #303 (Div. 2) A - Equidistant String(贪心)
来源:互联网 发布:大数据软件有哪些 编辑:程序博客网 时间:2024/06/09 14:21
题意:给定两个由0,1组成的相同长度的序列,求到两个序列汉明距离相同的由0,1组成的序列,若有多个输出一个即可。
解题思路:首先若是存在所求序列, 那么所给的两个串的对应相同下标不同的数字的个数 ,一定为偶数。然后就是把这个 偶数 / 2个 与第一个串(与第二个串数字不同)相同, 另外一半与第二个串(与第一个串对应数字不同)相同, 两个串对应位置相同的地方, 所求串也相同。
Description
Little Susie loves strings. Today she calculates distances between them. As Susie is a small girl after all, her strings contain only digits zero and one. She uses the definition of Hamming distance:
We will define the distance between two strings s and t of the same length consisting of digits zero and one as the number of positions i, such that si isn't equal to ti.
As besides everything else Susie loves symmetry, she wants to find for two strings s and t of length n such string p of length n, that the distance from p to s was equal to the distance from p to t.
It's time for Susie to go to bed, help her find such string p or state that it is impossible.
Input
The first line contains string s of length n.
The second line contains string t of length n.
The length of string n is within range from 1 to 105. It is guaranteed that both strings contain only digits zero and one.
Output
Print a string of length n, consisting of digits zero and one, that meets the problem statement. If no such string exist, print on a single line "impossible" (without the quotes).
If there are multiple possible answers, print any of them.
Sample Input
00011011
0011
000111
impossible
Hint
In the first sample different answers are possible, namely — 0010, 0011, 0110, 0111, 1000, 1001, 1100, 1101.
#include<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<list>#include<iostream>#include<map>#include<queue>#include<set>#include<stack>#include<vector>using namespace std;#define MAX_N 100050const int INF = 0x3f3f3f3f;char s[MAX_N], t[MAX_N], p[MAX_N];int main(){ cin >> s >> t; int len = strlen(s); int cnt = 0; int flag = 0; for(int i = 0 ; i < len ; i++) { if(s[i] != t[i]) { cnt++; if(flag) { p[i] = s[i]; flag = 0; } else { p[i] = t[i]; flag = 1; } } else p[i] = s[i]; } if(cnt % 2) cout<<"impossible"<<endl; else printf("%s\n", p); cout<<endl; return 0;}
- Codeforces Round #303 (Div. 2) A - Equidistant String(贪心)
- Codeforces Round #303 (Div.2)-B. Equidistant String(模拟)
- Codeforces Round #303 Equidistant String
- Codeforces Round #260 (Div. 2) A (贪心)
- Codeforces Round #111 (Div. 2) A Twins (贪心)
- Codeforces Round #279 (Div. 2)---A. Team Olympiad (贪心)
- Codeforces Round #202 (Div. 2)(A)贪心
- Codeforces Round #311 (Div. 2)(A)贪心
- Codeforces Round #342 (Div. 2)(A)贪心,数学
- Codeforces Round #303 (Div. 2) D 贪心
- Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) A(贪心)
- Codeforces Round #199 (Div. 2) A ( 简单贪心 )
- Codeforces Round #236 (Div. 2)A(贪心、数学)
- Codeforces Round #340 (Div. 2)-A. Elephant(贪心)
- codeforces Round #364(Div.2)701A Cards 贪心算法
- Codeforces Round #436 (Div. 2)-贪心-D. Make a Permutation!
- Codeforces Round #284 (Div. 2)---A. Watching a movie (暴力 + 贪心)
- codeforces-303-B. Equidistant String-水题
- planahead调试程序
- 测试分析例子--杯子,圆珠笔
- Myeclipse在mac中如何配置jdk
- UVa-400 Unix ls
- ZOJ 3703 Happy Programming Contest(0-1背包)
- Codeforces Round #303 (Div. 2) A - Equidistant String(贪心)
- Android Volley完全解析(一),初识Volley的基本用法
- 利用小工具instsrv和srvany 创建windows服务
- (转)js中sort()方法的用法,参数以及排序原理
- springmvc国际化实现方法
- ffmpeg 笔记 二:编译安装ffmpeg库
- UIWebView与JS的深度交互
- DispatcherServlet讲解
- iOS 项目中使用CocoaPod管理项目初试