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 com.google.codejam.qualrnd.dncingglers;

import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class GooglersScoreboard {

	private int noOfGooglers;
	
	private int bestScore;
	
	private int noOfSurprisingScores;
	
	private List<Integer> scores;

	public GooglersScoreboard() {

	}

	public GooglersScoreboard(int noOfGooglers, int bestScore,
			int noOfSurprisingScores, List<Integer> scores) {
		this.noOfGooglers = noOfGooglers;
		this.bestScore = bestScore;
		this.noOfSurprisingScores = noOfSurprisingScores;
		this.scores = scores;
	}
	
	public int getNoOfGooglers() {
		return noOfGooglers;
	}

	public void setNoOfGooglers(int noOfGooglers) {
		this.noOfGooglers = noOfGooglers;
	}

	public int getBestScore() {
		return bestScore;
	}

	public void setBestScore(int bestScore) {
		this.bestScore = bestScore;
	}

	public int getNoOfSurprisingScores() {
		return noOfSurprisingScores;
	}

	public void setNoOfSurprisingScores(int noOfSurprisingScores) {
		this.noOfSurprisingScores = noOfSurprisingScores;
	}

	public List<Integer> getScores() {
		return scores;
	}

	public void setScores(List<Integer> scores) {
		Collections.sort(scores, new Comparator<Integer>() {
			@Override
			public int compare(Integer o1, Integer o2) {
				return o2 - o1;
			}
		});
		
//		Collections.sort(scores);
		this.scores = scores;
	}
	
}
