MinimumTours TopCoder - 7620
Problem Statement |
|||||||||||||
Little Bonnie has taken a vacation to Ha Long Bay. There are a few thousand stone islands in the bay, making it one of the most beautiful natural scenes in Vietnam. Bonnie is so impressed by this fact that she has decided to visit all of the islands. She bought a map of all the islands in the bay. This map is given in the String[] islandMap, which is a two-dimensional matrix where each cell is either '.' or lowercase 'x'. '.' cells represent sea and 'x' cells represent land. Two cells are connected if they have a point in common, so each cell may connect to at most 8 other cells. An island is defined as a maximal connected group of 'x' cells. A trip between two islands is defined as a connected group of '.' cells where, for each of the two islands, there is at least one '.' cell in the trip which is connected to a cell in that island. If there is no such connected group of '.' cells between two islands, then there is no trip between them. Note that an island can be nested inside another island. A tour is a sequence of islands where there is a trip between every pair of consecutive islands in the sequence. Little Bonnie wants to visit every island exactly once, and she wants to do this using the minimum possible number of tours. Return the number of tours she will have to take. | |||||||||||||
Definition |
|||||||||||||
|
|||||||||||||
Notes |
|||||||||||||
- | It is possible for a tour to have only one island. | ||||||||||||
- | Bonnie cannot leave the mapped area at any time. | ||||||||||||
- | It is assumed that Bonnie has another way to travel from the last island of one tour to the first island of another tour, so you don't have to take this into account when solving the problem. | ||||||||||||
Constraints |
|||||||||||||
- | islandMap will contain between 1 and 50 elements, inclusive. | ||||||||||||
- | Each element of islandMap will contain between 1 and 50 characters, inclusive. | ||||||||||||
- | Each element of islandMap will contain the same number of characters. | ||||||||||||
- | Each character in islandMap will be either '.' or lowercase 'x'. | ||||||||||||
- | There will be at least one island in the map. | ||||||||||||
Examples |
|||||||||||||
0) | |||||||||||||
|
|||||||||||||
1) | |||||||||||||
|
|||||||||||||
2) | |||||||||||||
|
|||||||||||||
3) | |||||||||||||
|
|||||||||||||
4) | |||||||||||||
|
代码
//将每一片海和岛看做一个点,构图发现这是一棵树
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
const int dx[]={-1,-1,-1,0,0,1,1,1};
const int dy[]={-1,0,1,-1,1,-1,0,1};
string s[60];
int a[1000][1000];
int n,m,cnt,wt,ans;
int head[100000];
bool used[3000][3000],is[100000],gone[100000];
struct edge{
int next,to;
}e[100000];
class MinimumTours
{
public:
//TC的格式
void ff(int x,int y,int col,int k){
if(a[x][y]!=k)return;
a[x][y]=col;
for(int i=0;i<8;i++)
ff(x+dx[i],y+dy[i],col,k);
}
void add(int u,int v){
e[++wt].next=head[u];
head[u]=wt;
e[wt].to=v;
e[++wt].next=head[v];
head[v]=wt;
e[wt].to=u;
}
int work(int v){
/*返回值含义:
0--对答案无贡献
1--有一条链,可向上走
2--是一个单点
*/
int i,k,cnt1=0,cnt2=0;
gone[v]=1;
for(i=head[v];i;i=e[i].next){
k=e[i].to;
if(!gone[k]){
k=work(k);
if(k==1)cnt1++;
if(k==2)cnt2++;
}
}
if(is[v]){
if(cnt1){
ans+=cnt1-1;
if(cnt1==1)return 1;
else return 0;
}
else {
if(cnt2)return 0;
return 2;
}
}
else {
if(cnt1==0)return cnt2>0;
ans+=cnt1/2;
return ((cnt1&1)?1:2);
}
}
int getMinimumTours(vector<string>islandMap)
{ //freopen("1.in","r",stdin);
int i,j,k;
cnt=0;wt=0;ans=0;
memset(head,0,sizeof(head));
n=islandMap.size();
m=islandMap[0].size();
for(i=0;i<n;i++)
for(j=0;j<m;j++)
a[i][j]=(islandMap[i][j]=='.'?-2:-1);
memset(used,0,sizeof(used));
memset(is,0,sizeof(is));
//构图
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if(a[i][j]==-1){
ff(i,j,++cnt,-1);
is[cnt]=1;
}
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if(a[i][j]==-2)ff(i,j,++cnt,-2);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
for(k=0;k<8;k++){
int x1=i,x2=i+dx[k],y1=j,y2=j+dy[k];
int p=a[x1][y1],q=a[x2][y2];
if(p!=q&&q>0&&!used[p][q]){
used[p][q]=used[q][p]=1;
add(p,q);
}
}
memset(gone,0,sizeof(gone));
if(work(1)&&is[1])ans+=1;
return ans;
}
};
MinimumTours TopCoder - 7620的更多相关文章
- TopCoder kawigiEdit插件配置
kawigiEdit插件可以提高 TopCoder编译,提交效率,可以管理保存每次SRM的代码. kawigiEdit下载地址:http://code.google.com/p/kawigiedit/ ...
- 记第一次TopCoder, 练习SRM 583 div2 250
今天第一次做topcoder,没有比赛,所以找的最新一期的SRM练习,做了第一道题. 题目大意是说 给一个数字字符串,任意交换两位,使数字变为最小,不能有前导0. 看到题目以后,先想到的找规律,发现要 ...
- TopCoder比赛总结表
TopCoder 250 500 ...
- Topcoder几例C++字符串应用
本文写于9月初,是利用Topcoder准备应聘时的机试环节临时补习的C++的一部分内容.签约之后,没有再进行练习,此文暂告一段落. 换句话说,就是本文太监了,一直做草稿看着别扭,删掉又觉得可惜,索性发 ...
- TopCoder
在TopCoder下载好luncher,网址:https://www.topcoder.com/community/competitive%20programming/ 选择launch web ar ...
- TopCoder SRM 596 DIV 1 250
body { font-family: Monospaced; font-size: 12pt } pre { font-family: Monospaced; font-size: 12pt } P ...
- 求拓扑排序的数量,例题 topcoder srm 654 div2 500
周赛时遇到的一道比较有意思的题目: Problem Statement There are N rooms in Maki's new house. The rooms are number ...
- TopCoder SRM 590
第一次做TC,不太习惯,各种调试,只做了一题...... Problem Statement Fox Ciel is going to play Gomoku with her friend ...
- Topcoder Arena插件配置和训练指南
一. Arena插件配置 1. 下载Arena 指针:http://community.topcoder.com/tc?module=MyHome 左边Competitions->Algorit ...
随机推荐
- flex 动画笔记
1.不涉及到组件宽度和高度变化的 如果类似showEffect等属性不好使的,直接使用hideEffect.end(); showEffect.play();等这样的用法. 2.涉及到组件宽度和高度变 ...
- flex TweenLite
本贴已在 AS天地会转发,大家可以参考:http://bbs.actionscript3.cn/viewthread.php?tid=11090&pid=91142&page=1&am ...
- vim 操作符命令和位移(如删除和修改)
一.字符删除命令:x,d,D x 删除光标下的字符,前面可以加入命令计数,如:5x 代表删除从当前光标到后面的5个字符,包括空格: X 删除光标前面的一个字符: dw 删除光标下到word后的数据: ...
- 推荐ajaxfilemanager for tiny_mce 比较完善的tiny_mce编辑器的图片上传及图片管理插件PHP版 支持中文
tiny_mce编辑器,我觉得挺简洁.好用的,但就是图片上传的插件是收费的,而且网上找了半天也没有找到开源好用的上传插件. 不过功夫不负有心人,终于还就被我找到一款相当满意的插件. 这个插件的名字叫a ...
- bzoj 2005: [Noi2010]能量采集 筛法||欧拉||莫比乌斯
2005: [Noi2010]能量采集 Time Limit: 10 Sec Memory Limit: 552 MB[Submit][Status][Discuss] Description 栋栋 ...
- Oracle的PL_SQL的结构
--PL/SQL的结构 declare --声明变量和常量关键字 v_name nvarchar2(); v_age integer;--常规变量声明 v_product table_name.col ...
- SpringMVC的优点
SpringMVC的优点 清晰的角色划分:控制器(controller).验证器(validator).命令对象(command obect).表单对象(form object).模型对象(model ...
- Delphi 实现检测线程类TThread是否结束
unit Unit1; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms ...
- php mysqli_get_server_version()函数
php mysqli_get_server_version()函数以整数形式返回MySQL服务器版本. 本文章想大家介绍mysqli_get_server_version 函数的基本使用方法和实例,需 ...
- input 限制输入
只能输入数字 :<input type="text" onkeyup="value=value.replace(/[^\d]/g,'')" /> 只 ...