11044 - Searching for Nessy

原创 2013年06月21日 12:56:20

 Searching for Nessy 

The Loch Ness Monsterisa mysterious and unidentified animal said to inhabit Loch Ness, 
a large deep freshwaterloch near the cityof Inverness in northern Scotland. Nessie is usually categorized as a type oflake monster.

http://en.wikipedia.org/wiki/Loch_Ness_Monster


In July 2003, the BBC reported an extensive investigation of Loch Ness by a BBCteam, using 600 separate sonar beams, found no trace of any ¨sea monster¨(i.e., any large animal, known or unknown) in the loch. The BBC team concludedthat Nessie does not exist. Now we want to repeat the experiment.


Given a grid of n rows and m columns representing the loch, 6$ \le$n,m$ \le$10000, find the minimum numbers of sonar beams you must put in the square such that we can control every position in thegrid, with the following conditions:

  • one sonar occupies one position in the grid; the sonar beam controls its own cell and the contiguous cells;
  • the border cells do not need to be controlled, because Nessy cannot hide there (she is too big).

For example,


$\textstyle \parbox{.5\textwidth}{\begin{center}\mbox{}\epsfbox{p11044.eps}\end{center}}$$\textstyle \parbox{.49\textwidth}{\begin{center}\mbox{}\epsfbox{p11044a.eps}\end{center}}$

\epsfbox{p11044b.eps}

where X represents a sonar, and the shaded cells are controlled bytheir sonar beams; the last figure gives us a solution.

Input 

The first line of the input contains an integer, t, indicating the number of test cases. For eachtest case, there is a line with two numbers separated by blanks,6$ \le$n,m$ \le$10000, that is, the size of the grid (n rows andm columns).

Output 

For each test case, the output should consist of one line showing the minimumnumber of sonars that verifies the conditions above.

Sample Input 

 
3
6 6
7 7
9 13

Sample Output 

 
4
4
12
#include<stdio.h>
int main(void)
{	
	int t;
	int n,m;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		printf("%d\n",(n/3)*(m/3));
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

uva 11044 - Searching for Nessy

Searching for Nessy  The Loch Ness Monsteris a mysterious and unidentified animal said to...

Uva 11044 Searching for Nessy

Searching for Nessy  The Loch Ness Monsteris a mysterious and unidentified animal said to...

UVa 11044 Searching for Nessy (water ver.)

11044 - Searching for Nessy Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=co...

UVA11044 Searching for Nessy

Searching for Nessy  The Loch Ness Monsterisa mysterious and unidentified animal said to ...

uva 11044 Searching for Nessy

uva 11044 Searching for Nessy  题目大意:跳过一堆背景,就是求m*n的网格中能放最多几个3*3的正方形。 解题思路:(m/3)*(n/3) #inclu...

Searching for Nessy

水题。。。。太水了。。水得一手好水。。   Searching for Nessy  The Loch Ness Monsteris a mys...

EndNote X7 Online search error searching for records的解决方法

EndNote X7 Online search error searching for records的解决方法在使用EndNote的时候,选择连接到Web of Science的服务器后进行搜索,...

Searching for a String in Multiple Files

常用命令: grep -r -n -B1 -A1 --include=*.c strstr * findstr /S "MB_ICONHAND" *.h   Ever need to sea...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)