zoj 2975 Kinds of Fuwas(超时题)
来源:互联网 发布:矩阵理论教材推荐 编辑:程序博客网 时间:2024/05/21 11:13
In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well as becoming a festival for people all over the world.
The official mascots of Beijing 2008 Olympic Games are Fuwa, which are named as Beibei, Jingjing, Haunhuan, Yingying and Nini. Fuwa embodies the natural characteristics of the four most popular animals in China -- Fish, Panda, Tibetan Antelope, Swallow -- and the Olympic Flame. To popularize the official mascots of Beijing 2008 Olympic Games, some volunteers make a PC game with Fuwa.
As shown in the picture, the game has a matrix of Fuwa. The player is to find out all the rectangles whose four corners have the same kind of Fuwa. You should make a program to help the player calculate how many such rectangles exist in the Fuwa matrix.
Input
Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 50) which is the number of test cases. And it will be followed by T consecutive test cases.
The first line of each test case has two integers M and N (1 <= M, N <= 250), which means the number of rows and columns of the Fuwa matrix. And then there are M lines, each has N characters, denote the matrix. The characters -- 'B' 'J' 'H' 'Y' 'N' -- each denotes one kind of Fuwa.
Output
Results should be directed to standard output. The output of each test case should be a single integer in one line, which is the number of the rectangles whose four corners have the same kind of Fuwa.
Sample Input
22 2BBBB5 6BJHYNBBHBYYHBNBYNNJNBYNNBHBYYH
Sample Output
18
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1974
比赛的时候怎么就想不到这么简单的方法呢。。。
#include<iostream>#include<algorithm>#include<string>#include<map>#include<vector>#include<cmath>#include<queue>#include<string.h>#include<stdlib.h>#include<cstdio>#define ll long longusing namespace std;char x[251][251];int main(){ int t; cin>>t; while(t--){ int n,m; cin>>n>>m; for(int i=0;i<n;++i){ for(int j=0;j<m;++j){ cin>>x[i][j]; } } int s=0; for(int i=0;i<n;++i){ for(int j=i+1;j<n;++j){ int a=0,b=0,c=0,d=0,e=0; for(int k=0;k<m;++k){ if(x[i][k]==x[j][k]){ if(x[i][k]=='B') a++; else if(x[i][k]=='J') b++; else if(x[i][k]=='H') c++; else if(x[i][k]=='Y') d++; else if(x[i][k]=='N') e++; } } s+=a*(a-1)/2+b*(b-1)/2+c*(c-1)/2+d*(d-1)/2+e*(e-1)/2; } } cout<<s<<endl; } return 0;}
- zoj 2975 Kinds of Fuwas(超时题)
- zoj 2975 Kinds of Fuwas(数学题)
- ZOJ 2975Kinds of Fuwas(暴力)
- ZOJ - 2975 Kinds of Fuwas
- zoj 2975 Kinds of Fuwas
- zoj 2975 Kinds of Fuwas
- ZOJ - 2975 Kinds of Fuwas
- ZOJ 2975 Kinds of Fuwas
- zoj 2975 Kinds of Fuwas
- zoj 2975 Kinds of Fuwas
- ZOJ 2975 Kinds of Fuwas
- ZOJ 2975Kinds of Fuwas
- 【简单数学】ZOJ 2975 Kinds of Fuwas
- ZOJ 2975 Kinds of Fuwas【思维】
- Kinds of Fuwas ——zoj 2975
- 哈理工2015暑假集训 zoj 2975 Kinds of Fuwas
- ZOJ 2975-K - Kinds of Fuwas-暴力+bitset
- ZOJ-2975-Kinds of Fuwas【5th浙江省赛】【暴力】
- hdu 5093 Battle ships(二分匹配)
- static和extern对变量和函数的作用
- LeetCode (16) Valid Palindrome (回文)
- 直方图常用函数简介(C++)
- MTK Android Driver知识大全
- zoj 2975 Kinds of Fuwas(超时题)
- Oracle数据库学习笔记四——存储过程的值传递和引用传递
- 数据库上机作业4
- 括号匹配(二) 区间DP
- iOS截图
- HDU 3191 + HDU 1688(次短路)
- Socket编程中的强制关闭与优雅关闭及相关socket选项
- 日拱一卒(四十七)
- 集体智慧编程chapter 2提供推荐<寻找相似性的用户>