import static choco.Choco.*;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Stack;

import choco.cp.model.CPModel;
import choco.cp.solver.CPSolver;
import choco.kernel.model.Model;
import choco.kernel.solver.Solver;
import choco.kernel.model.constraints.Constraint;
import choco.kernel.model.variables.integer.IntegerVariable;
import choco.kernel.solver.ContradictionException;
import choco.kernel.solver.variables.integer.IntDomainVar;


public class Solve {
    
    private static Solver s;
    private static Scanner sc;
    private static Stack<int[]> history = new Stack<int[]>();
    private static int[] value;
    
	public static void main(String[] args) throws FileNotFoundException, ContradictionException {
	    
	    String commands = "\nMeeting scheduling problem\n" +
		"set (s), remove (r), undo (u), quit (q), help\n";   
	    
	    /* Code from Solve AE2 */
	    Model model = new CPModel();
		
		Scanner fileScanner = new Scanner(new FileInputStream(args[0]));
		
		int meetings = fileScanner.nextInt();
		int agents = fileScanner.nextInt();
		int timeslots = fileScanner.nextInt();
		
		IntegerVariable[] meeting  = makeIntVarArray("v",meetings,0,timeslots-1);
		
		value = new int[meetings];
		for (int i = 0; i<meetings; i++) value[i] = -1;
		 
		//read in attendance matrix
		int[][] attendance = new int[agents][meetings];
		for (int i=0; i<agents; i++) {
			fileScanner.next();
			for (int j=0; j<meetings; j++) {
				attendance[i][j] = Integer.parseInt(fileScanner.next());
			}
		}
		
		//read in distance matrix
		int[][] distance = new int[meetings][meetings];
		for (int i=0; i<meetings; i++) {
			fileScanner.next();
			for (int j=0; j<meetings; j++) {
				distance[i][j] = Integer.parseInt(fileScanner.next());
			}
		}
		fileScanner.close();
		
		/*add constraints: make sure each person is able to attend all their meetings
		 * 		For each agent
		 * 			get a list of all their meetings
		 * 			constrain meetings
		 * 				make sure each meeting either ends (+ travel time) before just as the others start
		 * 				OR each meeting starts after or as the others end (+ travel time)
		 */
		for (int[] agent : attendance) {
			ArrayList<Integer> attending = getMeetings(agent);
			if (attending.size() > 1) {
				for (int i=0; i<attending.size()-1; i++) {
					int first = attending.get(i);
					for (int j=i+1; j<attending.size(); j++) {
						
						int second = attending.get(j);
						int dist = distance[first][second];

						Constraint c1 = leq(plus(meeting[first], 1+dist), meeting[second]);
						Constraint c2 = geq(meeting[first], plus(meeting[second], 1+dist));
						model.addConstraint( or(c1,c2));
					}
				}
			}
		}
	    
   
	    
	    /* solver */
	    s = new CPSolver();
	    s.read(model);
	    
	    IntDomainVar[] meetingVars = s.getVar(meeting);
	    s.propagate();
	    for (int i=0;i<meetings;i++) System.out.println(meetingVars[i].pretty());
	    System.out.println();
	    s.worldPush();

	    System.out.println(commands);
	    sc = new Scanner(System.in);
	    System.out.print("> ");
	    String command = sc.next();
	    
	    while (!command.equals("quit") && !command.equals("q")){
		
	    	if (command.equals("set") || command.equals("s")) set(meetingVars);
	    	
	    	if (command.equals("remove") || command.equals("r")) remove(meetingVars);

	    	if (command.equals("undo") || command.equals("u"))  undo(meetingVars);

	    	if (command.equals("help")) System.out.println(commands);
	    	
		System.out.println();
		for (int i=0;i<meetings;i++) System.out.println(meetingVars[i].pretty());
		System.out.println();
	    System.out.print("> ");
	    command = sc.next();
	    }

	}
	
	private static void set(IntDomainVar[] v) throws ContradictionException {
	    System.out.print("var index > ");
	    int index = sc.nextInt();
	    System.out.print("value > ");
	    int val = sc.nextInt();
	    history.push(value.clone());
	    value[index] = val;
	    s.worldPop();
	    s.worldPush();
	    for (int i=0;i<v.length;i++) if (value[i] > 0) v[i].setVal(value[i]);
	    s.propagate();
	}
	
	private static void remove(IntDomainVar[] v) throws ContradictionException {
	    System.out.print("var index > ");
	    int index = sc.nextInt();
	    history.push(value.clone());
	    value[index] = -1;
	    s.worldPop();
	    s.worldPush();
	    for (int i=0;i<v.length;i++) if (value[i] > 0) v[i].setVal(value[i]);
	    s.propagate();
	}
	
	private static void undo(IntDomainVar[] v) throws ContradictionException {
	    value = history.pop();
	    s.worldPop();
	    s.worldPush();
	    for (int i=0;i<v.length;i++) if (value[i] > 0) v[i].setVal(value[i]);
	    s.propagate();
	}
	
	/*
	 * Method from Solve AE2
	 * Given an agents attendance row, return an array of meetings they attend
	 */
	private static ArrayList<Integer> getMeetings(int[] agent) {
		ArrayList<Integer> meetings = new ArrayList<Integer>();
		for (int i=0; i<agent.length; i++) {
			if (agent[i] == 1) {
				meetings.add(i);
			}
		}
		return meetings;
	}
}