Binary String Reconstruction CodeForces - 1352F（思维+构造）

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
思路：0和2的情况我们可以直接构造出来，但是1的情况，就需要多考虑一下了。
①0和2都存在的情况。
②只有0存在的情况。
③只有2存在的情况。
④0和2都不存在的情况。
找规律分下奇偶，就可以了。具体看代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;int n0,n1,n2;int main()
{int t;scanf("%d",&t);while(t--){scanf("%d%d%d",&n0,&n1,&n2);string s0="",s1="",s2="";if(n0) s0+='0';if(n2) s2+='1';while(n0>0) s0+='0',n0--;while(n2>0) s2+='1',n2--;if(s0.size()&&s2.size()){if(n1&1) for(int i=1;i<=n1/2;i++) s1+="10";else{for(int i=1;i<n1/2;i++) s1+="10";s2+='0';}}else if(s0.size()){for(int i=1;i<=n1/2;i++) s1+="10";if(n1&1) s0='1'+s0;}else if(s2.size()){for(int i=1;i<=n1/2;i++) s1+="10";if(n1&1) s2=s2+'0';}else{for(int i=1;i<=(n1+1)/2;i++) s1+="10";if(n1%2==0) s1+='1';}cout<<s0<<s1<<s2<<endl;}return 0;
}

努力加油a啊，(^o)/~

Binary String Reconstruction CodeForces - 1352F（思维+构造）相关推荐

Binary String Minimizing CodeForces - 1256D（贪心）
You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1'). I ...
Codeforces Round #624 (Div. 3) E. Construct the Binary Tree 思维 + 构造
传送门文章目录题意: 思路: 题意: 给你n,dn,dn,d,让你构造有nnn个点的二叉树,他们每个节点深度和为ddd. n,d≤3000n,d\le 3000n,d≤3000. 思路: 先考虑不 ...
Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) C. String Reconstruction 并查集
C. String Reconstruction 题目连接: http://codeforces.com/contest/828/problem/C Description Ivan had stri ...
【2019牛客暑期多校训练营（第三场）- B】Crazy Binary String（思维，01串，前缀和）
题干: 链接:https://ac.nowcoder.com/acm/contest/883/B 来源:牛客网 ZYB loves binary strings (strings that only ...
中石油训练赛 - Edit Distance(思维+构造)
题目描述 A binary string is a non-empty sequence of 0's and 1's, e.g., 010110, 1, 11101, etc. The edit d ...
D1. Kirk and a Binary String (easy version)
题目链接:http://codeforces.com/contest/1204/problem/D1 D1. Kirk and a Binary String (easy version) time ...
题解 CF1399D 【Binary String To Subsequences】
题目链接:http://codeforces.com/contest/1399/problem/D 题目描述: You are given a binary string s consisting o ...
14. Juju and Binary String
题目链接:Juju and Binary String 感觉这题的思路和代码实现都比 E 题简单,不知道怎么评到的 2700 分. 给你一个长为 nnn 的 01 串,定义其 cuteness 为 1 ...
Juju and Binary String（前缀和）
Juju and Binary String [Link](Problem - F - Codeforces) 题意给你一个010101串strstrstr长度为nnn,这个串的权定为onesn(o ...

Binary String Reconstruction CodeForces - 1352F（思维+构造）

Binary String Reconstruction CodeForces - 1352F（思维+构造）相关推荐

最新文章

热门文章