B. MIN-MEX Cut

题目如下：

A binary string is a string that consists of characters 0 and 1 Let MEX

of a binary string be the smallest digit among 0, 1, or 2 that does not occur in the string. For example, MEX of 001011 is 2, because 0 and 1 occur in the string at least once, MEX of 1111 is 0, because 0 and 2 do not occur in the string and 0<2

.

A binary string s

is given. You should cut it into any number of substrings such that each character is in exactly one substring. It is possible to cut the string into a single substring — the whole string.

A string a

is a substring of a string b if a can be obtained from b

by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.

What is the minimal sum of MEX

of all substrings pieces can be?

Input

The input consists of multiple test cases. The first line contains a single integer t

(1≤t≤104

) — the number of test cases. Description of the test cases follows.

Each test case contains a single binary string s

(1≤|s|≤105

).

It's guaranteed that the sum of lengths of s

over all test cases does not exceed 105

.

Output

For each test case print a single integer — the minimal sum of MEX

of all substrings that it is possible to get by cutting s optimally.

AC代码如下：

#define maxn 100010
#include<stdio.h>
#include<string.h>
char s[maxn];
int main()
{
	int t,i;
	scanf("%d", &t);
	while (t--)
	{
		memset(s, 0, sizeof s);
		scanf("%s", s, maxn);
		int flag1 = 0;//是否有1
		int flag2 = 0;//0是否连续:0->没有出现0，1，2—》连续，3—》不连续
		for (i = 0; i < strlen(s); i++)
		{
			if (s[i] == '0')
			{
				if(flag2==0)
				flag2 = 1;
				if (flag2 == 2)
					flag2 = 3;
			}
			if (s[i] == '1')
			{
				flag1 = 1;
				if (flag2 == 1)
				{
					flag2 = 2;
				}
			}
		}
		if (flag1 == 0 && flag2 != 3 && flag2 != 0)//无1且0连续
		{
			printf("1\n");
		}
		else if (flag1 == 1 && flag2 != 3 && flag2 != 0)//有1且0连续
		{
			printf("1\n");
		}
		else if (flag1 == 1 && flag2 == 3)//有1且0不连续
		{
			printf("2\n");
		}
		else if(flag1 == 1 && flag2==0)
		{
			printf("0\n");
		}
	}
	return 0;
}

代码解析：

核心思路：确定0的位置（0是否连续出现）；确定是否出现1；

0连续——》输出1

0不连续——》输出2

无0但有1——》输出0

相信根据代码与代码解析就可以A这个题了！

ps：晚上宿舍一起在努力，奋斗的动力又再次蓄上了力！

ACM越来越近，奋斗努力！！！