POJ 1178 Camelot(DP + 枚举)
来源:互联网 发布:服务器装centos 编辑:程序博客网 时间:2024/05/18 13:44
题意:8X8棋盘上有一个king和一些knight,问把他们集合到一个点,最小需要移动的步数,有一个条件,就是如果王遇到骑士,那么骑士就可以带着王装逼一起飞了
思路:先floyd求出整个期盼对于王和骑士的传递闭包,然后每次枚举一个终点,和一个王和某个骑士的相遇点,然后答案就是,某个骑士到相遇点在到终点最小值,然后不断维护最小值即可
代码:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 64;const int d1[8][2] = {1, 2, 1, -2, 2, 1, 2, -1, -1, 2, -1, -2, -2, 1, -2, -1};const int d2[8][2] = {1, 1, 1, -1, 1, 0, 0, 1, 0, -1, -1, -1, -1, 0, -1, 1};const int INF = 0x3f3f3f3f;int g1[N][N], g2[N][N];char str[505];int king, knight[N], kn;int main() { memset(g1, INF, sizeof(g1)); memset(g2, INF, sizeof(g2)); for (int i = 0; i < 64; i++) {g1[i][i] = 0;g2[i][i] = 0; } for (int i = 0; i < 8; i++) {for (int j = 0; j < 8; j++) { for (int k = 0; k < 8; k++) {int x1 = i + d1[k][0];int y1 = j + d1[k][1];int x2 = i + d2[k][0];int y2 = j + d2[k][1];if (x1 >= 0 && x1 < 8 && y1 >= 0 && y1 < 8) g1[i * 8 + j][x1 * 8 + y1] = 1;if (x2 >= 0 && x2 < 8 && y2 >= 0 && y2 < 8) g2[i * 8 + j][x2 * 8 + y2] = 1; }} } for (int k = 0; k < 64; k++) {for (int i = 0; i < 64; i++) { for (int j = 0; j < 64; j++) {g1[i][j] = min(g1[i][j], g1[i][k] + g1[k][j]);g2[i][j] = min(g2[i][j], g2[i][k] + g2[k][j]); }} } while (~scanf("%s", str)) {int len = strlen(str);king = (str[0] - 'A') * 8 + (str[1] - '0' - 1);kn = 0;for (int i = 2; i < len; i += 2) knight[kn++] = (str[i] - 'A') * 8 + (str[i + 1] - '0' - 1);int ans = INF;for (int i = 0; i < 64; i++) { for (int j = 0; j < 64; j++) {int sum = g2[king][j];for (int k = 0; k < kn; k++) sum += g1[knight[k]][i];int tot = INF;for (int k = 0; k < kn; k++) { if (sum - g1[knight[k]][i] + g1[knight[k]][j] + g1[j][i] < tot)tot = sum - g1[knight[k]][i] + g1[knight[k]][j] + g1[j][i];}ans = min(ans, tot); }}printf("%d\n", ans); } return 0;}
0 0
- POJ 1178 - Camelot (枚举+dp : floyd)
- POJ 1178 Camelot(DP + 枚举)
- poj 1178 Camelot 枚举
- POJ 1178 Camelot (floyd+枚举)
- poj 1178 Camelot floyd + 枚举
- poj 1178 Camelot floyd+枚举
- POJ 1178 Camelot 最短路 Floyd +枚举
- poj 1178 Camelot(floyed+动规)
- POJ 1178 Camelot
- poj 1178 Camelot
- poj 1178 Camelot
- POJ 1178 Camelot 笔记
- POJ 1178 Camelot (floyed算法)
- poj1178 Camelot(floyd+枚举)
- USACO-Section 3.3 Camelot (最短路&&枚举)
- POJ1178:Camelot(FLOYD+DP)
- POJ 1018(dp Or 枚举)
- POJ:1050(枚举 + DP)
- Z-Stack协议学习笔记2--OSAL系统框架专题
- 杭电oj-acm steps-1.2
- Boost::asio库的网络编程学习(转)
- 五种常用基数估计算法效果实验及实践建议
- Linux - git notes
- POJ 1178 Camelot(DP + 枚举)
- Sencha ----Controller官网API翻译
- Unity3D地形创建
- CentOS更改yum源与更新系统
- 微信公众平台开发:初体验
- 在Java中实现浮点数的精确计算
- SSH框架总结(框架分析+环境搭建+实例源码下载)
- Codeforces Round #257 (Div. 2) D
- Android 根据坐标获取控件方法