Searching for Nessy
Searching for Nessy |
The Loch Ness Monsteris a mysterious and unidentified animal said to inhabit Loch Ness,
a large deep freshwater loch near the city of Inverness in northern Scotland. Nessie is usually categorized as a type of lake monster.
http://en.wikipedia.org/wiki/Loch_Ness_Monster
In July 2003, the BBC reported an extensive investigation of Loch Ness by a BBC team, 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 concluded that Nessie does not exist. Now we want to repeat the experiment.
Given a grid of n rows and m columns representing the loch, 6n, m10000, find the minimum number s of sonar beams you must put in the square such that we can control every position in the grid, 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,
where X represents a sonar, and the shaded cells are controlled by their 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 each test case, there is a line with two numbers separated by blanks, 6n, m10000, that is, the size of the grid (nrows and m columns).
Output
For each test case, the output should consist of one line showing the minimum number of sonars that verifies the conditions above.
Sample Input
3 6 6 7 7 9 13
Sample Output
4 4 12
这题目如果按 示例x的布局来看还真有些麻烦,但是换种角度就会很容易,x覆盖的范围是3*3 如果行和列都能被3
整除,其结果x的个数自然就是行*列/9 ,因为这种情况不会产生覆盖,自然x最少。 对于行 如果不能被3整除,又与边界的四周允许不被控制(其暗含行或列能-1 或-2),那么行-1看能不能被3整除,如果能行-1就行,如果不能 行-2肯定能被3整除。对于列也同样如此
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
int main()
{
int i,j,n,m,s,t;
cin>>t;
while(t--)
{
cin>>n>>m;
if(n%3!=0)
{
if((n-1)%3==0)
{
n-=1;
}else
{
n-=2;
}
}
if(m%3!=0)
{
if((m-1)%3==0)
{
m-=1;
}else
{
m-=2;
}
}
cout<<n*m/9<<endl;
}
return 0;
}