package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

package br.com.atama.google.jam.dancing;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Show {

	private List<TripletScore> scores = new ArrayList<TripletScore>();

	public Show(int[] totalScores) {
		for (int total : totalScores)
			scores.add(new TripletScore(total));
	}

	public int getNumSurprises() {
		int count = 0;
		for (TripletScore score : scores)
			if (score.isSurprise())
				count++;
		return count;
	}

	public void addSurprises(int n) {
		if (n == 0)
			return;

		int count = 0;
		Collections.sort(scores);
		Collections.reverse(scores);

		for (TripletScore score : scores) {
			if (!score.isSurprise() && !score.isZero()) {
				score.setSurprise(true);

				if (++count >= n)
					break;
			}
		}

		if (count < n)
			throw new RuntimeException();
	}

	public int getTotalGoodScores() {
		int sum = 0;
		for (TripletScore score : scores)
			sum += score.getNumGoodScore() > 0 ? 1 : 0;

		return sum;
	}

}
