hdu 4772Zhuge Liang's Password(水题)
来源:互联网 发布:北京市人口普查数据库 编辑:程序博客网 时间:2024/05/18 03:12
Zhuge Liang's Password
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2552 Accepted Submission(s): 1636
Problem Description
In the ancient three kingdom period, Zhuge Liang was the most famous and smart military leader. His enemy was Sima Yi, the military leader of Kingdom Wei. Sima Yi always looked stupid when fighting against Zhuge Liang. But it was Sima Yi who laughed to the end.
Zhuge Liang had led his army across the mountain Qi to attack Kingdom Wei for six times, which all failed. Because of the long journey, the food supply was a big problem. Zhuge Liang invented a kind of bull-like or horse-like robot called "Wooden Bull & Floating Horse"(in abbreviation, WBFH) to carry food for the army. Every WBFH had a password lock. A WBFH would move if and only if the soldier entered the password. Zhuge Liang was always worrying about everything and always did trivial things by himself. Since Ma Su lost Jieting and was killed by him, he didn't trust anyone's IQ any more. He thought the soldiers might forget the password of WBFHs. So he made two password cards for each WBFH. If the soldier operating a WBFH forgot the password or got killed, the password still could be regained by those two password cards.
Once, Sima Yi defeated Zhuge Liang again, and got many WBFHs in the battle field. But he didn't know the passwords. Ma Su's son betrayed Zhuge Liang and came to Sima Yi. He told Sima Yi the way to figure out the password by two cards.He said to Sima Yi:
"A password card is a square grid consisting of N×N cells.In each cell,there is a number. Two password cards are of the same size. If you overlap them, you get two numbers in each cell. Those two numbers in a cell may be the same or not the same. You can turn a card by 0 degree, 90 degrees, 180 degrees, or 270 degrees, and then overlap it on another. But flipping is not allowed. The maximum amount of cells which contains two equal numbers after overlapping, is the password. Please note that the two cards must be totally overlapped. You can't only overlap a part of them."
Now you should find a way to figure out the password for each WBFH as quickly as possible.
Zhuge Liang had led his army across the mountain Qi to attack Kingdom Wei for six times, which all failed. Because of the long journey, the food supply was a big problem. Zhuge Liang invented a kind of bull-like or horse-like robot called "Wooden Bull & Floating Horse"(in abbreviation, WBFH) to carry food for the army. Every WBFH had a password lock. A WBFH would move if and only if the soldier entered the password. Zhuge Liang was always worrying about everything and always did trivial things by himself. Since Ma Su lost Jieting and was killed by him, he didn't trust anyone's IQ any more. He thought the soldiers might forget the password of WBFHs. So he made two password cards for each WBFH. If the soldier operating a WBFH forgot the password or got killed, the password still could be regained by those two password cards.
Once, Sima Yi defeated Zhuge Liang again, and got many WBFHs in the battle field. But he didn't know the passwords. Ma Su's son betrayed Zhuge Liang and came to Sima Yi. He told Sima Yi the way to figure out the password by two cards.He said to Sima Yi:
"A password card is a square grid consisting of N×N cells.In each cell,there is a number. Two password cards are of the same size. If you overlap them, you get two numbers in each cell. Those two numbers in a cell may be the same or not the same. You can turn a card by 0 degree, 90 degrees, 180 degrees, or 270 degrees, and then overlap it on another. But flipping is not allowed. The maximum amount of cells which contains two equal numbers after overlapping, is the password. Please note that the two cards must be totally overlapped. You can't only overlap a part of them."
Now you should find a way to figure out the password for each WBFH as quickly as possible.
Input
There are several test cases.
In each test case:
The first line contains a integer N, meaning that the password card is a N×N grid(0<N<=30).
Then a N×N matrix follows ,describing a password card. Each element is an integer in a cell.
Then another N×N matrix follows, describing another password card.
Those integers are all no less than 0 and less than 300.
The input ends with N = 0
In each test case:
The first line contains a integer N, meaning that the password card is a N×N grid(0<N<=30).
Then a N×N matrix follows ,describing a password card. Each element is an integer in a cell.
Then another N×N matrix follows, describing another password card.
Those integers are all no less than 0 and less than 300.
The input ends with N = 0
Output
For each test case, print the password.
Sample Input
21 23 45 67 8210 2030 1390 1013 210
Sample Output
02
Source
2013 Asia Hangzhou Regional Contest
Recommend
We have carefully selected several similar problems for you: 6119 6118 6117 6116 6115
#include <iostream>#include <algorithm>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <string.h>#include <map>#include <set>#include <queue>#include <deque>#include <list>#include <bitset>#include <stack>#include <stdlib.h>#define lowbit(x) (x&-x)#define e exp(1.0)const int mod=1e9+7;//ios::sync_with_stdio(false);// auto start = clock();// cout << (clock() - start) / (double)CLOCKS_PER_SEC;typedef long long ll;typedef long long LL;using namespace std;const int maxn=31;int a[maxn][maxn],b[maxn][maxn],c[maxn][maxn];int ans;int n;int rotate(){ for(int i=0;i<n;i++) for(int j=0;j<n;j++) c[i][j]=b[j][n-i-1]; int sum=0; for(int i=0;i<n;i++) for(int j=0;j<n;j++) { if(a[i][j]==c[i][j]) sum++; b[i][j]=c[i][j]; } return sum;}int main(){ while(cin>>n && n) { for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>a[i][j]; for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>b[i][j]; ans=0; int t=4; while(t--) ans=max(ans,rotate()); cout<<ans<<endl; } return 0;}
阅读全文
0 0
- hdu 4772 Zhuge Liang's Password(水题)
- hdu 4772Zhuge Liang's Password(水题)
- hdu 4772 Zhuge Liang's Password
- Hdu 4772 Zhuge Liang's Password
- HDU 4772 Zhuge Liang's Password
- HDU 4772 --Zhuge Liang's Password
- hdu:4772 Zhuge Liang's Password
- hdu 4772 Zhuge Liang's Password
- hdu 4772 Zhuge Liang's Password
- HDU-4772-Zhuge Liang's Password
- HDU 4772 Zhuge Liang's Password 水
- HDU 4772 Zhuge Liang's Password
- HDU 4772 Zhuge Liang's Password
- HDU 4772 Zhuge Liang's Password
- HDU 4772 Zhuge Liang's Password
- hdu 4772 Zhuge Liang's Password【模拟】水题
- HDU 4772 Zhuge Liang's Password (简单模拟题)
- HDU 4772 Zhuge Liang's Password(暴力)
- 大话成像之数字成像系统培训
- 安居客app端抓取数据包 分析数据包的签名 编写爬虫脚本
- [总结]java真是博大精深(四)
- HDUOJ 1213 How Many Tables
- linux && boot
- hdu 4772Zhuge Liang's Password(水题)
- CSS3动画理解与应用
- 应用程序的8个关键性能指标以及测量方法
- Ext JS 6:将日期下拉字段修改为日期时间下拉字段(三)
- 《剑指offer》牛客网java题解-数值的整数次方
- <线段树系列1> codevs 1080 线段树练习
- 百度之星初赛B——Chess
- MyBatis 示例之存储过程(二)
- matlab求各点间距离