#640(Div.4)F. Binary String Reconstruction(找规律+构造)

最新推荐文章于 2021-01-22 12:24:31 发布

lwz_159

最新推荐文章于 2021-01-22 12:24:31 发布

阅读量476

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/li_wen_zhuo/article/details/106034644

版权

Codeforces 专栏收录该内容

119 篇文章 2 订阅

订阅专栏

题目描述

For some binary string s (i.e. each character si is either ‘0’ or ‘1’), all pairs of consecutive (adjacent) characters were written. In other words, all substrings of length 2 were written. For each pair (substring of length 2), the number of ‘1’ (ones) in it was calculated.
You are given three numbers:
n0 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 0;
n1 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 1;
n2 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 2.
For example, for the string s=“1110011110”, the following substrings would be written: “11”, “11”, “10”, “00”, “01”, “11”, “11”, “11”, “10”. Thus, n0=1, n1=3, n2=5.
Your task is to restore any suitable binary string s from the given values n0,n1,n2. It is guaranteed that at least one of the numbers n0,n1,n2 is greater than 0. Also, it is guaranteed that a solution exists.

Input

The first line contains an integer t (1≤t≤1000) — the number of test cases in the input. Then test cases follow.
Each test case consists of one line which contains three integers n0,n1,n2 (0≤n0,n1,n2≤100; n0+n1+n2>0). It is guaranteed that the answer for given n0,n1,n2 exists.

Output

Print t lines. Each of the lines should contain a binary string corresponding to a test case. If there are several possible solutions, print any of them.

Example

input
7
1 3 5
1 1 1
3 9 3
0 1 0
3 1 2
0 0 3
2 0 0
output
1110011110
0011
0110001100101011
10
0000111
1111
000

题目大意

构造含有n1个"00",n2个"01"或"10",n3个"11"的字符串。并要求该字符串最短。

题目分析

这个题就不分析（确实没啥好讲的），看看代码应该就能明白。
要让字符串最短，其实就是让相同的字符串在一块。这个题就只需要用"01"给"00"和"11"过渡一下就行了。

代码如下

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <vector>
#include <set> 
#include <algorithm>
#include <iomanip>
#define LL long long
using namespace std;
int const N=8e3+1;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		string s;
		int a,b,c;
		cin>>a>>b>>c;
		while(a--)       //把"00"全放在一块
		{
			if(s.empty()) s+="00";        //注意要特判s为空的情况
			else if(s[s.size()-1]=='0') s+="0";
			else s+="00";
		}
		if(!s.empty()&&b) s+="1",b--;    //用一个"01"过渡到"11"
		while(c--)     //把"11"全放在一起
		{
			if(s.empty()) s+="11";
			else if(s[s.size()-1]=='1') s+="1";
			else s+="11";
		}
		while(b--)     //最后直接把"01/10"放进去即可
		{
			if(s.empty()) s+="01";
			else if(s[s.size()-1]=='0') s+="1";
			else s+="0";
		}
		cout<<s<<endl;
	}
    return 0;
}