(CF)C. Team

最新推荐文章于 2024-05-02 08:15:00 发布

Modiz

最新推荐文章于 2024-05-02 08:15:00 发布

阅读量781

点赞数

分类专栏： CF、TC

本文链接：https://blog.csdn.net/modiz/article/details/21037959

版权

CF、TC 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

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.

        Sample test(s) 
      
          input 
        
1 2

          output 
        
101

          input 
        
4 8

          output 
        
110110110101

          input 
        
4 10

          output 
        
11011011011011

          input 
        
1 5

          output 
        
-1

题意：有n个零和m个一，把他们排成一排。规则如下：1不能有两个相邻的零，2不能有三个相邻的一。输出这样一个字符串。不行的话就输出1。

题解：假设零和一成立的话只有这两种情况：10，110 假设10为x个，110为y个。

则x=m-n.

y=2n-m.

接下来就有几种不同情况。当x<-1或者y<-2时肯定不成立的。

如果x==-1的话，就证明有一个零在第一个位置，接下来就是y-2个10了。

如果-2<=y<0的话，就会存在x+y个110和剩余的几个1。至于几个1就自己去想了，反正不会超过2，是滴啵。

接下来就是普通情况。有x个110，y个10了。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <list>
#include <vector>
using namespace std;
//#define DEBUG
int main()
{
#ifdef DEBUG
	freopen("cin.txt", "r", stdin);
	freopen("cout.txt", "w", stdout);
#endif
	int n,m,i;
	while (~scanf("%d%d",&n,&m))
	{
		int x=m-n;
		int y=2*n-m;
		if (y<-2 || x<-1) 
		{
			printf("-1\n");
			continue;
		}
		if (x==-1)
		{
			printf("0");
			for (i=1;i<=y-2;i++)
				printf("10");
			printf("\n");
			continue;
		}
		if (y<0)
		{
			for (i=1;i<=x+y;i++)
				printf("110");
			//n-=x+1;
			m=m-2*(x+y);
			for (i=1;i<=m;i++)
				printf("1");
			printf("\n");
			continue;
		}
		for (i=1;i<=x;i++)
			printf("110");
		for (i=1;i<=y;i++)
			printf("10");
		printf("\n");
	}
	return 0;
}