import java.util.*;

public class MWCCol1 extends MWCCol0 {

    MWCCol1 (int n,int[][] A,int[] degree,int[] weight,int style) {
	super(n,A,degree,weight,style);
    }

    long colour(ArrayList<Integer> P){
	int m = P.size();
	for (int i=0;i<m;i++) colClass[i].clear();
	for (int v : P){
	    int k = 0;
	    while (conflicts(v,colClass[k])) k++;
	    colClass[k].add(v,weight[v]);
	}
	long totWeight = 0;
	for (int i=0;i<m;i=i+2)
	    totWeight = totWeight + pairWeight(colClass[i],colClass[i+1]);
	return totWeight;
    }

    long pairWeight(ColourClass c1, ColourClass c2){
	long max = 0;
	for (int v : c1.vertices)
	    for (int w : c2.vertices)
		if (A[v][w] == 1) max = Math.max(max,weight[v] + weight[w]);
	for (int v : c1.vertices) max = Math.max(max,weight[v]);
	for (int w : c2.vertices) max = Math.max(max,weight[w]);
	return max;
    }
    //
    // given two colour classes, the best that can be had from both is the heaviest adjacent
    // pair or the the heaviest in either colour class
    //

}