import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
package com.mademoisellegeek.googlecodejam.y2012.qualround;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;

public class DancingWithTheGooglers implements Runnable {

    BufferedReader in;
    BufferedWriter out;
    static String inputFile = "2012-qualround-B-large.in";
    static String outputFile = "2012-qualround-B-large.out";

    public void run() {

        try {
            in = new BufferedReader(new FileReader(inputFile));
            out = new BufferedWriter(new FileWriter(outputFile));
            try {
                String line = in.readLine();
                int nbCases = Integer.parseInt(line);
                for (int i=1; i<=nbCases; i++) {
                    line = in.readLine();
                    String [] lineArray = line.split(" ");
                    int nbDancers = Integer.parseInt(lineArray[0]);
                    int nbSurprises = Integer.parseInt(lineArray[1]);
                    int bestResultAtLeast = Integer.parseInt(lineArray[2]);
                    int[] dancerScores = new int[nbDancers];
                    for (int j=0; j<nbDancers; j++) {
                        dancerScores[j] = Integer.parseInt(lineArray[3+j]);
                    }
                    out.write("Case #" + i + ": " + solve(nbSurprises, bestResultAtLeast, dancerScores) + "\n");
                }
            } finally {
                in.close();
            }
            out.flush();
        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }

    //maximum number of Googlers who could have had a best result of greater than or equal to
    //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. 
    private int solve(int nbSurprises, int atLeast, int[] dancerScores) {
        int resultat = 0;
        int potSurpr = 0;
        for (int score:dancerScores) {
            int quotient = score/3;
            int reste = score%3;
            if (reste == 0) {
                //t-1 t   t+1 (*)     t+1 *
                //t   t   t           t
                if (quotient >= atLeast) {
                    resultat++;
                }
                else if (quotient == atLeast-1 && quotient >0) {
                    potSurpr++;
                }
            }
            else if (reste == 1) {
                //t-1 t+1 t+1 (*)     t+1 *
                //t   t   t+1         t+1
                if (quotient >= atLeast - 1) {
                    resultat++;
                }
            }
            else {
                //t   t   t+2 (*)     t+2 *
                //t   t+1 t+1         t+1
                if (quotient >= atLeast-1) {
                    resultat++;
                }
                else if (quotient == atLeast-2) {
                    potSurpr++;
                }
            }
        }
        resultat+=Math.min(nbSurprises,potSurpr);
        return resultat;
    }
}
