We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Cavity Map
  5. Discussions

Cavity Map

  • _CAAI + 10 comments

    Instead of using two arrays, compare the center matrix (formed excluding boundary values) while printing the matrix..! ;)

    int n,i,j;
scanf("%d",&n);
int a[n][n];
for(i=0;i<n;i++)
{
    for(j=0;j<n;j++)
    {
        scanf("%1d",&a[i][j]);
    }
}
for(i=0;i<n;i++)
{
    for(j=0;j<n;j++)
    {
        if( (i>=1)&&(i<n-1) && (j>=1)&&(j<n-1) )
        {
         if( (a[i][j] > a[i-1][j]) && (a[i][j] > a[i][j+1])      
         && (a[i][j] > a[i+1][j]) && (a[i][j] > a[i][j-1]) )
            printf("X");
         else
            printf("%d",a[i][j]);
        }
        else
            printf("%d",a[i][j]);
    }
    printf("\n");
}
    • inkhl + 0 comments

      Thanks!

    • SushmaN + 1 comment

      if we replace %1d with %d... why the input contains extra zeros?? what is the significance of 1? can you please explain..

      • phoenixRises + 2 comments

        %1d signifies read 1 digit at a time. If you write %d, one entire row of digits will be read at once, which is not what you want.

        • SushmaN + 0 comments

          okay.. thank u

        • amanakmsd + 0 comments

          Thanks!

    • patomack + 0 comments

      Nifty!

    • priyank042 + 0 comments

      yeah..!! Thanks.....

    • amanakmsd + 0 comments

      Thanks! Very helpful

    • sb2098 + 0 comments

      coool!

    • 160216733001_cs + 0 comments

      nice

    • ME_170070246 + 0 comments

      thank you for the code

    • psatishkumar720 + 0 comments
      [deleted]
    • hardikkamboj1 + 1 comment

      I had also gone with the same logic..but the problem is that some test cases contain spaces whereas some test cases don't have spaces.. Please help me on that..

      • zalak_delvadiya + 1 comment

        Same problem....... Any solution?????

        • frankdeadlycaste + 0 comments

          def cavityMap(grid): M = grid N = len(M)

          for i in range(N):
    for j in range(N):
        if not ( i  in [0,N-1] or j  in [0,N-1] ):
            c = M[i][j]
            if M[i-1][j] < c and M[i+1][j] < c and M[i][j-1] < c and M[i][j+1] < c :
                temp = M[i]
                temp = list(temp)
                temp[j] = 'X'
                temp2=''
                for j in temp:
                            temp2+=j
                M[i]  = temp2
return M