Ideone.com

fork download

copy

#include<bits/stdc++.h>
using namespace std;
int dp[11][11][11][11];
int solve(int pos,int l1,int l2,int l3)
{
	if(pos==-1 && l1==0 && l2==0 && l3==0) return 0;
	else if(pos==-1){
		return INT_MIN;
	}
	if(dp[pos][l1][l2][l3]!=-1) return dp[pos][l1][l2][l3];
	int p1=0,p2=0,p3=0,p4=0,p5=0,p6=0,p7=0,p8=0;
	if(l1>0){
		p1=((1<<pos)+solve(pos-1,l1-1,l2,l3));
	}
	if(l2>0){
		p2=((1<<pos)+solve(pos-1,l1,l2-1,l3));
	}
	if(l3>0){
		p3=((1<<pos)+solve(pos-1,l1,l2,l3-1));
	}
	if(l1>0&&l2>0){
		p4=(solve(pos-1,l1-1,l2-1,l3));
	}
	if(l3>0&&l2>0){
		p6=(solve(pos-1,l1,l2-1,l3-1));
	}
	if(l1>0&&l3>0){
		p7=(solve(pos-1,l1-1,l2,l3-1));
	}
	if(l1>0&&l2>0&&l3>0){
		p8=((1<<pos)+solve(pos-1,l1-1,l2-1,l3-1));
	}
	return dp[pos][l1][l2][l3]=max({p1,p2,p3,p4,p5,p6,p7,p8});
 
}
int main()
{
	int tc;
	cin>>tc;
	while(tc--)
	{
		memset(dp,-1,sizeof dp);
		int l1,l2,l3;
		string s1,s2,s3;
		cin>>s1>>s2>>s3;
		l1=l2=l3=0;
		for(int i=0;i<10;i++)
		{
			l1+=(s1[i]=='1');
			l2+=(s2[i]=='1');
			l3+=(s3[i]=='1');
		}
		int num=solve(9,l1,l2,l3);
		for(int i=9;i>=0;i--)
		{
			if(num&(1<<i))
			cout<<1;
			else cout<<0;
		}
		cout<<endl;
	}
}

Runtime error #stdin #stdout 0.02s 4516KB

stdin

copy

Standard input is empty

stdout

copy

https://ideone.com/r9AYDv

language:

C++ (gcc 8.3)

created:

visibility:

public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language