Saddle Point ZOJ - 3955 题意题

Chiaki has an n × m matrix A. Rows are numbered from 1 to n from top to bottom and columns are numbered from 1 to m from left to right. The element in the i-th row and the j-th column is A_i, j.

Let M({i₁, i₂, ..., i_s}, {j₁, j₂, ..., j_t}) be the matrix that results from deleting row i₁, i₂, ..., i_s and column j₁, j₂, ..., j_t of A and f({i₁, i₂, ..., i_s}, {j₁, j₂, ..., j_t}) be the number of saddle points in matrix M({i₁, i₂, ..., i_s}, {j₁, j₂, ..., j_t}).

Chiaki would like to find all the value of f({i₁, i₂, ..., i_s}, {j₁, j₂, ..., j_t}). As the output may be very large ((2ⁿ - 1)(2^m - 1) matrix in total), she is only interested in the value

Note that a saddle point of a matrix is an element which is both the only largest element in its column and the only smallest element in its row.

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first line contains four integers n and m (1 ≤ n, m ≤ 1000) -- the number of rows and the number of columns.

Each of the next n lines contains m integer A_{i, 1}, A_{i, 2}, ..., A_i, m (1 ≤ A_i, j ≤ 10⁶), where A_i, j is the integer in the i-th row and the j-th column.

It is guaranteed that neither the sum of all n nor the sum of all m exceeds 5000.

<h4< dd="">Output

For each test case, output an integer denoting the answer.

<h4< dd="">Sample Input

2
2 2
1 1
1 1
4 5
1 2 3 4 5
6 7 8 9 10
11 12 13 14 15
16 17 18 19 20

<h4< dd="">Sample Output

4
465

这题就是难在读题
我和我队友看了半天这题 觉得这题不能写
后来看题解 知道题意后  这题真的傻逼
题意
   一个n*m的矩阵，问n*m个点能否在去掉某些行、列的情况下，成为马鞍点。
   马鞍点是行中最小 列中最大的元素（严格大于和小于），问所有 点能够成为马鞍点的方式总数。
  然后按每个点算一次贡献就好了
  行中最小  就把每一行中比这个值大的数目 每一次有两种状态 选和不选 
　列中最大  就把每一行中比这个值小的数目 每一次有两种状态 选和不选

 每个点的贡献就是 expmod(2, cnt1) * expmod(2, cnt2) 

 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <cmath>
 #include <algorithm>
 #include <set>
 #include <iostream>
 #include <map>
 #include <stack>
 #include <string>
 #include <vector>
 #define  pi acos(-1.0)
 #define  eps 1e-6
 #define  fi first
 #define  se second
 #define  lson l,m,rt<<1
 #define  rson m+1,r,rt<<1|1
 #define  bug         printf("******\n")
 #define  mem(a,b)    memset(a,b,sizeof(a))
 #define  fuck(x)     cout<<"["<<x<<"]"<<endl
 #define  f(a)        a*a
 #define  sf(n)       scanf("%d", &n)
 #define  sff(a,b)    scanf("%d %d", &a, &b)
 #define  sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
 #define  sffff(a,b,c,d) scanf("%d %d %d %d", &a, &b, &c, &d)
 #define  pf          printf
 #define  FRE(i,a,b)  for(i = a; i <= b; i++)
 #define  FREE(i,a,b) for(i = a; i >= b; i--)
 #define  FRL(i,a,b)  for(i = a; i < b; i++)
 #define  FRLL(i,a,b) for(i = a; i > b; i--)
 #define  FIN         freopen("DATA.txt","r",stdin)
 #define  gcd(a,b)    __gcd(a,b)
 #define  lowbit(x)   x&-x
 #pragma  comment (linker,"/STACK:102400000,102400000")
 using namespace std;
 typedef long long  LL;
 typedef unsigned long long ULL;
 const int INF = 0x7fffffff;
 const int mod = 1e9 + ;
 const int maxn = 1e3 + ;
 int mp[maxn][maxn], L[maxn][maxn], H[maxn][maxn];
 int t, n, m;
 LL expmod(LL a, LL b) {
     LL ret = ;
     while(b) {
         if (b & ) ret = ret * a % mod;
         a = a * a % mod;
         b = b >> ;
     }
     return ret;
 }
 int main() {
     sf(t);
     while(t--) {
         sff(n, m);
         for (int i =  ; i < n ; i++) {
             for (int j =  ; j < m ; j++) {
                 sf(mp[i][j]);
                 L[i][j] = mp[i][j];
                 H[j][i] = mp[i][j];
             }
         }
         for (int i =  ; i < n ; i++) sort(L[i], L[i] + m);
         for (int i =  ; i < m ; i++) sort(H[i], H[i] + n);
         LL ans = ;
         for (int i =  ; i < n ; i++) {
             for (int j =  ; j < m ; j++) {
                 int cnt1 = m - (upper_bound(L[i], L[i] + m, mp[i][j]) - L[i]);
                 int cnt2 = lower_bound(H[j], H[j] + n, mp[i][j]) - H[j];
                 ans = (ans + expmod(, cnt1) * expmod(, cnt2) % mod) % mod;
             }
         }
         printf("%lld\n", ans);
     }
     return ;
 }