Educational Codeforces Round 1 D. Igor In the Museum
2015-11-17 15:09
441 查看
D. Igor In the Museum
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked
with '.', impassable cells are marked with '*'. Every two
adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.
At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.
For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture
he can see.
Input
First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) —
the museum dimensions and the number of starting positions to process.
Each of the next n lines contains m symbols
'.', '*' — the description of the museum. It is guaranteed
that all border cells are impassable, so Igor can't go out from the museum.
Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) —
the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.
Output
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.
Sample test(s)
input
output
input
output
仅以此题纪念打铁的南阳。这题与南阳下棋题相似度实在太高……需要注意的是此题一面墙一幅画,而南阳是一个节点一个棋子。转化成模型即是此题一个节点存在四面,与下棋题有一定区别。DFS练手题,别问我南阳为什么会卡这种题。
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <stack>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define N 1005
#define INF 0x3f3f3f3f;
int a
;
int n,m,k;
int idm[N*N];
struct A{
int idx,sum;
}num
;
void dfs(int r,int c,int id,int su){
if (r<1||r>m||c<1||c>n) return;
if (a[r][c]!=1||num[r][c].idx>0) return;
num[r][c].idx=id;
if(a[r+1][c]==0) su++;
if(a[r-1][c]==0) su++;
if(a[r][c+1]==0) su++;
if(a[r][c-1]==0) su++;
num[r][c].sum=su;
for (int dr=-1; dr<=1; dr++) {
for (int dc=-1;dc<=1; dc++) {
if ((dr!=0||dc!=0)&&dr*dc==0) {
idm[id]=max(idm[id],su);
dfs(r+dr, c+dc, id,idm[id]);
}
}
}
}
int main(){
string temp;
while (cin>>n>>m>>k) {
memset(a, 0, sizeof(a));
memset(num, 0, sizeof(num));
memset(idm, 0, sizeof(idm));
for (int j=1; j<=n; j++) {
cin>>temp;
for (int i=1; i<=m; i++) {
if (temp[i-1]=='*') a[i][j]=0;
else a[i][j]=1;
}
}
int idflag=0;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
if (num[j][i].idx==0&&a[j][i]==1)
dfs(j, i, ++idflag, 0);
}
}
int x,y;
while (k--) {
cin>>y>>x;
printf("%d\n",idm[num[x][y].idx]);
}
}
}
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked
with '.', impassable cells are marked with '*'. Every two
adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.
At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.
For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture
he can see.
Input
First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) —
the museum dimensions and the number of starting positions to process.
Each of the next n lines contains m symbols
'.', '*' — the description of the museum. It is guaranteed
that all border cells are impassable, so Igor can't go out from the museum.
Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) —
the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.
Output
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.
Sample test(s)
input
5 6 3 ****** *..*.* ****** *....* ****** 2 2 2 5 4 3
output
6 4 10
input
4 4 1 **** *..* *.** **** 3 2
output
8
仅以此题纪念打铁的南阳。这题与南阳下棋题相似度实在太高……需要注意的是此题一面墙一幅画,而南阳是一个节点一个棋子。转化成模型即是此题一个节点存在四面,与下棋题有一定区别。DFS练手题,别问我南阳为什么会卡这种题。
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <stack>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define N 1005
#define INF 0x3f3f3f3f;
int a
;
int n,m,k;
int idm[N*N];
struct A{
int idx,sum;
}num
;
void dfs(int r,int c,int id,int su){
if (r<1||r>m||c<1||c>n) return;
if (a[r][c]!=1||num[r][c].idx>0) return;
num[r][c].idx=id;
if(a[r+1][c]==0) su++;
if(a[r-1][c]==0) su++;
if(a[r][c+1]==0) su++;
if(a[r][c-1]==0) su++;
num[r][c].sum=su;
for (int dr=-1; dr<=1; dr++) {
for (int dc=-1;dc<=1; dc++) {
if ((dr!=0||dc!=0)&&dr*dc==0) {
idm[id]=max(idm[id],su);
dfs(r+dr, c+dc, id,idm[id]);
}
}
}
}
int main(){
string temp;
while (cin>>n>>m>>k) {
memset(a, 0, sizeof(a));
memset(num, 0, sizeof(num));
memset(idm, 0, sizeof(idm));
for (int j=1; j<=n; j++) {
cin>>temp;
for (int i=1; i<=m; i++) {
if (temp[i-1]=='*') a[i][j]=0;
else a[i][j]=1;
}
}
int idflag=0;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
if (num[j][i].idx==0&&a[j][i]==1)
dfs(j, i, ++idflag, 0);
}
}
int x,y;
while (k--) {
cin>>y>>x;
printf("%d\n",idm[num[x][y].idx]);
}
}
}
相关文章推荐
- Mongo备份还原
- 如何免费试用访问Google
- ubuntu14.04,配置GOPATH(GO语言开发代码存放目录)
- ubuntu14.04,配置GOPATH(GO语言开发代码存放目录)
- ubuntu14.04,安装、配置GO语言开发工具Eclipse!!
- ubuntu14.04,安装、配置GO语言开发工具Eclipse!!
- Datables 服务端分页for DJango
- ORA-0107 invalid username/password;logon denied
- Google Guava EventBus实例与分析
- google guava cache 处理
- 使用google guava做内存缓存
- Google Guava Cache实例与分析
- 使用google guava 实现定时缓存功能
- Google云存储的开放Maven镜像中央仓库(转载)
- golang strconv包使用
- 揭秘 TensorFlow:Google 开源到底开的是什么?
- 2012-2013 Waterloo Local Contest, 13 October, 2012 A题(最短路变形)
- golang 字符 数字 bool 类型
- django小记
- kNN算法 k-Nearest Neighbors algorithm