답안 #18699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
18699	2016-02-14T06:40:19 Z	pichulia	L 모양의 종이 자르기 (KOI15_cut)	C++	25 / 25	156 ms	34116 KB

cut

#include<stdio.h>
#include<algorithm>
using namespace std;
bool r[51][51][51][51];
int x[51][51][51][51];
int dp(int a, int b, int c, int d)
{
	if (r[a][b][c][d]) return x[a][b][c][d];
	r[a][b][c][d] = true;
	int res = 199999999;
	int i, j;

	if (c * d == 0)
	{
		if(a==b)return x[a][b][c][d] = 1;

		for (i = 1; i <= a/2; i++)
		{
			int cur = dp(i, b, 0, 0) + dp(a - i, b, 0, 0);
			res = min(res, cur);
		}
		for (i = 1; i <= b / 2; i++)
		{
			int cur = dp(a, i, 0, 0) + dp(a, b-i, 0, 0);
			res = min(res, cur);
		}
		return x[a][b][c][d] = res;
	}

	for (i = 1; i < a - c; i++)
	{
		int cur = dp(i, b, 0, 0) + dp(a - i, b, c, d);
		res = min(res, cur);
	}
	res = min(res, dp(a - c, b, 0, 0) + dp(c, b - d, 0, 0));
	for (i = a - c + 1; i < a; i++)
	{
		int cur = dp(i, b, i-(a-c), d) + dp(a - i, b-d, 0, 0);
		res = min(res, cur);
	}

	for (i = 1; i < b - d; i++)
	{
		int cur = dp(a, i, 0, 0) + dp(a, b - i, c, d);
		res = min(res, cur);
	}
	res = min(res, dp(a, b - d, 0, 0) + dp(a - c, d, 0, 0));
	for (i = b - d + 1; i < b; i++)
	{
		int cur = dp(a, i, c, i - (b - d)) + dp(a - c, b - i, 0, 0);
		res = min(res, cur);
	}

	return x[a][b][c][d] = res;
}
int main()
{
	int a, b, c, d;
	scanf("%d %d %d %d", &a, &b, &c, &d);
	printf("%d\n", dp(a, b, c, d));
}

Subtask #1

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	44 ms	34116 KB	Output is correct
2	Correct	12 ms	34116 KB	Output is correct
3	Correct	4 ms	34116 KB	Output is correct
4	Correct	156 ms	34116 KB	Output is correct
5	Correct	10 ms	34116 KB	Output is correct
6	Correct	0 ms	34116 KB	Output is correct
7	Correct	0 ms	34116 KB	Output is correct
8	Correct	0 ms	34116 KB	Output is correct
9	Correct	0 ms	34116 KB	Output is correct
10	Correct	0 ms	34116 KB	Output is correct
11	Correct	11 ms	34116 KB	Output is correct
12	Correct	0 ms	34116 KB	Output is correct
13	Correct	0 ms	34116 KB	Output is correct
14	Correct	15 ms	34116 KB	Output is correct
15	Correct	15 ms	34116 KB	Output is correct
16	Correct	152 ms	34116 KB	Output is correct
17	Correct	0 ms	34116 KB	Output is correct
18	Correct	44 ms	34116 KB	Output is correct
19	Correct	8 ms	34116 KB	Output is correct
20	Correct	0 ms	34116 KB	Output is correct