Posts 12100 Samsung sw test
Post
Cancel

12100 Samsung sw test

신성일 Apr 26, 2021 2021-04-26T18:19:26+09:00
May 30, 2023 2023-05-30T21:53:32+09:00 7 min

12100 Samsung sw test

알고리즘(DFS 재귀)

1
2
3
4
5
6
7
8

1. 위, 오른쪽, 아래, 왼쪽으로 차례로 보냄. 보낼때, 보내는 쪽에 가까운 곳부터 하나씩 검사.
2. 주의 사항 :
	2 4 8
	2 8 16
	4 2 32
	에서 위로 한번 보내면 맨 왼쪽 맨 위는 4가 되야하고 그 밑에 4가 와야함.
	하지만 내가 처음 짠 코드에서는 한번 업데이트 된곳을 저장안하고 그때그때 업데이트된 맵에 하나하나씩 적용했기에 맨왼쪽맨위에 8이 왔음
	이점에 주의

코드

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225

#include <iostream>
#include <cstring>
#define MAX_WIDTH 21
#define MAX_DEEP 5

using namespace std;

int map[MAX_WIDTH][MAX_WIDTH];
int maxCell = 0;
int width;

void getProperties();
void moveDP(int (*currentMap)[MAX_WIDTH], int deep = 0);
void test() {
	int m[3][3] = { 1,2,3,4,5,6,7,8,9 };
	int(*map)[3] = m;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++)
			cout << map[i][j];
		cout << endl;
	}
	cout << endl;
	int temp[3][3];
	for (int i = 0; i < 3; i++)
		memcpy(temp[i], map[i], sizeof(int) * 3);

	temp[0][0] = 0;
	temp[1][1] = 0;
	temp[2][2] = 0;

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++)
			cout << map[i][j];
		cout << endl;
	}
	cout << endl;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++)
			cout << temp[i][j];
		cout << endl;
	}
	cout << endl;

	for (int i = 0; i < 3; i++)
		memcpy(temp[i], map[i], sizeof(int) * 3);

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++)
			cout << temp[i][j];
		cout << endl;
	}
	cout << endl;

	temp[0][0] = 0;
	temp[1][1] = 0;
	temp[2][2] = 0;

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++)
			cout << temp[i][j];
		cout << endl;
	}
	cout << endl;
}
int main() {
	//test();
	while (true) {
		getProperties();
		moveDP(map);
		cout << maxCell;
		maxCell = 0;
	}
}

void getProperties() {
	cin >> width;
	for (int i = 0; i < width; i++)
		for (int j = 0; j < width; j++)
			cin >> map[i][j];
}

/*
10
8  8 4 16 32 0 0 8 8 8
8  8 4 0  0  8 0 0 0 0
16 0 0 16 0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 0
0  0 0 0  0  0 0 0 0 16
0  0 0 0  0  0 0 0 0 2
위 오오위오 -> 128
*/
void moveDP(int(*currentMap)[MAX_WIDTH], int deep) {
	if (deep == MAX_DEEP) {
		for (int i = 0; i < width; i++) {
			for (int j = 0; j < width; j++) {
				if (currentMap[i][j] > maxCell)
					maxCell = currentMap[i][j];
				//cout << currentMap[i][j];
			}
			//cout << endl;
		}
		//cout << endl;
		return;
	}
	int tempMap[MAX_WIDTH][MAX_WIDTH];
	bool updated[MAX_WIDTH][MAX_WIDTH] = { 0, };
	for (int i = 0; i < MAX_WIDTH; i++)
		memcpy(tempMap[i], currentMap[i], sizeof(int) * MAX_WIDTH);

	//위
	for (int row = 1; row < width; row++)
		for (int col = 0; col < width; col++)
			if (tempMap[row][col] != 0)
				for (int m = row - 1; m >= 0; m--) {
					if (tempMap[m][col] != 0) {
						if (tempMap[m][col] == tempMap[row][col] && !updated[m][col]) {
							tempMap[m][col] *= 2;
							tempMap[row][col] = 0;
							updated[m][col] = true;
						}
						else {
							tempMap[m + 1][col] = tempMap[row][col];
							tempMap[row][col] = m == (row -1) ? tempMap[row][col] : 0;
						}
						break;
					}
					else if (m == 0) {
						tempMap[m][col] = tempMap[row][col];
						tempMap[row][col] = 0;
					}
				}
	moveDP(tempMap, deep + 1);
	for (int i = 0; i < MAX_WIDTH; i++) {
		memcpy(tempMap[i], currentMap[i], sizeof(int) * MAX_WIDTH);
		memset(updated[i], 0, sizeof(bool) * MAX_WIDTH);
	}

	//오른쪽
	for (int col = width-2; col >= 0; col--)
		for (int row = 0; row < width; row++)
			if (tempMap[row][col] != 0)
				for (int m = col + 1; m <= width-1; m++) {
					if (tempMap[row][m] != 0) {
						if (tempMap[row][m] == tempMap[row][col] && !updated[row][m]) {
							tempMap[row][m] *= 2;
							tempMap[row][col] = 0;
							updated[row][m] = true;
						}
						else {
							tempMap[row][m-1] = tempMap[row][col];
							tempMap[row][col] = m == (col + 1) ? tempMap[row][col] : 0;
						}
						break;
					}
					else if (m == width-1) {
						tempMap[row][m] = tempMap[row][col];
						tempMap[row][col] = 0;
					}
				}
	moveDP(tempMap, deep + 1);
	for (int i = 0; i < MAX_WIDTH; i++) {
		memcpy(tempMap[i], currentMap[i], sizeof(int) * MAX_WIDTH);
		memset(updated[i], 0, sizeof(bool) * MAX_WIDTH);
	}

	//아래
	for (int row = width-2; row >= 0; row--)
		for (int col = 0; col < width; col++)
			if (tempMap[row][col] != 0)
				for (int m = row + 1; m <= width-1; m++) {
					if (tempMap[m][col] != 0) {
						if (tempMap[m][col] == tempMap[row][col] && !updated[m][col]) {
							tempMap[m][col] *= 2;
							tempMap[row][col] = 0;
							updated[m][col] = true;
						}
						else {
							tempMap[m - 1][col] = tempMap[row][col];
							tempMap[row][col] = m == (row + 1) ? tempMap[row][col] : 0;
						}
						break;
					}
					else if (m == width-1) {
						tempMap[m][col] = tempMap[row][col];
						tempMap[row][col] = 0;
					}
				}
	moveDP(tempMap, deep + 1);
	for (int i = 0; i < MAX_WIDTH; i++) {
		memcpy(tempMap[i], currentMap[i], sizeof(int) * MAX_WIDTH);
		memset(updated[i], 0, sizeof(bool) * MAX_WIDTH);
	}

	//왼쪽
	for (int col = 1; col <= width-1; col++)
		for (int row = 0; row < width; row++)
			if (tempMap[row][col] != 0)
				for (int m = col - 1; m >= 0; m--) {
					if (tempMap[row][m] != 0) {
						if (tempMap[row][m] == tempMap[row][col] && !updated[row][m]) {
							tempMap[row][m] *= 2;
							tempMap[row][col] = 0;
							updated[row][m] = true;
						}
						else {
							tempMap[row][m + 1] = tempMap[row][col];
							tempMap[row][col] = m == (col - 1) ? tempMap[row][col] : 0;
						}
						break;
					}
					else if (m == 0) {
						tempMap[row][m] = tempMap[row][col];
						tempMap[row][col] = 0;
					}
				}
	moveDP(tempMap, deep + 1);
	for (int i = 0; i < MAX_WIDTH; i++) {
		memcpy(tempMap[i], currentMap[i], sizeof(int) * MAX_WIDTH);
		memset(updated[i], 0, sizeof(bool) * MAX_WIDTH);
	}
}
알고리즘, beackjoon
This post is licensed under CC BY 4.0 by the author.
Recent Update
Contents

1202 Jewelry thief

1248 맞춰봐

Comments powered by Disqus.