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 org.cb.projectb.dancingwiththegooglers;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Contest {
	
	public static void main(String[] args) throws FileNotFoundException {
		File input = new File(System.getProperty("user.dir") + "/" + "resources/projectB/B-small-attempt0.in");
		Scanner sc = new Scanner(input);

		List<DanceOff> contests = new ArrayList<DanceOff>();
		
		if (sc.hasNext()) {
			Integer.parseInt(sc.nextLine()); // number of cases - ignored
			while (sc.hasNext()) {
				String contestString = sc.nextLine();
				
				StringTokenizer contestTokenizer = new StringTokenizer(contestString);
				
				int contestants = Integer.parseInt(contestTokenizer.nextToken());
				int surprisingTriplets = Integer.parseInt(contestTokenizer.nextToken());
				int scoreWeCareAbout = Integer.parseInt(contestTokenizer.nextToken());
				List<Integer> scores = new ArrayList<Integer>();
				for(int i = 0; i < contestants; i ++) {
					scores.add(Integer.parseInt(contestTokenizer.nextToken()));
				}
				
				contests.add(new DanceOff(contestants, surprisingTriplets, scoreWeCareAbout, scores));
			}
		}
		
		for(int i = 1; i <= contests.size(); i ++) {
			DanceOff danceoff = contests.get(i-1);

			System.out.println("Case #" + i + ": " + danceoff.getNumberAllowedToBeImportant());
		}
	}
	
	private static class DanceOff {
		private final int contestants;
		private final int surprisingTriplets;
		private final int scoreWeCareAbout;
		private final List<Integer> contestantScores;
		private final int numberAllowedToBeImportant;
		
		public DanceOff(int contestants, int surprisingTriplets, int scoreWeCareAbout, List<Integer> contestantScores) {
			this.contestants = contestants;
			this.surprisingTriplets = surprisingTriplets;
			this.scoreWeCareAbout = scoreWeCareAbout;
			this.contestantScores = contestantScores;
			
			this.numberAllowedToBeImportant = fillInDetails();
		}

		private int fillInDetails() {
			int importantScores = 0;
			
			List<Integer[]> allProbableScores = new ArrayList<Integer[]>();
			
			for(Integer score: contestantScores) {
//				System.out.print(score + " - ");
				
				int baseScore = score / 3;
				int remaining = score % 3;
				Integer[] scoresArray = new Integer[]{baseScore, baseScore, baseScore};
				
				for(int i = 0; i < remaining; i++) {
					scoresArray[i] = scoresArray[i] + 1;
				}
				
//				System.out.print("Probable tripplet: [");
//				for(int i = 0; i < scoresArray.length; i++) {
//					System.out.print(scoresArray[i] + " ");
//				}
//				System.out.println("]");
				
				allProbableScores.add(scoresArray);
			}
			
			
			int freebeeImportantScores = 0;
			int ableToBeImportantIfSurprising = 0;
			for (Integer[] scoresList : allProbableScores) {
				// count how many in scores array are already important
				boolean isImportant = false;
				boolean canBeSurprising = false;
				
				for (Integer integer : scoresList) {
					if(integer >= this.scoreWeCareAbout) {
						isImportant = true;
						break;
					}
				}
				if(isImportant) {
					freebeeImportantScores++;
				} else {
					// see how many i can make 'surprising' to then care about
					if(scoresList[0] + 1 >= this.scoreWeCareAbout) {
						if(scoresList[0] == scoresList[1] && scoresList[0] != 0) {
							canBeSurprising = true;
						}
					}
					if(canBeSurprising) {
						ableToBeImportantIfSurprising++;
					}
				}
			}
			

			
			// take min of allowed surprising & how many could be surprised
			int numToMakeSpecial = Math.min(ableToBeImportantIfSurprising, this.surprisingTriplets);
			
			// add min to current important scores
			importantScores = freebeeImportantScores + numToMakeSpecial;
			
//			System.out.println("Freebee important: " + freebeeImportantScores);
//			System.out.println("Can be Made Important with surprising Score: " + ableToBeImportantIfSurprising);
//			System.out.println("Num Of Scores we are making surprising: " + numToMakeSpecial);
//			System.out.println("Max Special Scores: " + importantScores);
//			System.out.println();
			
			return importantScores;
		}
		
		public int getNumberAllowedToBeImportant() {
			return numberAllowedToBeImportant;
		}

		@Override
		public String toString() {
			return "DanceOff [contestants = " + contestants
					+ ", surprisingTriplets = " + surprisingTriplets
					+ ", scoreWeCareAbout = " + scoreWeCareAbout
					+ ", contestantScores = " + contestantScores + "]";
		}
	}

}
