Network saboteur
Time Limit: 2000MS |
|
Memory Limit: 65536K |
Total Submissions: 9435 |
|
Accepted: 4458 |
Description
A University Network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into and the subnet Works in order to minimize traffic between parts.
A disgruntled computer science student Vasya, after being expelled from the university, decided to has his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between.
Unfortunately, he found, calculating such worst subdivision is one of the those problems he, being a student, failed to so Lve. So he asks-a more successful CS student, to-help him.
The traffic data is given in the form of Matrix C, where Cij is the amount of data sent between and ith jth (nodes = Cji, Cii = 0). The goal is to divide the network nodes into the and the 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
30 50 3050 0 4030 40 0
Sample Output
90
Test instructions: Given the n points and the weights between them Cij, now to divide n points into two parts, ∑CIJ (i∈a,j∈b) the largest
Idea: Dfs Mob search
It's not pruning. Ran a 219MS sad
#include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include < string> #include <cctype> #include <vector> #include <cstdio> #include <cmath> #include < queue> #include <stack> #include <map> #include <set> #define LL long long#define MAXN 360#define pp pair<int,int> #define INF 0x3f3f3f3f#define max (x x > (y))? (x): (y)) #define min (x, y) ((() > (y))? (y): (x)) using namespace Std;int ma[23][23],n,ans;bool vis[23];void dfs (int x,int num,int sum) {if (num>n/2+1) return; I NT T=0;ans=max (Ans,sum), for (int i=x+1;i<=n;i++) {if (!vis[i]) {vis[i]=1;int tem=sum;for (int j=1;j<=n;j++) if (Vis [j]) TEM-=MA[I][J];ELSETEM+=MA[I][J];d FS (i,num+1,tem); vis[i]=0;}} int main () {while (scanf ("%d", &n)!=eof) {for (Int. i=1;i<=n;i++) for (int j=1;j<=n;j++) scanf ("%d", &ma[i ][J]); memset (vis,0,sizeof (Vis)); Ans=-inf;dfs (0,0,0);p rintf ("%d\n", ans); } return 0;}
POJ 2531-network saboteur (DFS)