HDU5995 Kblack loves flag
来源:互联网 发布:北风网的大数据怎样 编辑:程序博客网 时间:2024/06/05 00:21
Kblack loves flag
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 121 Accepted Submission(s): 94
Problem Description
Kblack loves flags, so he has infinite flags in his pocket.
One day, Kblack is given ann∗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.
One day, Kblack is given an
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 variablex 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 integerT refers to the number of testcases.
For each testcase,there is a single line contains 4 integersn,m,k,seed .
Then,you need to generate thek flags' coordinates.
Fori=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)
We have a private variable
The first line contains a single integer
For each testcase,there is a single line contains 4 integers
Then,you need to generate the
For
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>
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
24 2 3 2333 4 4 2333
Sample Output
2 11 0Hintthe 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
http://acm.split.hdu.edu.cn/showproblem.php?pid=5995
水一篇博客吧
#include<bits/stdc++.h>using namespace std;int x[1000006],y[1000006];int vis1[1000006],vis2[1000006];const int _K=50268147,_B=6082187,_P=100000007;int _X;int n,m,k,seed,t;inline int get_rand(int _l,int _r){ _X=((long long)_K*_X+_B)%_P; return _X%(_r-_l+1)+_l;}void Init(){ for (int i=1; i<=k; ++i) { x[i]=get_rand(1,n); vis1[x[i]]=1; y[i]=get_rand(1,m); vis2[y[i]]=1; }}int main(){ scanf("%d",&t); while(t--) { scanf("%d%d%d%d",&n,&m,&k,&seed); memset(vis1,0,sizeof(vis1)); memset(vis2,0,sizeof(vis2)); _X=seed; Init(); int sumx=0,sumy=0; for(int i=1; i<=n; i++) if(!vis1[i]) sumx++; for(int i=1; i<=m; i++) if(!vis2[i]) sumy++; printf("%d %d\n",sumx,sumy); } return 0;}
0 0
- HDU5995 Kblack loves flag
- HDU5995 Kblack loves flag
- HDU5995 Kblack loves flag
- HDU5995 Kblack loves flag
- Kblack loves flag
- bc Kblack loves flag
- BC-【Kblack loves flag】
- Kblack loves flag hdu
- hudu5995 Kblack loves flag
- HDU 5995 Kblack loves flag
- hdu 5995 Kblack loves flag
- hdu 5995 Kblack loves flag
- hdu 5995 Kblack loves flag
- BestCoder Round #90 Kblack loves flag
- 【HDOJ】5995 (BestCoder Round #90)Kblack loves flag
- hdu5995 H
- 【枚举计数】HDU5995Kblack loves flag【BestCoder Round #90】
- FLag
- linux 查看系统,资源,网络,进程,服务等信息
- 深度信念网络(Deep Belief Network)论文
- 源码分析-TreeMap
- 修改Linux内核参数,减少TCP连接中的TIME-WAIT
- mybatis-generatorConfig.xml 文件编写自动生成MAPPER文件
- HDU5995 Kblack loves flag
- 配置Bundle Target
- Android 实现EditText输入数字时每三位加逗号
- 51822 主从机分析1
- SpringMVC
- N-02. 宽带上网设置 ❀ 网康 (NETENTSEC) 防火墙
- 结局的启发
- java web软件了解tomcat
- Mac搭建Java环境