poj 1977
来源:互联网 发布:淘宝售前要做什么 编辑:程序博客网 时间:2024/06/05 17:26
Odd Loving Bakers
Time Limit: 2000MS Memory Limit: 30000KTotal Submissions: 1499 Accepted: 480
Description
There is a group of N bakers in the town of Utopia. These bakers hold a monthly celebration in which they award a prize to some of the luckier among themselves. These lucky guys are chosen as follows:
In the beginning there are some chalk marks on some of the bakers' houses. Each baker has a list of his/her favorite bakers. After each celebration each of the winners puts a chalk mark on the house of all the bakers in his/her favorite list. Before each celebration those bakers with an odd number of chalk marks on their house will be chosen as winners. As there will be a great prize for the winners of the tth celebration, you are asked to find the number of its winners.
In the beginning there are some chalk marks on some of the bakers' houses. Each baker has a list of his/her favorite bakers. After each celebration each of the winners puts a chalk mark on the house of all the bakers in his/her favorite list. Before each celebration those bakers with an odd number of chalk marks on their house will be chosen as winners. As there will be a great prize for the winners of the tth celebration, you are asked to find the number of its winners.
Input
The first line of the input contains a single integer X (1 <= X <= 11), the number of test cases, followed by the input data for each test case. The input for each test case will be as follows:
The first line of each instance contains two integers n (the number of bakers) and t (the number of the celebration we want the winners of).
1 <= n <= 100
1 <= t <= 1,000,000,000
The next n lines of the instance each describe a baker. In each of these lines first comes the name of the baker (names are lower case strings of no more than 20 characters without spaces), then comes the number of chalk marks initially on the baker's house, then comes the number of bakers in this baker's favorite list, and after that come the names of the bakers in this baker's list.
The first line of each instance contains two integers n (the number of bakers) and t (the number of the celebration we want the winners of).
1 <= n <= 100
1 <= t <= 1,000,000,000
The next n lines of the instance each describe a baker. In each of these lines first comes the name of the baker (names are lower case strings of no more than 20 characters without spaces), then comes the number of chalk marks initially on the baker's house, then comes the number of bakers in this baker's favorite list, and after that come the names of the bakers in this baker's list.
Output
There should be one line per test case. For each test case write a line containing a single integer, the number of the winners of the t-th celebration.
Sample Input
23 2bessie 2 3 bessie linda marymary 1 1 lindalinda 0 1 bessie2 2siavosh 1 2 siavosh mohammad mohammad 1 0
Sample Output
20
Source
Tehran Sharif 2004 Preliminary
分析:这题一开始看不出什么算法,不过看到t和n都不是小数字,让我想起矩阵的幂。。。于是,推导,把一开始被标记偶数的记为假,奇数为真,开一个bool型矩阵,如果i会标记j,则d[i][j]=1,于是发现每次被标记的为
(x,y,z){(1 0 0),(0 1 0),(0 0 1)}+(x,y,z){(z b c),(d e f),(g h i)}=(x,y,z){(a^1 b c),(d e^1 f),(g h i^1)}由于只与奇偶性相关,所以把+改为^;
答案=(x,y,z){(a^1 b c),(d e^1 f),(g h i^1)}^t
代码(好慢的说):
- poj 1977
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- 使用mplayer查看摄像头和luvcview保存YUV图像视频的播放
- SQLServer字符串批量拆分得方法
- 测试
- YUY2(YUV) 与 RGB 格式说明及转换程序
- The 7th Southwest Jiao Tong University Programming Contest—— Critical codes for selected problems
- poj 1977
- 实习。。。
- The import javax.servlet cannot be resolved
- JUnit: Hamcrest 使用
- JSTL标签库配置详细方法
- 一份比较详细的DOS命令说明!
- HW面试心得
- 为什么应该去上大学而不是去创业
- 女人真是可怕的动物