Advertisement
SuitNdtie

game1

May 6th, 2019
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.68 KB | None | 0 0
  1. #include<stdio.h>
  2.  
  3. int board[510][510];
  4. int turntable[1010];
  5. bool visited[510][510];
  6.  
  7. int max(int a,int b){
  8.     return (a > b ? a : b);
  9. }
  10. int n,m;
  11. void cal(int I,int J,int turn)
  12. {
  13.     if(visited[I][J])return;
  14.     if(board[I][J] == 1)return;
  15.     if(I >= n || J >= m)return;
  16.     visited[I][J] = true;
  17.     turntable[turn]++;
  18.     cal(I,J+1,turn+1);
  19.     cal(I+1,J,turn+1);
  20. }
  21.  
  22. int main()
  23. {
  24.    
  25.     scanf("%d %d",&n,&m);
  26.     for(int i = n - 1 ; i >= 0 ; i --){
  27.         for(int j = 0 ; j < m ; j ++){
  28.             scanf("%d",&board[i][j]);
  29.         }
  30.     }
  31.     cal(0,0,0);
  32.     int ans = 0;
  33.     for(int i = 0 ; i < 1010 ; i ++){
  34.         if(turntable[i] == 0)break;
  35.         ans += (turntable[i]*turntable[i]);
  36.     }
  37.     printf("%d",ans);
  38.     return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement