Temporary cramming before DFS examination

subject

Topic link

It is suggested to use for Cycle through , I don't want to write now

Code

/*  Because you can think about two problems in the same subject at the same time , Suppose it's divided into left right Left and right brain   So for n questions , Yes 2^n Maybe ,  Generally, you can run in one second 4 * 10 ^ 8 Time   The maximum range of this question is 4* 2^20 =4*1048576  It can be searched directly   Think of the search of this topic as the search of a binary tree   The left subtree is the left brain , The right subtree is the right brain   And then it's normal dfs dfs  Medium x Is how many questions have been done ,y Is the total number of topics in the current subject , If x Than y big , That's a plan  */


#include<iostream>
#include<algorithm>

using namespace std;

const int N=30;
int hh[N][5];
int s[5];
int ans=0;
int l=0,r=0;
int mini; 


void dfs(int x,int y){
    
	// Recursive export  
	//dfs  Medium x Is how many questions have been done ,y Is the total number of topics in the current subject 
	// If x Than y big , That's a plan 
	// Now update the minimum , You should take the maximum time in your left and right brain , Then and current mini Take a small value  
	if(x>s[y]){
    
		mini=min(max(l,r),mini);
		return ;
	}
	l+=hh[x][y]; 
	dfs(x+1,y);// These two lines will cause all to be placed on the left brain  
	l-=hh[x][y];// Then go back  
	r+=hh[x][y];// Put it on the right brain  
	dfs(x+1,y);
	r-=hh[x][y];
}



int main(){
    
	cin>>s[1]>>s[2]>>s[3]>>s[4];
	for(int i=1;i<=4;i++){
    
		mini=19260816;
		l=r=0;
		for(int j=1;j<=s[i];j++)
			cin>>hh[j][i];
		dfs(1,i);
		ans+=mini;	
	}			
	cout<<ans;	
	return 0;
}