POJ_MOOC_8459特殊密码锁

最新推荐文章于 2019-05-23 19:41:00 发布

以负熵为食

最新推荐文章于 2019-05-23 19:41:00 发布

阅读量305

点赞数

分类专栏：贪心文章标签： poj

本文链接：https://blog.csdn.net/qq_16603365/article/details/74938320

版权

贪心专栏收录该内容

6 篇文章 0 订阅

订阅专栏

//POJ8469特殊密码锁
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
char s[110], s1[110], s2[110], model[110];

int main()  {
	int count1 = 1, count2 = 0;
	cin >> s >> model;
	memcpy(s1, s, sizeof(s));//s1的0位置被按下 
	memcpy(s2, s,sizeof(s));//s2的0位置未被按下 
	s1[0] = !(s1[0] - '0') + '0';
	s1[1] = !(s1[1] - '0') + '0';
	for(int i = 0; model[i + 1]; i++) {
		if(s1[i] != model[i]) {
			s1[i] = !(s1[i] - '0') + '0';
			s1[i + 1] = !(s1[i + 1] - '0') + '0';
			if(s1[i + 2]) s1[i + 2] = !(s1[i + 2] - '0') + '0';
			count1++;
		}
	}
	if(strcmp(s1, model)) count1 = -1;
	for(int i = 0; model[i + 1]; i++) {
		if(s2[i] != model[i]) {
			s2[i] = !(s2[i] - '0') + '0';
			s2[i + 1] = !(s2[i + 1] - '0') + '0';
			if(s2[i + 2]) s2[i + 2] = !(s2[i + 2] - '0') + '0';
			count2++;
		}
	}
	if(strcmp(s2, model)) count2 = -1;
	if(count1 == -1 && count2 == -1) {
		printf("impossible\n");
		return 0;
	}
	if(count1 == -1) printf("%d\n", count2);
	else if(count2 == -1) printf("%d\n", count1);
	else printf("%d\n", min(count1, count2));
	return 0;
}