C. Team

Now it’s time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They’ve been best friends ever since primary school and hopefully, that can somehow help them in teamwork.

For each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:

• there wouldn’t be a pair of any side-adjacent cards with zeroes in a row;
• there wouldn’t be a group of three consecutive cards containing numbers one.

Today Vanya brought n cards with zeroes and m cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.Input

The first line contains two integers: n (1 ≤ n ≤ 106) — the number of cards containing number 0; m (1 ≤ m ≤ 106) — the number of cards containing number 1.Output

In a single line print the required sequence of zeroes and ones without any spaces. If such sequence is impossible to obtain, print -1.ExamplesinputCopy

1 2

outputCopy

101

inputCopy

4 8

outputCopy

110110110101

inputCopy

4 10

outputCopy

11011011011011

inputCopy

1 5

outputCopy

-1

---

题意：0不能有连续2个和3个，1不能有连续3个

思路：通过自己写样例可以发现有三四种情况，所以耐心讨论写。同时要注意有一个构造0数量>1数量的时候要先输出010再往后构造。不然会T

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5;
typedef long long LL;

int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,m;cin>>n>>m;
  if(m>=2*n+3||n-m>=2)
  {
  	cout<<-1<<endl;
  }
  else if(m==2*n+2)
  {
  	for(LL i=1;i<=n;i++)
  		cout<<110;
  	cout<<11<<endl;	
  }
  else if(m==2*n+1)
  {
  	 for(LL i=1;i<=n;i++)
  	 	cout<<110;
  	    cout<<1<<endl;	
  }
  else if(m>n)//1比0多 
  {
  	 while(m>n)
	   {
	   	 cout<<110;
		 m-=2,n-=1;	
	   } 
	  for(LL i=1;i<=n;i++)
	  	cout<<10;
	    cout<<endl;	  	 
  }
  else if(n==m)
  {
  		for(LL i=1;i<=n;i++)
  			cout<<10;
  		cout<<endl;	
  }
  else //0大于1
  {
  	while(n>m)
	  {
	  	 cout<<"010";//直接输出010第一个是8 
		 n-=2;m--;  	
	  }	
	 for(LL i=1;i<=n;i++)
	 	 cout<<10;
	 cout<<endl;	 
  } 
  	
return 0;
}