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;
    }
}

import java.util.LinkedList;


public class Triplet 
{
	public Triplet()
	{
		
	}
	
	public static int triplete(LinkedList<Integer> t_i, int p, int s)
	{
		int res = 0;
		int a,b,c;		
		
		for(Integer i : t_i)
		{
			a = p; b = p-1; c = p-2;
			if(a+b+c < i)
			{
				c++;
			}
			if(a+b+c < i)
			{
				b++;
			}
			if(a+b+c < i)
			{
				c++;
			}
			if(a+b+c > i)
			{
				b--;
			}
			while(a+b+c < i)
			{
				if(a+b+c < i)
				{
					b++;
				}
				if(a+b+c < i)
				{
					c++;
				}
				if(a+b+c < i)
				{
					a++;
				}
			}
			
			int prue = a + b + c;						
			if(a >= 0 && b >= 0 && c >= 0)
			{
				if(prue == i && a <= 10 && b <= 10 && c <= 10 && (a - b != 2 && a - c != 2 && b - c != 2))
				{
					res++;
					
				}
				else if(prue == i &&(a - b == 2 || a - c == 2 || b - c == 2) && s > 0)
				{
					res++;
					s--;
				}
			}
			
			
		}
		
		return res;
	}
}
