CSES - Datatähti 2016 alku

CSES - Datatähti 2016 alku - Results

Submission details
Task:	Tontti
Sender:	kalh
Submission time:	2015-10-02 12:06:23 +0300
Language:	Java
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.18 s	1	details
#2	ACCEPTED	0.19 s	1	details
#3	WRONG ANSWER	0.18 s	1	details
#4	WRONG ANSWER	0.15 s	1	details
#5	WRONG ANSWER	0.18 s	1	details
#6	WRONG ANSWER	0.51 s	2	details
#7	WRONG ANSWER	0.30 s	2	details
#8	ACCEPTED	0.29 s	2	details
#9	ACCEPTED	0.30 s	2	details
#10	ACCEPTED	0.33 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	ACCEPTED	0.61 s	3	details
#14	ACCEPTED	0.76 s	3	details
#15	ACCEPTED	0.77 s	3	details

Code

import java.util.*;
import java.math.*;
 
public class Tehtava3 {
	
	private static int[][] arvot;
	private static int korkeus;
	private static int leveys;
	private static IO io;
	private static long t;
	
	public static void laskeTavat(int korkeus, int leveys, String[] metsa, int puita) {
		
		
		//long a = 0;
 
		int pieninKoko = (int)Math.ceil(Math.sqrt(puita));
		//int maksimiKoko = Math.min(korkeus, leveys);
 
	//	System.out.println("1. Osa: " + (System.currentTimeMillis()-t) + "ms");
		
		int puitaYhteensa = arvot[leveys-1][korkeus-1];
		if (puitaYhteensa < 100)
			System.out.println(0);
		int maara = 0;
		int maaraAlueella = 0;
		int alaarvo = 0;
		int ylaarvo = 0;
		int valiarvo = 0;
		int valimaksimi = 0;
		int loydettyMaara = 0;
			
		for (int j = 0; j <= leveys - pieninKoko; j++) {
			if (!tarpeeksiPuita(j, 0, puita))
				break;
			for (int k = 0; k <= korkeus - pieninKoko; k++) {
 
				valimaksimi = Math.min(korkeus - k, leveys - j);
				alaarvo = pieninKoko;
				ylaarvo = valimaksimi;
				valiarvo = (ylaarvo + alaarvo) / 2;
				//long t1 = System.currentTimeMillis();
				
 
				// BINAARIHAKU
				maaraAlueella = puidenMaara(j, k, valiarvo);
				if (!tarpeeksiPuita(j, k, puita))
					break;
				
				while (maaraAlueella != puita && alaarvo <= ylaarvo) {
					if (maaraAlueella > puita) {
						ylaarvo = valiarvo - 1;
					} else {
						alaarvo = valiarvo + 1;
					}
 
					//System.out.println(j + ":" + k + ", " + alaarvo + ":" + ylaarvo);
					valiarvo = (ylaarvo + alaarvo) / 2;
					maaraAlueella = puidenMaara(j, k, valiarvo);
					
					
				}
				
				//a += (System.currentTimeMillis()-t1);
				
 
				//System.out.println(alaarvo + ":" + ylaarvo + ", (" + puidenMaara(j, k, alaarvo) + ", " + puidenMaara(j, k, ylaarvo) + ")");
				/**
				for (int d = alaarvo; d <= ylaarvo; d++) {
					loydettyMaara = puidenMaara(j, k, d);
 
					 if (loydettyMaara == puita) {
						maara++;
					}
					 else if (loydettyMaara > puita) {
							break;
					 }
 
 
				}
				*/
				
				
				for (int d = ylaarvo; d >= alaarvo; d--) {
					loydettyMaara = puidenMaara(j, k, d);
 
					 if (loydettyMaara == puita) {
						maara++;
					}
					 
					 else if (loydettyMaara < puita) {
							break;
					 }
 
				}
				
				
				
 
 
			}
			
 
		}
 
		//System.out.println("Kesto: " + (System.currentTimeMillis() - t) + "ms" +", [" + leveys + ", " + korkeus + "], " + puita + ", tulos: " + maara);
		//System.out.println("Kesto 2: " + a + "ms");
		io.print(maara);
	}
	
	
 
