[백준] 1074 Z [자바]

 

---

https://st-lab.tistory.com/230

[백준] 1992번 : 쿼드트리 - JAVA[자바]

https://www.acmicpc.net/board/view/82431

글 읽기 - (java) 메모리초과 질문입니다

https://www.acmicpc.net/board/view/64976

글 읽기 - [Python] 시간 초과가 납니다. 더 줄일 방법이 있을까요?

 

 

---

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class Main {
	static int N,r,c;
	static int cnt = 0;
	static int result = 0;
 	public static void main(String arg[]) throws IOException {
 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
 		N = Integer.parseInt(st.nextToken());
 		r = Integer.parseInt(st.nextToken());
 		c = Integer.parseInt(st.nextToken());
 		int a = (int)Math.pow(2, N);
 		dive(0,0,a);
 		System.out.println(result);
 	}
 	static void dive(int x, int y, int size) {
 		if(size == 1) {
 			if(c == x && r == y)
 				result = cnt;
 			cnt++;
 			return;
 		}
 		int mid = size / 2;	
 		if(x+mid<= c && y+mid <= r) {
 			cnt += 3*(mid * mid);
 			dive(x+mid, y+mid, mid);
 		}
 		else if(y+mid <= r) {
 			cnt += 2* (mid * mid);
 			dive(x, y+mid, mid);
 		}
 		else if(x+mid <= c) {
 			cnt += mid * mid;
 			dive(x+mid, y, mid);
 		}
 		else {
 			dive(x, y, mid); 
 		}
 	}
}