[백준][12100번] 2048 (Easy)

https://www.acmicpc.net/problem/12100

12100번: 2048 (Easy)

풀이과정

1. 완전탐색으로 풀었다.

2. 동,서,남,북 방향으로 맵을 이동시켰다. 

 

결과

 

소스코드

#include<stdio.h>
#include<string.h>
enum DIRECTION {
	EAST, WEST, SOUTH, NORTH
};
int map[20][20];
int N;
int answer = 0;
void moveMap(int dir)
{
	if (dir == EAST || dir == SOUTH) {
		for (int i = 0; i < N; i++) {
			int prev = 0;
			int idx = N - 1;
			for (int j = N - 1; j >= 0; j--) {
				int cur = (dir == EAST) ? map[i][j] : map[j][i];
				if (cur == 0) continue;
				if (prev == cur) {
					if (dir == EAST) {
						map[i][idx + 1] *= 2;
						map[i][j] = 0;
						prev = 0;
					}
					else {
						map[idx + 1][i] *= 2;
						map[j][i] = 0;
						prev = 0;
					}
				}
				else {
					prev = cur;
					if (dir == EAST) {
						map[i][j] = 0;
						map[i][idx] = cur;
					}
					else {
						map[j][i] = 0;
						map[idx][i] = cur;
					}
					idx--;
				}
			}
		}
	}
	else {
		for (int i = 0; i < N; i++) {
			int prev = 0;
			int idx = 0;
			for (int j = 0; j < N; j++) {
				int cur = (dir == WEST) ? map[i][j] : map[j][i];
				if (cur == 0) continue;
				if (prev == cur) {
					if (dir == WEST) {
						map[i][idx - 1] *= 2;
						map[i][j] = 0;
						prev = 0;
					}
					else {
						map[idx - 1][i] *= 2;
						map[j][i] = 0;
						prev = 0;
					}
				}
				else {
					prev = cur;
					if (dir == WEST) {
						map[i][j] = 0;
						map[i][idx] = cur;
					}
					else {
						map[j][i] = 0;
						map[idx][i] = cur;
					}
					idx++;
				}
			}
		}
	}
}

void solution(int count)
{
	if (count >= 5) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				if (map[i][j] > answer) {
					answer = map[i][j];
				}
			}
		}
		return;
	}
	int cpymap[20][20] = { 0, };
	memcpy(cpymap, map, sizeof(map));
	for (int i = 0; i < 4; i++) {
		moveMap(i);
		solution(count + 1);
		memcpy(map, cpymap, sizeof(map));
	}
}

int main()
{
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			scanf("%d", &map[i][j]);
		}
	}
	solution(0);
	printf("%d\n", answer);
}