POJ 2531, Network Saboteur

Time Limit: 2000MS  Memory Limit: 65536K
Total Submissions: 3311  Accepted: 1346

Description
A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts.
A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks.
Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him.
The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).

 

Input
The first line of input contains a number of nodes N (2 <= N <= 20). The following N lines, containing N space-separated integers each, represent the traffic matrix C (0 <= Cij <= 10000).
Output file must contain a single integer -- the maximum traffic between the subnetworks.

 

Output
Output must contain a single integer -- the maximum traffic between the subnetworks.

 

Sample Input
3
0 50 30
50 0 40
30 40 0

 

Sample Output
90

 

Source
Northeastern Europe 2002, Far-Eastern Subregion

---

//  POJ2531.cpp : Defines the entry point for the console application.
//

#include  < iostream >
using   namespace  std;

int  main( int  argc,  char *  argv[])
{
     int  N;
    cin  >>  N;

     int  d[ 21 ][ 21 ];
     for  ( int  i  =   0 ; i  <  N;  ++ i)
         for  ( int  j  =   0 ; j  <  N;  ++ j)
            scanf( " %d " ,  & d[i][j]);

     int   set [ 21 ];
    memset( set ,  0 ,  sizeof ( set ));

     int  MAX  = 1   << (N  -   1 );
     int  maxflow  =   0 ;
     for  ( int  i  =   0 ; i  <  MAX;  ++ i)
    {
         // set combination
         ++ set [ 0 ];
         for  ( int  j  =   0 ; j  <  N;  ++ j)
             if  ( set [j]  ==   2 ){  set [j]  =   0 ;  ++ set [j  +   1 ];}
             else   break ;

         int  cnt  =   0 ;
         for  ( int  j  =   0 ; j  <  N;  ++ j)
        {
             if  ( set [j]  ==   0 ) continue ;
             for  ( int  k  =   0 ; k  <  N;  ++ k)
                 if  ( set [k]  ==   0 )cnt  +=  d[j][k];
        }

         if  (cnt  >  maxflow) maxflow  =  cnt;
    }

    cout  <<  maxflow  <<  endl;
     return   0 ;
}