pdp forum

Κώδικας: Επιλογή όλων

//NO WARRANTY :P :P
#include <stdio.h>

//#define DEBUG
//#define VERBOSE 

const int MAX_SZ =1001;

char field[MAX_SZ][MAX_SZ];
int M=0, N=0, Mf=0, Nf=0, C=0;

void traverse(int X, int Y);

#ifdef DEBUG
void printfield(void) {
    printf("Inside printfield\n");
    for(int i=0; i < M; i++) {
        for (int j=0; j< N; j++) {
            printf("%c", field[i][j]);
        }
        printf("\n");
    }
}
#endif

int main()
{
    register int i=0;
    FILE *fin=fopen("fire.in", "r"), *fout=fopen("fire.out", "w");
    fscanf(fin, "%d %d", &N, &M);
    fscanf(fin, "%d %d", &Nf, &Mf);
    
    for(i=0; i<M; i++) {
        fscanf(fin, "%s", &field[i]);
    }
    Mf--; Nf--;

#ifdef DEBUG    
    printf("M=%d N=%d Mf=%d Nf=%d\n", M, N, Mf, Nf);
    printfield();
#endif
    traverse(Mf, Nf);

    fprintf(fout, "%d\n", C);

    fclose(fin);
    fclose(fout);

    return 0;
}

void traverse(int X, int Y)
{
#ifdef VERBOSE
    printf("X=%d, Y=%d, field[X][Y] = %c\n", X, Y, field[X][Y]);
#endif
    //VISIT
    C++;
    field[X][Y] = '*';
#ifdef DEBUG 
    printfield();
#endif
    if(X != 0) {
        if(field[X-1][Y] == '.') { 
#ifdef VERBOSE
            printf("x!=0 if\n");
#endif
            traverse(X-1,Y);
        }
    }
    if(Y != 0) {
        if(field[X][Y-1] == '.') {
#ifdef VERBOSE
            printf("y!=0 if\n");
#endif
            traverse(X, Y-1);
        }
    }
    if(X < M-1) {
        if(field[X+1][Y] == '.') {
#ifdef VERBOSE
            printf("x<m-1\n");
#endif
            traverse(X+1, Y);
        }
    }
    if(Y < N-1) {
        if(field[X][Y+1] == '.') {
#ifdef VERBOSE
            printf("y<n-1\n");
#endif
            traverse(X, Y+1);
        }
    }

}

Κώδικας: Επιλογή όλων

#include <iostream>
#include <fstream>
using namespace std;

int N,M;

struct Point
{
   int x,y;
};

char mat[1001][1001];
Point Q[1000011];
int b;
int main ()
{
    ifstream fin ("fire.in");
    ofstream fout ("fire.out");
    fin >> N >> M;
    Point s;
    fin >> s.x >> s.y;
    
    for (int j=1;j<=M;++j)
    for (int i=1;i<=N;++i)
    fin >> mat[i][j];
    fin.close();
    
    int head=1,tail=1;
    Q[1]=s;
    mat[s.x][s.y]='@';
    b=1;
    while (head!=tail+1)
    {
       Point t=Q[head];
       ++head;
       
       if (t.x+1<=N && mat[t.x+1][t.y]=='.')
       {
          ++b;
          mat[t.x+1][t.y]='@';
          ++tail;
          Q[tail].x=t.x+1;
          Q[tail].y=t.y;
       }
       if (t.x-1>=1 && mat[t.x-1][t.y]=='.')
       {
          ++b;
          mat[t.x-1][t.y]='@';
          ++tail;
          Q[tail].x=t.x-1;
          Q[tail].y=t.y;
       }
       if (t.y+1<=M && mat[t.x][t.y+1]=='.')
       {
          ++b;
          mat[t.x][t.y+1]='@';
          ++tail;
          Q[tail].x=t.x;
          Q[tail].y=t.y+1;
       }
       if (t.y-1>=1 && mat[t.x][t.y-1]=='.')
       {
          ++b;
          mat[t.x][t.y-1]='@';
          ++tail;
          Q[tail].x=t.x;
          Q[tail].y=t.y-1;
       }
    }
    
    
    fout << b << endl;
    
    return 0;
}