	public static boolean tarpeeksiPuita(int alkux, int alkuy, int puita) {
		
		int arvo1 = 0;
		int arvo2 = 0;
		int arvo3 = 0;
		int arvo4 = arvot[leveys-1][korkeus-1];
		
		if (alkux != 0) {
			arvo3 = arvot[alkux-1][korkeus-1];
		}
	
	if (alkuy != 0) {
		arvo2 = arvot[leveys-1][alkuy-1];
		
		if (alkux != 0)
			arvo1 = arvot[alkux-1][alkuy-1];
	}
	
	if ((arvo1+arvo4-arvo2-arvo3) >= puita)
		return true;
		
		return false;
	}
	
	public static int puidenMaara(int alkux, int alkuy, int koko) {
		
		if (alkux+koko > leveys || alkuy+koko > korkeus)
			return 0;
 
		
		int maxx = alkux+koko-1;
		int maxy = alkuy+koko-1;
		
		
		//if (puuarvot.containsKey(koko))
		//return puuarvot.get(koko);
			
		int arvo1 = 0;
		int arvo2 = 0;
		int arvo3 = 0;
		int arvo4 = arvot[maxx][maxy];;
		
		if (alkux != 0) {
				arvo3 = arvot[alkux-1][maxy];
		}
		
		if (alkuy != 0) {
			arvo2 = arvot[maxx][alkuy-1];
			
			if (alkux != 0)
				arvo1 = arvot[alkux-1][alkuy-1];
		}
		return (arvo1+arvo4-arvo2-arvo3);
 
	}
	
public static void laskeTavatHidas(int korkeus, int leveys, String[] metsa, int puita) {
		
		
		//long t = System.currentTimeMillis();
		int tulos = 0;
		
		
		int pieninKoko = (int)Math.ceil(Math.sqrt(puita));
		int maksimiKoko = Math.min(korkeus, leveys);
		
 
		
	//	System.out.println("1. Osa: " + (System.currentTimeMillis()-t) + "ms");
		
		
		int maara = 0;
		int maaraAlueella = 0;
			
			for (int j = 0; j<=leveys-pieninKoko; j++) {
				
				for (int k = 0; k<=korkeus-pieninKoko; k++) {
					
					for (int i = pieninKoko; i<=maksimiKoko; i++) {
						if (k+i > korkeus || j+i > leveys)
							break;
						
						maaraAlueella = puidenMaara(j, k, i);
						if (maaraAlueella == puita) {
							//System.out.println(j + ":" + k + ", " + i);
						maara++;
						}
						else if (maaraAlueella > puita) {
							break;
						}
					
					}
					
				}
				
			}
		
		//System.out.println("2. Osa: " + (System.currentTimeMillis()-t) + "ms");
		System.out.println(maara);
		
	}
	
	public static String[] luoSatunnainen(int leveys, int korkeus) {
		StringBuilder sb;
		String[] metsa = new String[korkeus];
		Random r = new Random();
		for (int i = 0; i<korkeus; i++) {
			sb = new StringBuilder();
			for (int j = 0; j<leveys; j++) {
				int a = r.nextInt(1000);
				if (a <= 1)
					sb.append('*');
				else
					sb.append('.');
				
			}
			
			metsa[i] = sb.toString();
		}
		
		return metsa;
	}
	
	
	public static void tulostaMetsa(String[] metsa) {
	
		for (int i = 0; i<metsa.length; i++) {
			for (int j = 0; j<metsa[0].length(); j++) {
				System.out.print(metsa[i].charAt(j) + " ");
				
			}
			System.out.println();
			System.out.println("--------------------------------------");
		}
	}
	
	public static void luoArvoTaulukko(String[] metsa) {
		// metsa[0] = leveys
		//metsa = korkeus
		
		//arvot[0] = korkeus
		// arvot = leveys
		
		//long t1 = System.currentTimeMillis();
		
		int summa1 = 0;
		for (int i = 0; i<leveys; i++) {
			if (metsa[0].charAt(i) == '*') {
				summa1++;
			}
			arvot[i][0] = summa1;
		}
		
		int summa2 = 0;
		for (int y = 1; y<metsa.length; y++) {
			summa1 = 0;
			summa2 = 0;
			
			for (int x = 0; x<metsa[0].length(); x++) {
				
				if (metsa[y].charAt(x) == '*') {
					summa2++;
				}
				
				summa1 = arvot[x][y-1];
						
				
				arvot[x][y] = (summa1+summa2);
			}
		}
		
		//System.out.println("arvotaulukon luontiin meni " + (System.currentTimeMillis()-t1) + "ms");
	}
	
	public static void tulostaArvoTaulukko() {
		System.out.println();
		for (int i = 0; i<arvot[0].length; i++) {
			for (int j = 0; j<arvot.length; j++) {
				System.out.print(arvot[j][i] + " | ");
			}
			System.out.println("--------------");
		}
	}
 
	public static void main(String[] args) {
		
		
		io = new IO();
	
		korkeus = io.nextInt();
		leveys = io.nextInt();
		int puita = io.nextInt();
		 
		
		//korkeus = 2000;
		//leveys = 2000;
		//int puita = 100;
		
		String[] metsa = new String[korkeus];
	
		for (int i = 0; i<korkeus; i++) {
			metsa[i] = io.next();
		}
		
		arvot = new int[leveys][korkeus];
		
		
		//Random r = new Random();
		//metsa = luoSatunnainen(leveys, korkeus);
		//tulostaMetsa(metsa);
		
		//t = System.currentTimeMillis();
 
	//
		luoArvoTaulukko(metsa);	
		
		//tulostaArvoTaulukko();
		laskeTavat(korkeus, leveys, metsa, puita);
		//laskeTavatHidas(korkeus, leveys, metsa, puita);
		io.close();
 
	}
	
 
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
`10 10 1 ......... ......... ....... ....*.... ...` view save

correct output
`94` view save

user output
`0 94` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`10 10 5 ******** ****** ****** ******** ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`10 10 10 *......* ...*.. ...*...* ...... ...` view save

correct output
`4` view save

user output
`0 4` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
`10 10 5 ***...... ....* .......* ....**.. ...` view save

correct output
`16` view save

user output
`0 16` view save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
`10 10 2 .... ........ .**....* *... ...` view save

correct output
`30` view save

user output
`0 30` view save

Test 6

Group: 2

Verdict: WRONG ANSWER

input
`500 500 1 .................................` view save

correct output
`9552040` view save

user output
`0 9552040` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

input
`500 500 5 .................................` view save

correct output
`1536063` view save

user output
`0 1536063` view save

Test 8

Group: 2

Verdict: ACCEPTED

input
`500 500 25000 *......*......*........` view save

correct output
`288` view save

user output
`288` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`500 500 12500 ............***........` view save

correct output
`786` view save

user output
`786` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`500 500 5000 ...*.........*.......` view save

correct output
`1763` view save

user output
`1763` view save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 1 .................................` view save

correct output
`489611392` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 5 .................................` view save

correct output
`120725884` view save

user output
(empty)

Test 13

Group: 3

Verdict: ACCEPTED

input
`2000 2000 400000 ........*......*...` view save

correct output
`1849` view save

user output
`1849` view save

Test 14

Group: 3

Verdict: ACCEPTED

input
`2000 2000 200000 **.....................` view save

correct output
`2665` view save

user output
`2665` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`2000 2000 80000 ..........*.....*....` view save

correct output
`5587` view save

user output
`5587` view save

Datatähti 2016 alku

Tontti

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (kalh)