Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int board[510][510];
- int turntable[1010];
- bool visited[510][510];
- int max(int a,int b){
- return (a > b ? a : b);
- }
- int n,m;
- void cal(int I,int J,int turn)
- {
- if(visited[I][J])return;
- if(board[I][J] == 1)return;
- if(I >= n || J >= m)return;
- visited[I][J] = true;
- turntable[turn]++;
- cal(I,J+1,turn+1);
- cal(I+1,J,turn+1);
- }
- int main()
- {
- scanf("%d %d",&n,&m);
- for(int i = n - 1 ; i >= 0 ; i --){
- for(int j = 0 ; j < m ; j ++){
- scanf("%d",&board[i][j]);
- }
- }
- cal(0,0,0);
- int ans = 0;
- for(int i = 0 ; i < 1010 ; i ++){
- if(turntable[i] == 0)break;
- ans += (turntable[i]*turntable[i]);
- }
- printf("%d",ans);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement