3.22~3.23总结

刷题：

生日蛋糕

这题的写法是dfs加减枝，这题未知量比较多，搜索的变量也会多几个，我们可以对层数、半径和高度进行搜索，只要这三者确定了，那么一切都好说。所以说这题的想法并不会很难，但关键在于它的剪枝比较多而已；这题看着挺像个数学题的，但其实与数学的关系不大；

代码：

#include<stdio.h>
#include<math.h>
int  n, m, min = 99999999;
void dfs(int x, int r, int h, int s, int v)
{
	if (s > min || v > n)
	{
		return;
	}
	if (x == m && v == n) 
	{
		if (s < min)
			min = s;
		return;
	}
	else
	{
		if (v + (h * r * r) * (m - x) <= n)
			return;
		
	}
	for (int h1 = h - 1; h1 >= m - x; h1--)
	{
		for (int r1 = r - 1; r1 >= m - x; r1--)
		{
			dfs(x + 1, r1, h1, s + 2 * r1 * h1, v + r1 * r1 * h1);
		}
	}
}
int main() {

	scanf("%d%d", &n, &m);
	for (int h = n / (m * m); h >= m; h--) 
	{
		for (int r = sqrt(n / m); r >= m; r--)
		{
			dfs(1, r, h, r * r + 2 * r * h, h * r * r);
		}
	}
	if (min == 99999999)
	{
		printf("0");
	}
	else
	{
		printf("%d", min);
	}
}

https://vjudge.net/contest/547627#problem/N

思路：这题看着挺像一个bfs题目的，对每一个城市作为起点，进行遍历，找到最小的解，思路很简单，但是，普通的bfs这题是过不了的，会时间超限，这题需要状态压缩；

bfs代码：

#include<stdio.h>
int n, m;
int book[50][50];
int book2[20];
struct node
{
	int x;
	int step;
	//int book[50][50];
	int book2[20];
	int cnt;
}que[10000];
int bfs(int x)
{
	node temp;
	int min = 999999;
	int tail = 0;
	int head = 0;
	que[tail].x = x;
	que[tail].step = 0;
	/*for (int i = 0; i < 1000; i++)
	{
		for (int j = 0; j <= 10; j++)
		{
			que[i].book2[j] = 0;
		}
	}*/
	que[tail].book2[x]=1;
	que[tail].cnt = 1;
	tail++;
	while (head < tail)
	{
		for (int i = 1; i <= n; i++)
		{
			temp = que[head];
			if (temp.step > min)
			{
				continue;
			}
			if (temp.book2[i] < 2 && i != temp.x&&book[temp.x][i]!=0)
			{
				if (temp.cnt == n)
				{
					if (temp.step < min)
					{
						min = temp.step;
					}
					break;
				}
 				if (temp.book2[i] == 0)
				{
					temp.cnt++;
				}
				temp.book2[i]++;
				temp.step += book[temp.x][i];
				temp.x = i;
				que[tail++] = temp;
				if (temp.cnt == n)
				{
					if (temp.step < min)
					{
						min = temp.step;
					}
					break;
				}
			}
		}
		head++;
	}
	return min;
}
int main()
{
	int a, b, c;
	while(~scanf("%d%d", &n, &m))
	{
		for (int i = 0; i <= n; i++)
		{
			for (int j = 0; j <= n; j++)
			{
				book[i][j] = 0;
			}
			book2[i] = 0;
		}
		for (int i = 0; i < m; i++)
		{
			scanf("%d%d%d", &a, &b, &c);
			book[a][b] = c;
			book[b][a] = c;
		}
		int min = 999999;
		for (int i = 1; i <= n; i++)
		{
			int t = bfs(i);
			if (t < min)
			{
				min = t;
			}
		}
		printf("%d\n", min);
	}
	return 0;
}

这个代码时间超限了；然后我去看了状态压缩的题解；

状态压缩：

void init() {
	for (int i = 1; i <= 10; ++i) id[i] = pow(3, i - 1);
	int tot = pow(3, 10);
	for (int i = 1; i <= tot; ++i) {
		int tmp = i, p = 0;
		while (tmp) {
			state[i][++p] = tmp % 3;
			tmp /= 3;
		}
	}
}

完整代码：

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cstdio>
#define INF 0x3f3f3f3f

using namespace std;

