package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

package com.codegem.zaidansari;

import java.io.File;
import java.util.ArrayList;
import java.util.List;


class Score {

    int score1, score2, score3;
    int bestScore;
    boolean isSurprising;

    public Score(int score1, int score2, int score3) {
        super();
        this.score1 = score1;
        this.score2 = score2;
        this.score3 = score3;
        this.bestScore = Math.max(Math.max(score1, score2), score3);
        this.isSurprising = (Math.abs(score1 - score2) == 2) || (Math.abs(score1 - score3) == 2) || (Math.abs(score2 - score3) == 2);
    }

    public int getScore1() {
        return score1;
    }

    public void setScore1(int score1) {
        this.score1 = score1;
    }

    public int getScore2() {
        return score2;
    }

    public void setScore2(int score2) {
        this.score2 = score2;
    }

    public int getScore3() {
        return score3;
    }

    public void setScore3(int score3) {
        this.score3 = score3;
    }

    public int getBestScore() {
        return bestScore;
    }

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

    public boolean isSurprising() {
        return isSurprising;
    }

    public void setSurprising(boolean isSurprising) {
        this.isSurprising = isSurprising;
    }

    public static List<Score> getPossibleScoreCombinations(int totalScore) {
        List<Score> possibleScores = new ArrayList<Score>();
        if (totalScore == 0) {
            possibleScores.add(new Score(0, 0, 0));
            possibleScores.add(new Score(0, 0, 0));
            return possibleScores;
        }

        int mean = totalScore / 3;
        int remainder = totalScore % 3;
        switch (remainder) {
            case 0:
                possibleScores.add(new Score(mean, mean, mean));
                possibleScores.add(new Score(mean, mean - 1, mean + 1));
                break;
            case 1:
                possibleScores.add(new Score(mean, mean, mean + 1));
                possibleScores.add(new Score(mean - 1, mean + 1, mean + 1));
                break;
            case 2:
                possibleScores.add(new Score(mean, mean, mean + 2));
                possibleScores.add(new Score(mean, mean + 1, mean + 1));
                break;
        }
        return possibleScores;
    }
}

public class ProblemB {

    private int noofGooglers;
    private int surprisingCount;
    public static int bestResult;
    // private List<PersonScore> googlers = new ArrayList<PersonScore>();
    private BTree tree;
    public static List<Node> leafLevelNodes = new ArrayList<Node>();

    public ProblemB(int noofGooglers, int surprisingCount, int bestResult, int[] totalScores) {
        super();
        ProblemB.bestResult = bestResult;

        Node rootNode = new Node(new Score(0, 0, 0), totalScores, 0, 0);
        tree = new BTree(rootNode);
        this.noofGooglers = noofGooglers;
        this.surprisingCount = surprisingCount;

    }

    public static void main(String[] args) {
        File file = new File("/Users/zaansari/Desktop/CodeGem2012/InputFiles/ProblemB-Small.txt");
        // File file = new File("/Users/zaansari/Desktop/CodeGem2012/InputFiles/ProblemB-Large.txt");
        List<String> inputData = CodeGemUtil.getInputValues(file);
        int noOfInputs = Integer.parseInt(inputData.get(0));
        inputData.remove(0);

        List<String> outputData = new ArrayList<String>();
        for (int index = 0; index < noOfInputs; index++) {
            String line = inputData.get(index);
            String[] inputValues = line.split(" ");
            int noofGooglers = Integer.parseInt(inputValues[0]);
            int surprisingCount = Integer.parseInt(inputValues[1]);
            int bestResult = Integer.parseInt(inputValues[2]);
            ProblemB.bestResult = bestResult;
            int[] totalScores = new int[noofGooglers];

            for (int _index = 0; _index < noofGooglers; _index++) {
                totalScores[_index] = Integer.parseInt(inputValues[3 + _index]);
            }
            ProblemB problemB = new ProblemB(noofGooglers, surprisingCount, bestResult, totalScores);
            int result = -1;
            for (Node node : ProblemB.leafLevelNodes) {
                if (node.getParentNodesSuprisingCount() == surprisingCount) {
                    result = Math.max(result, node.getParentBestMatchCount());
                }
            }
            outputData.add("" + result);
            ProblemB.leafLevelNodes.clear();
        }

        boolean createdOutputFile = CodeGemUtil.createOutputFile(outputData, "ProblemB-Small-Output.txt");
        // boolean createdOutputFile = CodeGemUtil.createOutputFile(outputData, "ProblemB-Large-Output.txt");
        if (createdOutputFile) {
            System.out.println("Successfully created output file");
        } else {
            System.out.println("Failed to create output file");
        }

        //
        // String inputLine = "2 0 3 25 24";
        // String[] inputValues = inputLine.split(" ");
        // int noofGooglers = Integer.parseInt(inputValues[0]);
        // int surprisingCount = Integer.parseInt(inputValues[1]);
        // int bestResult = Integer.parseInt(inputValues[2]);
        // int[] totalScores = new int[noofGooglers];
        //
        // for (int index = 0; index < noofGooglers; index++) {
        // totalScores[index] = Integer.parseInt(inputValues[3 + index]);
        // }
        // ProblemB problemB = new ProblemB(noofGooglers, surprisingCount, bestResult, totalScores);
        // int result = -1;
        // for (Node node : ProblemB.leafLevelNodes) {
        // if (node.getParentNodesSuprisingCount() == surprisingCount) {
        // result = Math.max(result, node.getParentBestMatchCount());
        // }
        // }
        // System.out.println(result);

    }
}

