Bullseye Solution: Google codejam 2013 Round 1A

Most of us are familiar with google codejam, those who don’t visit https://code.google.com/codejam for more information. This is the first problem from Online Round 1A 2013, top 1000 from this round will be eligible for next online round.

Problem

Maria has been hired by the Ghastly Chemicals Junkies (GCJ) company to help them manufacture bullseyes. A bullseye consists of a number of concentric rings (rings that are centered at the same point), and it usually represents an archery target. GCJ is interested in manufacturing black-and-white bullseyes.

Maria starts with t millilitres of black paint, which she will use to draw rings of thickness 1cm (one centimetre). A ring of thickness 1cm is the space between two concentric circles whose radii differ by 1cm.

Maria draws the first black ring around a white circle of radius r cm. Then she repeats the following process for as long as she has enough paint to do so:

1. Maria imagines a white ring of thickness 1cm around the last black ring.
2. Then she draws a new black ring of thickness 1cm around that white ring.

Note that each “white ring” is simply the space between two black rings.

The area of a disk with radius 1cm is π cm². One millilitre of paint is required to cover area π cm². What is the maximum number of black rings that Maria can draw? Please note that:

• Maria only draws complete rings. If the remaining paint is not enough to draw a complete black ring, she stops painting immediately.
• There will always be enough paint to draw at least one black ring.

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of a line containing two space separated integers: r and t.

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 black rings that Maria can draw.

Limits

Small dataset

1 ≤ T ≤ 1000.
1 ≤ r, t ≤ 1000.

Large dataset

1 ≤ T ≤ 6000.
1 ≤ r ≤ 10¹⁸.
1 ≤ t ≤ 2 × 10¹⁸.

Sample

Solution with Java Code and Explanation

First we will calculate the area of the first black circle = π(r+1)^² – πr^² = π(2r+1);
Similarly area of the second black circle = π(r+1+2)^² – π(r+1+1)^² = π(2r+5);
Similarly area of the third black circle = π(r+1+4)^² – π(r+1+3)^² = π(2r+9);
This will form an AP with T_n = π((2r+1)+ (n-1)*4);
Sum of this AP S_n= n(a1 + an)/2 = nπ(2r+1 + 2r +1 + 4n -4)/2 = nπ(4r + 2 + 4n -4)/2 = π(2rn + 2n^² -n)
We need to solve this sum for t => 2n^² + n(2r-1) -t = 0
We can use quadratic solution for any ax^² + bx +c = 0 = (-b +/- sqrt(b^² – 4ac))/2, we can reject – options as it will become negative.
here a = 2, b = 2r -1 and c = -t

NOTE:- for writing the java code we have to use biginteger as the rang is too high and main problem you might face is to calculate square root of biginteger in java, this sample code below includes how you can calculate square root of biginteger in java.

Here is the Java code for Bullseye problem in Google codejam Online Round 1A 2013

package googlecodejam2013;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.Reader;
import java.math.BigInteger;

public class Bullseye {

	private static final BigInteger TWO = BigInteger.valueOf(2);

	private static boolean isSqrt(BigInteger n, BigInteger root)
	{
	    final BigInteger lowerBound = root.pow(2);
	    final BigInteger upperBound = root.add(BigInteger.ONE).pow(2);
	    return lowerBound.compareTo(n) <= 0
	        && n.compareTo(upperBound) < 0; 	} 	 	public static BigInteger sqrt(BigInteger n) 	{ 	    if (n.signum() >= 0)
	    {
	        final int bitLength = n.bitLength();
	        BigInteger root = BigInteger.ONE.shiftLeft(bitLength / 2);

	        while (!isSqrt(n, root))
	        {
	            root = root.add(n.divide(root)).divide(TWO);
	        }
	        return root;
	    }
	    else
	    {
	        throw new ArithmeticException("square root of negative number");
	    }
	}

	public static String getCircleCount(BigInteger r, BigInteger t){
		BigInteger b = r.multiply(new BigInteger("2")).subtract(new BigInteger("1"));
		BigInteger a = new BigInteger("2");
		BigInteger ans = b.multiply(b).add(t.multiply(new BigInteger("8")));
		ans = sqrt(ans).subtract(b).divide(new BigInteger("4"));
		return ans.toString();
	}

	public static void main(String[] argv) {
		try {
			long startTime = System.currentTimeMillis();
			Reader reader = new FileReader("sample.in");
			BufferedReader bufReader = new BufferedReader(reader);
			String x = bufReader.readLine();
			int numOfTestCases = Integer.parseInt(x);
			int count = 0;

			File file = new File("sample.out");
			FileWriter writer = new FileWriter(file);
			for(count =1; count<= numOfTestCases; count++) {
				String line = bufReader.readLine();
				BigInteger r = new BigInteger(line.substring(0, line.indexOf(" ")));
				BigInteger t = new BigInteger(line.substring( line.indexOf(" ")+1));
				String output = getCircleCount(r, t);
				writer.write("Case #" + count + ": " + output+"\n");
				System.out.println("Case #" + count + ": " + output);
			}
			writer.close();
			System.out.println("Total time = " + (System.currentTimeMillis() - startTime));
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}

Facebook Comments