题目链接:http://codeforces.com/problemset/problem/401/C
题目大意:n个0,m个1,构造一个序列,不能出现“00”或者“111”。
题目分析:
0最多:010101010……,即n = m + 1;
0最少:11011……,即(n+1)*2 = m;
以上可以分析出输出“-1”的情况。
n = 5, m = 4: 010101010 -------> m 个“01“ +(n-m) 个“0”;①
n = 5, m = 5: 0101010101 ------> m 个“01” +(n-m) 个“0”;①
n = 5, m = 6: 110101010 -------->(m-n)个“110”+(2*n-m)个“10”②
n = 5, m = 7: 110110101010 ----> (m-n)个“110”+ (2*n-m) 个“10”②
n = 5, m = 8: 1101101101010 ---> (m-n)个“110”+ (2*n-m) 个“10”②
n = 5, m = 9: 11011011011010 --> (m-n)个“110”+ (2*n-m) 个“10”②
n = 5, m = 10:110110110110110 -> (m-n)个“110”+ (2*n-m) 个“10”②
n = 5, m = 11:1101101101101101 -> n 个“110”+ (m-2*n) 个“1”;③
n = 5, m = 12:1101101101101101 -> n 个“110”+ (m-2*n) 个“1”;③
以上可以分析出可以构造出序列的三种情况。
代码参考:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
int n, m, i;
while (~scanf("%d%d", &n, &m))
{
if (m < n - 1 || m > 2 * n + 2)
{
puts("-1");
continue;
}
if(n >= m)//①
{
for(i=0; i<m; ++i) printf("01");
for(i=0; i<n-m; ++i) printf("0");
}
else if(2*n >= m)//②
{
for(i=0; i<m-n; ++i) printf("110");
for(i=0; i<2*n-m; ++i) printf("10");
}
else//③
{
for(i=0; i<n; ++i) printf("110");
for(i=0; i<m-2*n; ++i) printf("1");
}
puts("");
}
return 0;
}