Isosceles Right Triangles 坐标暴力枚举

Isosceles Right Triangles

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 126    Accepted Submission(s): 74

Problem Description

Apple is a very careless girl. One day, the teacher leaves her a problem which has stuck her for a long while. Apple turns to you with this problem: counting the number of the isosceles right triangles composed with various letters in a capital letters matrix. And there are only two forms of the isosceles right triangle in the matrix:
Form 1:
Two right sides are both parallel with the sides of the matrix. e.g.
Form 2:
The hypotenuse is parallel with one side of the matrix. e.g.


Notice that all the isosceles right triangles should contain more than or equal to three letters.

Input

The first line of the input file contains a single integer t ( 1 ≤ t ≤ 20 ), the number of test cases, followed by the input data for each test case. The first line of each test case consists of one integer K ( 1 ≤ K ≤ 50). K is the size of matrix. The follow K lines, each lines has K capital letters, describe a K*K character matrix. There is no space both at the beginning and the end of all the lines.

 

Output

For each collection, output "Case k:", where k is the number of the test case. To every letter appeared in the matrix, it is required to count the number of the isosceles and right triangles in the matrix composed with it. Moreover, the output should be arrayed in the nature order of these letters in a dictionary. A blank should be left between the letter and its corresponding number. We confirm that the result are less than 2^31.

 

Sample Input

  
  

   
   2 
3 
AAB 
ABB 
BBC 
4 
AABB
ABBB 
BBBB
BBBB
  
  
  
  

   
   

  
  

Sample Output

  
  

   
   Case 1: 
A 1 
B 3 
C 0 
Case 2: 
A 1 
B 50
  
  

直接暴力枚举顶点，判断八个方向。需要注意的是题目给你的2种不同三角形的情况

#include <iostream> #include <cmath> using namespace std; char ch[51][51]; //下面的坐标要处理好 第一个字符ch[0][0]的坐标是0,0 但是ch[1][0]的坐标是0,1 y坐标是向下的 int f[8][4]={​{-1,-1,1,0},{0,-1,1,1},{1,-1,0,1},{1,0,-1,1},{-1,1,1,0},{-1,0,1,1},{-1,-1,0,1},{0,-1,-1,1}}; int n,d; int dfs(int dep, int x1, int y1, int x, int y, int a, int b, char cha) { if( 0<=a+x1&&a+x1<n && 0<=b+y1&&b+y1<n && ch[a+x1][b+y1]==cha ) a+=x1,b+=y1; else return 0; int ta=a,tb=b; for(int i=0;i<dep;i++) { if( 0<=a+x&&a+x<n && 0<=b+y&&b+y<n && ch[a+x][b+y]==cha ) { a=a+x; b=b+y; } else return 0; } return 1+dfs(dep+d, x1, y1, x, y, ta, tb, cha); } int main(){ int t,i,j,k,res[250],use[250],cnt=1; scanf("%d",&t); while(t--) { memset(res,-1,sizeof(res)); memset(use,0,sizeof(use)); scanf("%d",&n); for(i=0;i<n;i++) scanf("%s",ch[i]); for(i=0;i<n;i++) for(j=0;j<n;j++) for(k=0;k<8;k++){ if(k%2==0) d=2; else d=1; res[ch[i][j]]+=dfs(d,f[k][0],f[k][1],f[k][2],f[k][3],i,j,ch[i][j]); //d用来处理 2种不同三角形的情况 一种第二层有2个 一种第二层有3个 use[ch[i][j]]=1; } printf("Case %d:/n",cnt++); for(i=0;i<250;i++) if(use[i]==1) printf("%c %d/n",i,res[i]+1); } //system("pause"); return 0; }