2019 JUST Programming Contest J. Grid Beauty

J. Grid Beauty

time limit per test

3.0 s

memory limit per test

256 MB

input

standard input

output

standard output

You are given a grid gg consisting of nn rows each of which is divided into mm columns.

You can swap any two integers in the same row infinitely, but you cannot swap two integers from two different rows.

Your task is to maximize the beauty of the grid by rearranging integers in each row. The beauty of the grid is the number of pairs (i,j ) (1<i≤n,1≤j≤m ) such that gi,jgi,j is equal to gi−1,j (i.e. gi,j≡gi−1 ).

Input

The first line contains an integer T (1≤T≤5 ) specifying the number of test cases.

The first line of each test case contains two integers nn and mm (1≤n,m≤103 ), giving the number of rows and columns in the grid, respectively.

Then nn lines follow, each line contains mm integers, giving the grid. All values in the grid are between 1 and 108 (inclusive).

Output

For each test case, print a single line containing the beauty of the grid.

Example

Input

 

2
2 3
1 2 3
4 1 2
3 3
5 7 9
3 2 9
5 3 2

Output

 

2
3

Note

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

解题思路：这道题就是给说如果a[i][j] = a[i-1][j]则是美丽的，问你说最多有几个；

这道题我是卡着时间过的，用map超时了，用unorder_map变快了，可能有其他人有很多更好的做法，下面是我的做法；

 #include<iostream>
 #include<stdio.h>
 #include<unordered_map>    //unordered_map的头文件；
 #include<algorithm>
 using namespace std;

 int n ;
 int row , col;
 int a[][];
 unordered_map<int,int>flag;   //用来记录当前行出现了数字出现多少个；
 unordered_map<int,int>flag1;  //用来记录下一行的数字出现多少个；
 int ans =  ;

 int main()
 {
     scanf("%d",&n);
     while(n--)
     {
         ans = ;
         scanf("%d%d",&row,&col);
         for(int i =  ;i < row ;i++)
         {
             for(int j =  ; j < col ;j++)
             {
                 scanf("%d",&a[i][j]);
             }

         }
         for(int i =  ; i < row- ;i++ )
         {
             for(int j =  ; j < col ;j++)
             {

                 flag[a[i][j]]++;   //统计每个数字出现的个数；
                 flag1[a[i+][j]]++;  //统计下一行每个数字出现的个数；
             }
             for(int j =  ; j < col ; j++)
             {

                 if(flag1[a[i+][j]]>)  //如果这一行的数字在下一行出现过；
                 {
                     ans += min(flag[a[i+][j]],flag1[a[i+][j]]);
 //不断取这一行和下一行的较小者；
                     flag1[a[i+][j]] = ;
 //并将统计过的数字个数重新置为0；
                 }
             }
             for(int j =  ; j < col ;j++)
             {
                 flag[a[i][j]] = ;
                 flag1[a[i+][j]] = ;
 //初始化，方便后面的行的比较，比如比较了第一和第二行，现在比较第二和第三行，所以每个数字出现的个数要重新置为0；
             }
         }
         printf("%d\n",ans);
     }
     return  ;
 }