CF 327D - Block Tower 数学题 DFS 初看很难,想通了就感觉很简单
2 seconds
256 megabytes
standard input
standard output
After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m cells). The goal of the game is to build your own city. Some cells in the grid are big holes, where Iahub can't build any building. The rest of cells are empty. In some empty cell Iahub can build exactly one tower of two following types:
- Blue towers. Each has population limit equal to 100.
- Red towers. Each has population limit equal to 200. However, it can be built in some cell only if in that moment at least one of the neighbouring cells has a Blue Tower. Two cells are neighbours is they share a side.
Iahub is also allowed to destroy a building from any cell. He can do this operation as much as he wants. After destroying a building, the other buildings are not influenced, and the destroyed cell becomes empty (so Iahub can build a tower in this cell if needed, see the second example for such a case).
Iahub can convince as many population as he wants to come into his city. So he needs to configure his city to allow maximum population possible. Therefore he should find a sequence of operations that builds the city in an optimal way, so that total population limit is as large as possible.
He says he's the best at this game, but he doesn't have the optimal solution. Write a program that calculates the optimal one, to show him that he's not as good as he thinks.
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 500). Each of the next n lines contains m characters, describing the grid. The j-th character in the i-th line is '.' if you're allowed to build at the cell with coordinates (i, j) a tower (empty cell) or '#' if there is a big hole there.
Print an integer k in the first line (0 ≤ k ≤ 106) — the number of operations Iahub should perform to obtain optimal result.
Each of the following k lines must contain a single operation in the following format:
- «B x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — building a blue tower at the cell (x, y);
- «R x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — building a red tower at the cell (x, y);
- «D x y» (1 ≤ x ≤ n, 1 ≤ y ≤ m) — destroying a tower at the cell (x, y).
If there are multiple solutions you can output any of them. Note, that you shouldn't minimize the number of operations.
2 3
..#
.#.
4
B 1 1
R 1 2
R 2 1
B 2 3
1 3
...
5
B 1 1
B 1 2
R 1 3
D 1 2
R 1 2
中文意思:
就是在 空的地方(字符'-')建造房子,蓝色房子是100人口,红色房子是200人口(建造红色房子时,旁边必须有蓝色房子),要求人口最大,只需输出可用的解就可以了。k是可行解的步数。
题解:
此题就是将尽可能的建造红色房子,但要求在建造红色房子时,它旁边必须有个蓝色房子。但输出无顺序要求。 首先我们将图分成几块(被#完全隔开)。你可以发现这样一点。你将所有的先全部建造成蓝色,然后再慢慢的从边际(也就是叶子)开始逐个的将此变成红色。看样例3,你就明白了。如此,每块分割开的一个个块将最后变成一个蓝的房子跟红色的其他房子。我们很容易知道,这时居住人口是最多的。因此,DFS即可解决这个问题。
因为n<=m<=500。我们的最大步数是3*m*n<k<=10^6次。所以这样的解是可以的。
我们的k值就是 空房数量*3-蓝色房子(一个块只有1个)*2;k可以直接在DFS时出来(先压点到栈)。
之后不断弹出栈中元素,分别输出 D操作跟R操作即可。。
/*
* @author ipqhjjybj
* @date 20130705
*
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stack>
#define clr(x,k) memset((x),(k),sizeof(x))
#define MAX(a,b) ((a)>(b)?(a):(b))
using namespace std; char s[505][505];
int n,m;
struct node{
int x,y;
bool f; //表示是否为一个块的开头
node(){};
node(int xx,int yy,bool first){
x=xx,y=yy,f=first;
};
};
stack<node> sn;
bool visit[505][505];
int k;
int x1[4]={0,0,1,-1};
int y1[4]={1,-1,0,0};
#define legal(x,a) (1<=x&&x<=a)
void dfs(int xx,int yy){
int _x,_y,i;
for(i=0;i<4;i++){
_x=xx+x1[i],_y=yy+y1[i];
if(legal(_x,n)&&legal(_y,m)&&!visit[_x][_y]&&s[_x][_y]=='.'){
visit[_x][_y]=true;
sn.push(node(_x,_y,false));
dfs(_x,_y);
}
}
}
int main(){
// freopen("D.in","r",stdin);
int i,j;
while(scanf("%d %d",&n,&m)!=EOF){
getchar();
for(i=1;i<=n;i++)
gets(s[i]+1);
sn.empty();
k=0;
clr(visit,false);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
if(!visit[i][j]&&s[i][j]=='.'){
k-=2;
visit[i][j]=true;
sn.push(node(i,j,true));
dfs(i,j);
}
}
k+=sn.size()*3;
printf("%d\n",k);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(visit[i][j])
printf("B %d %d\n",i,j);
node t;
while(!sn.empty()){
t = sn.top(); sn.pop();
if(!t.f){
printf("D %d %d\n",t.x,t.y);
printf("R %d %d\n",t.x,t.y);
}
}
}
return 0;
}
CF 327D - Block Tower 数学题 DFS 初看很难,想通了就感觉很简单的更多相关文章
- CodeForces - 327D Block Tower
D. Block Tower time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...
- CoderForces 327D Block Tower
Portal:http://codeforces.com/problemset/problem/327/D 一座红塔200人,一座蓝塔100人,只有与蓝塔相邻才可以建红塔. '.'处可建塔 '#'处不 ...
- Codeforces Round #191 (Div. 2) D. Block Tower
D. Block Tower time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...
- [翻译] 初看 ASP.NET Core 3.0 即将到来的变化
[翻译] 初看 ASP.NET Core 3.0 即将到来的变化 原文: A first look at changes coming in ASP.NET Core 3.0 在我们努力完成下一个 m ...
- 网络营销行业十大看了就想吐的“滥词”
网络营销行业在国内的互联网界已"猖獗"数年之久,它是一个让企业爱让用户恨的行业.有互联网的地方,就有网络营销的机会,有了机会就有了相关产业的存在,只不过是业大业小的问题.但是随着互 ...
- 代码走查25条疑问 C# 跳转新的标签页 C#线程处理 .Net 特性 attribute 学习 ----自定义特性 看懂 ,学会 .NET 事件的正确姿势-简单版
代码走查25条疑问 代码走查(Code Review) 是一个开发人员与架构师集中讨论代码的过程.通过代码走查可以提高代码的 质量,同时减少Bug出现的几率.但是在小公司中并没有代码走查的过程在这 ...
- 刚看完了一本关于javascript的书感觉受益匪浅,原来不懂的东西这么多,想问问怎么成为大神?求教!!!!!!
刚看完了一本关于javascript的书感觉受益匪浅,原来不懂的东西这么多,想问问怎么成为大神?求教!!!!!!
- 今天开dev的时候,config update一下别人的,但是忘了自己改过目录了,导致光看ip,想了半天,为什么接口不对
今天开dev的时候,config update一下别人的,但是忘了自己改过目录了,导致光看ip,想了半天,为什么接口不对 baseUrl: { // // dev: 'http://1 ...
- CF #376 (Div. 2) C. dfs
1.CF #376 (Div. 2) C. Socks dfs 2.题意:给袜子上色,使n天左右脚袜子都同样颜色. 3.总结:一开始用链表存图,一直TLE test 6 (1)如果需 ...
随机推荐
- Sublime 脚本 配置 (lua 和 JavaScript篇)
{ "cmd" :["C:/Lua/Lua.exe","$file"], "file_regex" :"^(? ...
- ArrayList集合--C#
static void Main(string[] args) { //实例化出一个集合对象 ArrayList list = new ArrayList(); /*添加*/ //--添加单个元素 l ...
- java--随机数的产生
随机数产生的三种方法: 1.system.currentTimeMillis() public class Demo1{ public static void main(String[] args) ...
- 【转载】django在eclipse环境下建web网站
一.创建一个项目如果这是你第一次使用Django,那么你必须进行一些初始设置.也就是通过自动生成代码来建立一个Django项目--一个Django项目的设置集,包含了数据库配置.Django详细选项设 ...
- C# 仿金山毒霸启动和关闭淡入淡出效果
原文 C# 仿金山毒霸启动和关闭淡入淡出效果 01 #region 窗体关闭效果 02 03 #region 私有方法 04 [DllImportAttribute("user32.dl ...
- mysql各版本区别
MySQL 的官网下载地址:http://www.mysql.com/downloads/ 在这个下载界面会有几个版本的选择. 1. MySQL Community Server 社区版本,开源免费, ...
- 基于visual Studio2013解决算法导论之005原地随机排列数组
题目 原地随机排列数组 解决代码及点评 #include <stdio.h> #include <stdlib.h> #include <malloc.h> ...
- 存几个html画图的网站
http://jvectormap.com/ http://julying.com/lab/raphael-js/docs/#Paper.path http://www.highcharts.com/ ...
- highcharts dynamic change line color
mouseOut: function(){ this.series.graph.attr({"stroke","#ccc"}) }
- 一步一步重写 CodeIgniter 框架 (4) —— load_class 管理多个对象实例的思路
我们使用CodeIgniter 框架最主要是想利用其 MVC 特性,将模型.视图分开,并通过控制器进行统一控制.在尝试实现 MVC 模式之前,我们将实现其中一个对程序结构非常有用的技巧,就是 load ...