fork(1) download
copy 
  1.     #include <stdio.h>
  2.     #define MAXC 10
  3.     #define MAXR 10
  4.  
  5.     void floodfill(char map[][MAXC+1], int i, int j, int r, int c);
  6.     int checklocation(char map[][MAXC+1], int i, int j, int r, int c);
  7.  
  8.     int main() {
  9. //        FILE* ifp = fopen("bunnies.in", "r");
  10.  
  11.         printf("start\n");
  12.  
  13.         int numcases, loop;
  14. //        fscanf(ifp, "%d", &numcases);
  15.         scanf("%d", &numcases);
  16.  
  17.         printf("read cases: %d\n", numcases);
  18.  
  19.         for (loop=0; loop<numcases; loop++) {
  20.             int r, c, i=0, j=0;
  21.  
  22. //            fscanf(ifp, "%d%d", &r, &c);
  23.             scanf("%d%d", &r, &c);
  24.             //printf("\nRows = %d Cols = %d\n", r,c); //debug comment out
  25.             char map[r][c];
  26.  
  27.             //Read in input
  28.             for(i=0; i<r; i++) {
  29. //                fgetc(ifp);
  30.                   getchar();
  31.  
  32.                     for (j=0; j<c; j++) {
  33. //                        map[i][j] = fgetc(ifp);
  34.                         map[i][j] = getchar();
  35.                         //printf("%c", map[i][j]); //test input read comment out
  36.                     }
  37.                // printf("\n"); //test input read comment out
  38.             }
  39.  
  40.             printf("read input\n");
  41.  
  42.             int broken = 0; //to keep track if floodfill already occured
  43.  
  44.             for (i=0; i<r; i++) {
  45.                // if (broken == 1)
  46.                 //    continue;
  47.  
  48.                 for (j=0; j<c; j++) {
  49.                    // if (broken == 1)
  50.                     //    continue;
  51.  
  52.                     //the whole loop only looks for P then floodfills
  53.                     if(map[i][j] == 'P') {
  54.                         map[i][j] = '_';
  55.                         printf("calling floodfill on %d, %d", i, j);
  56.                         floodfill(map, i, j, r, c);
  57.                      //   broken = 1;
  58.                     }
  59.  
  60.                    // printf("%c", map[i][j]); //test floodfill, comment out later
  61.                 }
  62.  
  63.                 //printf("\n"); //test floodfill, comment out later
  64.             }
  65.  
  66.             printf("after floodfill\n");
  67.  
  68.             int found = 0;
  69.  
  70.             //searches for C, calls checklocation when found
  71.             for (i=0; i<r; i++) {
  72.                 for(j=0; j<c; j++) {
  73.                     if (map[i][j] == 'C')
  74.                         found = checklocation(map, i,j, r, c);
  75.                 }
  76.             }
  77.  
  78.             if (found == 1)
  79.                 printf("yes\n");
  80.             else
  81.                 printf("no\n");
  82.  
  83.         }
  84.  
  85. //    fclose(ifp);
  86.     return 0;
  87.  
  88.     }
  89.  
  90.  
  91.     //Pass map pointer, position in array i,j and row/column numbers
  92.     void floodfill(char map[][MAXC+1], int i, int j, int r, int c) {
  93.  
  94.     //printf("looking at: [%d][%d]\n", i,j); //debug comment out later
  95.  
  96.     //'base case' that deals with out of bounds
  97.     if (i<0 || j<0 || i>=r || j>=c)
  98.         return;
  99.  
  100.     if (map[i][j] == '_') {
  101.         map[i][j] = 'P';
  102.  
  103.       floodfill(map, r, c, i, j+1); //check right
  104.       floodfill(map, r, c, i, j-1); //check left
  105.       floodfill(map, r, c, i+1, j); //check below
  106.       floodfill(map, r, c, i-1, j); //check above
  107.     }
  108.  
  109.     //printf("%c", map[i][j]);
  110.  
  111.     }
  112.  
  113.     //Same parameters as floodfill
  114.     int checklocation(char map[][MAXC+1], int i, int j, int r, int c) {
  115.  
  116.     //these if statements check for p in each location around and
  117.     //makes sure the coordinate is in bounds
  118.     if ((i-1>=0) && (i-1 < r) && (j>=0) && (j < c) && (map[i-1][j] == 'P'))
  119.         return 1;
  120.  
  121.     else if ((i+1>=0) && (i+1 < r) && (j>=0) && (j < c) && (map[i+1][j] == 'P'))
  122.         return 1;
  123.  
  124.     else if ((i>=0) && (i < r) && (j+1>=0) && (j+1 < c) && (map[i][j+1] == 'P'))
  125.         return 1;
  126.  
  127.     else if ((i>=0) && (i < r) && (j-1>=0) && (j-1 < c) && (map[i][j-1] == 'P'))
  128.         return 1;
  129.  
  130.     else
  131.         return 0;
  132.  
  133.     }
Success #stdin #stdout 0.01s 1724KB
comments (?)
stdin
copy 
5
1 2
PC
2 1
P
C
2 2
P#
#C
2 2
P_
C_
8 7
__P____
####_##
_____#_
_____#C
##_###_
_____#_
___#_#_
___#___
5 7
__P____
####_##
_____#_
_____#C
##_###_
stdout
copy 
start
read cases: 5
read input
calling floodfill on 0, 0after floodfill
yes
read input
calling floodfill on 0, 0after floodfill
yes
read input
calling floodfill on 0, 0after floodfill
no
read input
calling floodfill on 0, 0after floodfill
yes
read input
calling floodfill on 0, 2after floodfill
no
https://ideone.com/oGh6S
language:
C (gcc 8.3)
created:
11 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!