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 main;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class TestClass {

	public static void main (String[] args) throws IOException, InterruptedException {
		BufferedReader reader = new BufferedReader(new FileReader("C:\\in.txt"));
		BufferedWriter writer = new BufferedWriter(new FileWriter("C:\\out.txt"));
		MyTest myTest = new MyTest();
		myTest.getTranslation();

		int caseNum = Integer.parseInt(reader.readLine());
		for(int i=0; i<caseNum; i++) {
			String line = reader.readLine();
			String[] numbers = line.split(" ");
			List<Integer> points = new ArrayList<Integer>();

			int N = Integer.parseInt(numbers[0]);
			int S = Integer.parseInt(numbers[1]);
			int p = Integer.parseInt(numbers[2]);

			for(int j=0; j<N; j++) {
				points.add(Integer.parseInt(numbers[3+j]));
			}

			writer.write("Case #" + (i+1) + ": " + myTest.getNumOfGoogler(S, p, points) + "\n");
			points.clear();

			writer.flush();
		}
	}
}
