当前位置:网站首页>Codeforces Round #715 (Div. 2) D. Binary Literature
Codeforces Round #715 (Div. 2) D. Binary Literature
2022-07-05 05:27:00 【solemntee】
Because we know that there must be two strings in three strings 0 The number is greater than or less than n individual .
So we just choose two such strings , Let's see what's inside 0 perhaps 1 Become their common subsequence .
Just happy ac 了 , This is too water
#include<bits/stdc++.h>
#define ll long long
using namespace std;
char s[4][200005];
bool visa[200005],visb[200005];
int n,cnt[4];
int judge(int a,int b)
{
// printf("%d %d %d %d %d\n",a,b,cnt[a],cnt[b],n);
if(cnt[a]>=n&&cnt[b]>=n)return 1;
else if(cnt[a]<=n&&cnt[b]<=n)return 2;
else return 0;
}
void print(int a,int b,int w)
{
// printf("%d %d %d\n",a,b,w);
char c;
if(w==1)c='0';
else c='1';
int pa=1,pb=1;
while(pa<=2*n||pb<=2*n)
{
if(s[a][pa]==c&&s[b][pb]==c&&pa<=2*n&&pb<=2*n)
{
printf("%c",c);
pa++,pb++;
}
else if(s[a][pa]!=c&&pa<=2*n)
{
printf("%c",s[a][pa]);
pa++;
}
else if(s[b][pb]!=c&&pb<=2*n)
{
printf("%c",s[b][pb]);
pb++;
}
else if(s[b][pb]==c&&pa>2*n)
{
printf("%c",c);
pb++;
}
else if(s[a][pa]==c&&pb>2*n)
{
printf("%c",c);
pa++;
}
}
printf("\n");
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=3;i++)scanf("%s",s[i]+1);
for(int i=1;i<=3;i++)
{
cnt[i]=0;
for(int j=1;j<=2*n;j++)
{
if(s[i][j]=='0')cnt[i]++;
}
// cout<<cnt[i]<<endl;
}
for(int i=1;i<=3;i++)
for(int j=1;j<=3;j++)
{
if(i==j)continue;
if(judge(i,j))
{
print(i,j,judge(i,j));
goto endd;
}
}
endd:;
}
return 0;
}
边栏推荐
- Double pointer Foundation
- The present is a gift from heaven -- a film review of the journey of the soul
- Using HashMap to realize simple cache
- Software test -- 0 sequence
- Introduction to tools in TF-A
- 二十六、文件系统API(设备在应用间的共享;目录和文件API)
- [转]MySQL操作实战(三):表联结
- Solon Logging 插件的添加器级别控制和日志器的级别控制
- Summary of Haut OJ 2021 freshman week
- 剑指 Offer 53 - II. 0~n-1中缺失的数字
猜你喜欢
随机推荐
[binary search] 34 Find the first and last positions of elements in a sorted array
Haut OJ 1221: a tired day
sync. Interpretation of mutex source code
sync.Mutex源码解读
Haut OJ 1357: lunch question (I) -- high precision multiplication
Zheng Qing 21 ACM is fun. (3) part of the problem solution and summary
Under the national teacher qualification certificate in the first half of 2022
[allocation problem] 135 Distribute candy
MySQL数据库(一)
[to be continued] [UE4 notes] L3 import resources and project migration
YOLOv5添加注意力机制
YOLOv5-Shufflenetv2
注解与反射
lxml.etree.XMLSyntaxError: Opening and ending tag mismatch: meta line 6 and head, line 8, column 8
第六章 数据流建模—课后习题
Merge sort
Use of room database
[转]:Apache Felix Framework配置属性
SSH password free login settings and use scripts to SSH login and execute instructions
[speed pointer] 142 circular linked list II








