Tontti

import java.util.Random;

/**
 * Created by Frans on 5.10.2015.
 */
public class Tontti{

    static int height;
    static int width;
    static int[][] kenttaSumma;
    static int wantedTrees;

    static int lastSize;
    static double multiplier;

    static long runAmountB;
    static long runAmountBU;
    static long runAmountBD;
    static long runAmountL;
    static long runAmountL2;

    static final int testInt = 100000*1;
    //static int seed = 1606; //(int) (Math.random()*10000);

    static int did = 0;

    public static void main(String[] args){

        IO io = new IO();

        int foundArea = 0;
        int minSize = (int) (Math.sqrt(wantedTrees) + 0.99);
        multiplier = 0;

        int trees = 0;

        /*//todo
        long aika = System.nanoTime();

        int futureWidth = 15;
        int futureHeight = 15;
        int futureWantedTrees = (int) (4 + 0 * Math.pow(10, 1));
        height = futureHeight;
        width = futureWidth;
        wantedTrees = futureWantedTrees;

        kenttaSumma = new int[width + 1][height + 1];
        kentta = new int[width + 1][height + 1];
        Random generator = new Random(seed);

        String[] lines = new String[height + 1];
        for (int y = 1; y <= height; y++) {
            lines[y] = "";
            for (int x2 = 1; x2 <= width; x2++) {
                if (generator.nextDouble() > 0.2) {
                    lines[y] = lines[y] + ".";
                } else {
                    lines[y] = lines[y] + "*";
                }
            }
        }
        kenttaSumma = new int[width + 1][height + 1];
        */

        height = io.nextInt();
        width = io.nextInt();
        wantedTrees = io.nextInt();
        kenttaSumma = new int[width+1][height+1];

        mainLoop:
        {
            //calculate trees and save it in to array and summed area table
            for (int y = 1; y <= height; y++) {
                final char[] line = io.next().toCharArray();
                //final char[] line = lines[y].toCharArray();

                int sumRow = 0;
                for (int x = 1; x <= width; x++) {
                    if (line[x - 1] == '*') {
                        sumRow++;
                        trees++;
                    }
                    kenttaSumma[x][y] = sumRow + kenttaSumma[x][y - 1];
                    int maxSize = min(x, y);

                    if (maxSize >= minSize) {
                        foundArea += countAreasS(maxSize, minSize, x, y);
                    }
                }

                lastSize = minSize;
            }
        }

        io.println(foundArea);

        /*
        aika = (System.nanoTime()-aika)/1000000;
        io.println("---");
        io.println("Time: " + aika);
        io.println("Loops Binary: " + runAmountB/1000000.0);
        io.println("   -high: " + runAmountBU/1000000.0);
        io.println("   -low: " + runAmountBD/1000000.0);
        io.println("Loops Linear: " + runAmountL/1000000.0);
        io.println("Loops Linear: " + runAmountL2/1000000.0);
        io.println(multiplier);
        io.println(did);
        */

        io.close();
    }

    //rekursiivinen binaarihaku
    // x2 = x -1
    // y2 = y -1
    private static int countAreasB(int maxSize,int minSize, int x, int y, int prevSize, double weight){
        int areasFound = 0;
        int tSize = (int) (((maxSize*(1.0+weight) + minSize*(1.0-weight))/2.0));

        if (tSize == prevSize){
            tSize = (int) (((maxSize + minSize)/2.0));
        }

        //lopetaan kun sama on jo katsottu
        if (prevSize != tSize){
            prevSize = tSize;

            runAmountB ++;
            int sum = kenttaSumma[x][y]+kenttaSumma[x-tSize][y-tSize]-kenttaSumma[x][y-tSize]-kenttaSumma[x-tSize][y];

            if(sum > wantedTrees){
                runAmountBU ++;
                //tSize = (int) (Math.sqrt(tSize*tSize-(sum-wantedTrees))+0.999); //pitkalle johdettu matemaattinen optimointi
                multiplier = max(multiplier - 0.1, -0.95);
                areasFound += countAreasB(tSize, minSize, x, y, prevSize,multiplier);
            }else if (sum < wantedTrees){
                runAmountBD ++;
                tSize = (maxSize - tSize == 1)?maxSize+1:tSize; //estetaan pyoristysvirhe

                multiplier = min(multiplier+0.1,0.95);
                areasFound += countAreasB(maxSize, tSize, x, y, prevSize,multiplier);
            }else {
                //molemmat suunnat ovat mahdollisia --> kokeillaan kaikki lahella olevat
                areasFound ++;
                if (wantedTrees > testInt) {
                    areasFound += countAreasL(tSize + 1, maxSize, x, y, 1);
                    areasFound += countAreasL(tSize - 1, minSize, x, y, -1);
                }else {
                    areasFound += findSize(tSize, maxSize, x, y, 1);
                    areasFound += findSize(tSize, minSize, x, y, -1);
                }
                lastSize = prevSize;
            }
        }
        
        return areasFound;
    }

