每一次AC都是一种感动

Time Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each s

Ants in Leaves Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u Description Tree is a connected graph without cycles. A leaf of a tree is any vertex connected w

Windows 10 Problem Description Long long ago, there was an old monk living on the top of a mountain. Recently, our old monk found the operating system of his computer was updating to windows 10

题意： 给出两个字符串 S和T ，S中只含0，1，？，T中只含0,1 要求对S操作把S转换成T，规则如下： 1.0 ->1 2.任意位置两两交换 3.？->0或1 求最少步数，如果无法转换输出-1对于S与T的不对应情况，能很直观的分为四类，01 10 1？ 0？，由于交换能够使步数减少，01 和 10必然要先交换，交换之后如果只剩下01，那么剩下的不对应个数累加就直接是答案，否则再考虑？

题意：给一些在一排的蟑螂涂色或者两两交换位置，使最终的颜色交替出现，输出最小步数枚举两种r和b在开头位置的情况，取最小，推一下计算公式就出来了#include<cstring> #include<string> #include<iostream> #include<queue> #include<cstdio> #include<algorithm> #include<map> #include<