HDU5995 Kblack loves flag

Kblack loves flag

                                                             Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                             Total Submission(s): 312    Accepted Submission(s): 225

Problem Description

Kblack loves flags, so he has infinite flags in his pocket.

One day, Kblack is given an  n∗m  chessboard and he decides to plant flags on the chessboard where the position of each flag is described as a coordinate  (x,y) , which means that the flag is planted at the  x th line of the  y th row.

After planting the flags, Kblack feels sorry for those lines and rows that have no flags planted on, so he would like to know that how many lines and rows there are that have no flags planted on.

Well, Kblack, unlike you, has a date tonight, so he leaves the problem to you. please resolve the problem for him.

 

Input

You should generate the input data in your programme.

We have a private variable  x  in the generation,which equals to  seed  initially.When you call for a random number ranged from  [l,r] ,the generation will trans  x  into  (50268147x+6082187) mod 100000007 .And then,it will return  x mod (r−l+1)+l .

The first line contains a single integer  T  refers to the number of testcases.

For each testcase,there is a single line contains 4 integers  n,m,k,seed .

Then,you need to generate the  k  flags' coordinates.

For  i=1⋯k ,firstly generate a random number in the range of  [1,n] .Then generate a random number in the range of  [1,m] .

You can also copy the following code and run "Init" to generate the x[],y[] (only for C++ players).

<pre>
const int _K=50268147,_B=6082187,_P=100000007;
int _X;
inline int get_rand(int _l,int _r){
  _X=((long long)_K*_X+_B)%_P;
  return _X%(_r-_l+1)+_l;
}
int n,m,k,seed;
int x[1000001],y[1000001];
void Init(){
  scanf("%d%d%d%d",&n,&m,&k,&seed);
  _X=seed;
  for (int i=1;i<=k;++i)
    x[i]=get_rand(1,n),
    y[i]=get_rand(1,m);
}
</pre>

(1≤T≤7) , (1≤n,m≤1000000) , (0≤k≤1000000) , (0≤seed<100000007)

 

Output

For each testcase,print a single line contained two integers,which respectively represent the number of lines and rows that have no flags planted.

 

Sample Input

  
  

   
   2
4 2 3 233
3 4 4 2333
  
  

 

Sample Output

  
  

   
   2 1
1 0


   
   

    
    

     
     Hint
    
    
the flags in the first case:$\left(4,2\right)$,$\left(1,2\right)$,$\left(1,2\right)$

the flags in the second case:$\left(2,1 \right)$,$\left(2,3\right)$,$\left(3,4\right)$,$\left(3,2\right)$


   
   
   
    
  
  

 

Source

BestCoder Round #90

如果你看懂题意了，那我可以很负责任地告诉你，这道题很简单。题目描述中也给了你一个产生随机数的随机函数，那就知道了这些数的横纵坐标，给你特定的横纵坐标界限（分别是0到n，0到m），最后问你分别有几个横纵坐标的值没有出现过。

用两个标记数组就可以搞定了

#include <iostream>
#include <cstring>
#include <string>
#include<stdio.h>
using namespace std;
const int _K=50268147,_B=6082187,_P=100000007;
int _X;
inline int get_rand(int _l,int _r){
  _X=((long long)_K*_X+_B)%_P;
  return _X%(_r-_l+1)+_l;
}
int n,m,k,seed;
int x[1000001],y[1000001];
void Init(){
  scanf("%d%d%d%d",&n,&m,&k,&seed);
  _X=seed;
  for (int i=1;i<=k;++i)
    x[i]=get_rand(1,n),
    y[i]=get_rand(1,m);
}
int t[1000005],tt[1000005];//标记数组
int main()
{
    int en;
    cin>>en;
    while(en--)
    {
        memset(t,0,sizeof(t));
        memset(tt,0,sizeof(tt));
        int i;
        int a=0;
        int b=0;
        Init();
        for(i=1;i<=k;i++)
        {
            t[x[i]]=1;
            tt[y[i]]=1;
        }
        for(i=1;i<=n;i++)
            if(t[i]==0)
            a++;
        for(i=1;i<=m;i++)
            if(tt[i]==0)
            b++;
        cout<<a<<" "<<b<<endl;
    }
    return 0;
}