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 org.moriraaca.codejam.dancingwithgooglers;

import java.io.InputStream;

import org.moriraaca.codejam.GeneralDataParser;

public class DancingWithTheGooglersDataParser extends GeneralDataParser {

	public DancingWithTheGooglersDataParser(InputStream input) {
		super(input);
	}

	@Override
	protected void doParse() {
		for (int i = 0; i < testCases.length; i++) {
			DancingWithTheGooglersTestCase tc = new DancingWithTheGooglersTestCase();
			tc.scores = new int[scanner.nextInt()];
			tc.S = scanner.nextInt();
			tc.p = scanner.nextInt();
			for (int j = 0; j < tc.scores.length; j++) {
				tc.scores[j] = scanner.nextInt();
			}

			testCases[i] = tc;
		}
	}

}
