zoukankan      html  css  js  c++  java
  • ACM-ICPC 2018 南京赛区网络预赛 B. The writing on the wall

    题目链接:https://nanti.jisuanke.com/t/30991

    •  2000ms
    •  262144K
     

    Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan).

    However, his owner CXY thinks that take-away food is unhealthy and expensive. So she demands her hamster to fulfill a mission before ordering the take-away food. Then she brings the hamster to a wall.

    The wall is covered by square ceramic tiles, which can be regarded as a n * mnm grid. CXY wants her hamster to calculate the number of rectangles composed of these tiles.

    For example, the following 3 * 333 wall contains 3636 rectangles:

    Such problem is quite easy for little hamster to solve, and he quickly manages to get the answer.

    Seeing this, the evil girl CXY picks up a brush and paint some tiles into black, claiming that only those rectangles which don't contain any black tiles are valid and the poor hamster should only calculate the number of the valid rectangles. Now the hamster feels the problem is too difficult for him to solve, so he decides to turn to your help. Please help this little hamster solve the problem so that he can enjoy his favorite fried chicken.

    Input

    There are multiple test cases in the input data.

    The first line contains a integer TT : number of test cases. T le 5T5.

    For each test case, the first line contains 33 integers n , m , kn,m,k , denoting that the wall is a n imes mn×m grid, and the number of the black tiles is kk.

    For the next kk lines, each line contains 22 integers: x yx y ,denoting a black tile is on the xx-th row and yy-th column. It's guaranteed that all the positions of the black tiles are distinct.

    For all the test cases,

    1 le n le 10^5,1le m le 1001n105,1m100,

    0 le k le 10^5 , 1 le x le n, 1 le y le m0k105,1xn,1ym.

    It's guaranteed that at most 22 test cases satisfy that n ge 20000n20000.

    Output

    For each test case, print "Case #xx: ansans" (without quotes) in a single line, where xx is the test case number and ansans is the answer for this test case.

    Hint

    The second test case looks as follows:

    样例输入

    2
    3 3 0
    3 3 1
    2 2

    样例输出

    Case #1: 36
    Case #2: 20

    题目来源

    ACM-ICPC 2018 南京赛区网络预赛

    当初的梦想实现了吗,事到如今只好放弃吗~
  • 相关阅读:
    设计模式4---策略模式
    设计模式3---抽象工厂模式
    209. Minimum Size Subarray Sum(双指针)
    174. Dungeon Game(动态规划)
    二分查找
    74. Search a 2D Matrix(二分查找,剑指offer 1)
    81. Search in Rotated Sorted Array II
    33. Search in Rotated Sorted Array(二分查找)
    34. Search for a Range (二分查找)
    35. Search Insert Position(二分查找)
  • 原文地址:https://www.cnblogs.com/caijiaming/p/9720735.html
Copyright © 2011-2022 走看看