int n, m, ans;
int book[60010][12];
int id[60010];
int a[20][20];
int state[60010][12];
struct node
{
	int u, dis, step;
}q[1000000];
int check(int x)
{
	for (int i = 1; i <= n; i++)
	{
		if (!state[x][i])return 0;
	}
	return 1;
}
int min(int x, int y)
{
	return x < y ? x : y;
}
void bfs(int x)
{
	int head = 0, tail = 0;
	q[tail].u = x;
	q[tail].dis = 0;
	q[tail].step = id[x];
	book[id[x]][x] = 0;
	tail++;
	while (tail > head)
	{
		node temp = q[head];
		head++;
		int u = temp.u;
		int step = temp.step;
		if (check(temp.step)) {
			ans = min(ans, temp.dis);
			continue;
		}
		for (int k = 1; k <= n; k++)
		{
			if (k == u || a[u][k] == -1)continue;
			if (state[temp.step][k] < 2) {
				int tmp = step + id[k];
				int dis = temp.dis + a[u][k];
				if (dis >= ans)continue;
				if (dis < book[tmp][k]) {
					q[tail].u = k;
					q[tail].dis = dis;
					q[tail].step = tmp;
					tail++;
					book[tmp][k] = dis;
				}
			}
		}
	}
}
void init() {
	for (int i = 1; i <= 10; ++i) id[i] = pow(3, i - 1);
	int tot = pow(3, 10);
	for (int i = 1; i <= tot; ++i) {
		int tmp = i, p = 0;
		while (tmp) {
			state[i][++p] = tmp % 3;
			tmp /= 3;
		}
	}
}
int main()
{
	init();
	while (~scanf("%d%d", &n, &m))
	{
		memset(book, INF, sizeof(book));//清空边 
		memset(a, -1, sizeof(a));//清空图 
		for (int i = 1; i <= m; i++)
		{
			int x, y, z;
			scanf("%d%d%d", &x, &y, &z);
			//a[x][y] = a[y][x] = z;
			if (a[x][y] == -1)
			{
				a[x][y] = a[y][x] = z;
			}
			else
			{
				a[x][y] = min(z, a[x][y]);
				a[y][x] = a[x][y];
			}
			ans = INF;
		}
		for (int i = 1; i <= n; i++)
			{
				bfs(i);
			}
		if (ans == INF)
		{
			printf("-1\n");
		}
		else
		{
			printf("%d\n", ans);
		}
	}
	return 0;
}

简单搜索&&进阶搜索 - Virtual Judge (vjudge.net)https://vjudge.net/contest/547627#problem/U这题因为时间足够，可以使用暴力dfs，但是要注意除法时分母不能为0，并且减法和除法有方向，多了处理字符串这一点，还有需要判断能否整除， 因为题目要求计算过程不能出现小数。每次取没有使用的两个数，继续进行加减乘除的操作。 等到使用数字个数达到4时，判断当前结果有没有达到24。

代码：

#include<stdio.h>
#include<string.h>
char s[10];
int a[4];
int book[4];
int flag;
void dfs(int num)//num表示
{
	if(flag==1) return;
	if (num == 4)
	{
		for (int i = 0; i < 4; i++)
		{
			if (book[i] == 0 && a[i] == 24)
			{
				flag = 1;
			}
		}
		return;
	}
	for (int i = 0; i < 4; i++)
	{
		if (book[i] == 0)
		{
			for (int j = i+1; j < 4; j++)
			{
				if (book[j] == 0)
				{
					book[j] = 1;
					int x = a[i];
					int y = a[j];
					if (y && x % y == 0)a[i] = x / y, dfs(num + 1);
					if (x && y % x == 0)a[i] = y / x, dfs(num + 1);
					a[i] = x + y, dfs(num + 1);
					a[i] = x - y, dfs(num + 1);
					a[i] = y - x, dfs(num + 1);
					a[i] = x * y, dfs(num + 1);
					a[i] = x;
					book[j] = 0;
				}
			}
		}
	}
}
int main()
{
	while (~scanf("%c", &s[0]))
	{
		flag = 0;
		for (int i = 0; i < 4; i++)
		{
			book[i] = 0;
		}
		for (int i = 1;; i++)
		{
			scanf("%c", &s[i]);
			if (s[i] == '\n')
			{
				break;
			}
		}
		int t = 0;
		for (int i = 0; i < strlen(s); i++)
		{
			if (s[i] != ' ')
			{
				if (s[i] == 'A')a[t++]= 1;
				if (s[0] == 'J')a[t++] = 11;
				if (s[0] == 'Q')a[t++] = 12;
				if (s[0] == 'K')a[t++] = 13;
				if (s[i] == '1') a[t++] = 10;
				if (s[i] >= '2' && s[i] <= '9')
				{
					a[t++] = s[i] - '0';
				}
			}
		}
		dfs(1);
		if (flag == 1)
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;
}