class BTree {

    private Node rootNode;

    public BTree(Node rootNode) {
        super();
        this.rootNode = rootNode;
    }

    public Node getRootNode() {
        return rootNode;
    }

    public void setRootNode(Node rootNode) {
        this.rootNode = rootNode;
    }
}

class Node {

    private int parentNodesSuprisingCount;
    private int parentBestMatchCount;
    private Score score;
    private Node leftNode;
    private Node rightNode;

    public Node(Score score, int[] scores, int parentNodesSuprisingCount, int parentBestMatchCount) {
        this.parentNodesSuprisingCount = parentNodesSuprisingCount;
        this.parentBestMatchCount = parentBestMatchCount;
        this.score = score;
        int[] childNodeScores = null;
        if (scores != null && scores.length > 0) {
            childNodeScores = new int[scores.length - 1];
            for (int index = 1; index < scores.length; index++) {
                childNodeScores[index - 1] = scores[index];
            }
        }
        List<Score> scoresList = null;
        if (scores != null && scores.length > 0) scoresList = Score.getPossibleScoreCombinations(scores[0]);
        if (score != null) {

            this.setLeftNode(new Node((scoresList != null ? scoresList.get(0) : null), childNodeScores, parentNodesSuprisingCount
                    + (scoresList != null && scoresList.get(0) != null && scoresList.get(0).isSurprising ? 1 : 0), parentBestMatchCount
                    + (scoresList != null && scoresList.get(0) != null && scoresList.get(0).getBestScore() >= ProblemB.bestResult ? 1 : 0)));
            this.setRightNode(new Node((scoresList != null ? scoresList.get(1) : null), childNodeScores, parentNodesSuprisingCount
                    + (scoresList != null && scoresList.get(1) != null && scoresList.get(1).isSurprising ? 1 : 0), parentBestMatchCount
                    + (scoresList != null && scoresList.get(1) != null && scoresList.get(1).getBestScore() >= ProblemB.bestResult ? 1 : 0)));
            if (childNodeScores != null && childNodeScores.length == 0) {
                ProblemB.leafLevelNodes.add(this.leftNode);
                ProblemB.leafLevelNodes.add(this.rightNode);
            }
        }
    }

    public int getParentNodesSuprisingCount() {
        return parentNodesSuprisingCount;
    }


    public void setParentNodesSuprisingCount(int parentNodesSuprisingCount) {
        this.parentNodesSuprisingCount = parentNodesSuprisingCount;
    }


    public int getParentBestMatchCount() {
        return parentBestMatchCount;
    }


    public void setParentBestMatchCount(int parentBestMatchCount) {
        this.parentBestMatchCount = parentBestMatchCount;
    }


    public Score getScore() {
        return score;
    }

    public void setScore(Score score) {
        this.score = score;
    }

    public Node getLeftNode() {
        return leftNode;
    }

    public void setLeftNode(Node leftNode) {
        this.leftNode = leftNode;
    }

    public Node getRightNode() {
        return rightNode;
    }

    public void setRightNode(Node rightNode) {
        this.rightNode = rightNode;
    }
}