    //rekursiivinen binaarihauen alku
    // x2 = x -1
    // y2 = y -1
    private static int countAreasS(int maxSize,int minSize, int x, int y){
        int areasFound = 0;
        int tSize = lastSize;
        //int tSize = min(max(lastSize,minSize),maxSize);
        int prevSize = tSize;

        runAmountB ++;
        int sum = kenttaSumma[x][y]+kenttaSumma[x-tSize][y-tSize]-kenttaSumma[x][y-tSize]-kenttaSumma[x-tSize][y];

        if(sum > wantedTrees){
            runAmountBU ++;
            //tSize = (int) (Math.sqrt(tSize*tSize-(sum-wantedTrees))+0.999); //pitkalle johdettu matemaattinen optimointi

            areasFound += countAreasB(tSize, minSize, x, y, prevSize,0.9);
        }else if (sum < wantedTrees){
            runAmountBD ++;
            tSize = (maxSize - tSize == 1)?maxSize+1:tSize; //estetaan pyoristysvirhe
            areasFound += countAreasB(maxSize, tSize, x, y, prevSize,-0.9);
        }else {
            //molemmat suunnat ovat mahdollisia --> kokeillaan kaikki lahella olevat
            areasFound ++;
            if (wantedTrees > testInt) {
                areasFound += countAreasL(tSize + 1, maxSize, x, y, 1);
                areasFound += countAreasL(tSize - 1, minSize, x, y, -1);
            }else {
                areasFound += findSize(tSize, maxSize, x, y, 1);
                areasFound += findSize(tSize, minSize, x, y, -1);
            }

        }
        return areasFound;
    }


    //suoraviivainen haku, yksitellen
    // x2 = x-1
    // y2 = y-1
    private static int countAreasL(int startSize,int endSize, int x, int y, int direction){
        int areasFound = 0;

        runAmountL ++;
        for (int tSize=startSize; direction*tSize<=endSize*direction; tSize=tSize+direction){
            runAmountL2 ++;
            int sum = kenttaSumma[x][y]+kenttaSumma[x-tSize][y-tSize]-kenttaSumma[x][y-tSize]-kenttaSumma[x-tSize][y];
            if (sum == wantedTrees){
                areasFound ++;
                lastSize = tSize;
            }else{
                break;
            }

        }

        return areasFound;
    }

    //rekursiivinen binaarihaku tyhjille kohdille
    private static int findSize(int startSize,int endSize, int x, int y,int direction){
        int foundArea = 0;
        if (direction*(endSize-startSize) <=4) {
            foundArea = countAreasL(startSize+direction,endSize,x,y,direction);
        }else{
            int tSize = (int) ((startSize + endSize) / 2.0);
            int sum = kenttaSumma[x][y] + kenttaSumma[x - tSize][y - tSize] - kenttaSumma[x][y - tSize] - kenttaSumma[x - tSize][y];
            if (sum < wantedTrees) {
                foundArea = findSize(tSize, endSize, x, y,direction);
            }else if (sum > wantedTrees) {
                foundArea = findSize(startSize, tSize, x, y,direction);
            }else{
                foundArea = (tSize - startSize)*direction;
                foundArea += findSize(tSize, endSize, x, y,direction);
            }
        }
        return foundArea;
    }

    //just for lulz
    private static int max(final int a, final int b){
        return (a>b)?a:b;
    }
    private static int min(final int a, final int b){
        return (a<b)?a:b;
    }
    private static double min(final double a, final double b){
        return (a<b)?a:b;
    }
    private static double max(final double a, final double b){
        return (a>b)?a:b;
    }


}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED