lightoj 1010 - Knights in Chessboard（找规律）

1010 - Knights in Chessboard

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

Given an m x n chessboard where you want to place chess knights. You have to find the number of maximum knights that can be placed in the chessboard such that no two knights attack each other.

Those who are not familiar with chess knights, note that a chess knight can attack 8 positions in the board as shown in the picture below.

Input

Input starts with an integer T (≤ 41000), denoting the number of test cases.

Each case contains two integers m, n (1 ≤ m, n ≤ 200). Here m and n corresponds to the number of rows and the number of columns of the board respectively.

Output

For each case, print the case number and maximum number of knights that can be placed in the board considering the above restrictions.

Sample Input	Output for Sample Input
3 8 8 3 7 4 10	Case 1: 32 Case 2: 11 Case 3: 20

 

---

PROBLEM SETTER: JANE ALAM JAN

本以为应该是搜索剪枝...复杂度实在是太高、、原来只是找规律。

题目分析（http://blog.csdn.net/chen_ze_hua/arti

cle/details/51508406）

题意：

给你一个n*m的棋盘，问你棋盘上最多放多少个马，使得任意两个马都不会互相攻击。

m,n都很大，因此用搜索肯定是行不通的，只能找规律，首先，我们会发现棋子放在白格子或者黑格子都不会互相攻击,但是有特殊情况需要考虑，一种就是如果之后一行或者一列，很显然这一行或者一列都可以放棋子，如果行数或者列数为2，那么我们可以将一个田字格放满，然后隔一个田字格不放任何东西，然后在继续放，以此类推。

代码：

#include<bits/stdc++.h>
using namespace std;
int main(void)
{
    int t, ca = 1, row, col, ans;
    cin >> t;
    while(t--)
    {
        scanf("%d%d", &row, &col);
        if(row == 1 || col == 1) ans = row*col;
        else if(row == 2 || col == 2)
        {
            if(col == 2) swap(row, col);
            if(row == 2)
            {
                if(col%4 < 2) ans = (col/4)*4+(col%4)*2;
                else ans = (col/4)*4+4;
            }
        }
        else ans = (row*col+1)/2;
        printf("Case %d: %d\n", ca++, ans);
    }
    return 0;
}