OJ Board

Code: Select all

#include <stdio.h>
#include <string.h>

char str[35][85];
int train[100];
int index_i;

void Akromon(const int i, const int j){
    
    str[i][j]='#';

   
    if(i-1>=0&&str[i-1][j]==' ') {//printf("diving into:i-1 j\n");
            Akromon(i-1,j);}
    if(str[i-1][j+1]==' ') {//printf("diving into:i-1 j+1\n");
            Akromon(i-1,j+1);}
    if(i-1>=0&&j-1>=0&&str[i-1][j-1]==' ') {//printf("diving into:i-1 j-1\n");
            Akromon(i-1,j-1);}

    if(j-1>=0&&str[i][j-1]==' ') {//printf("diving into:i j-1\n");
            Akromon(i,j-1);}
    if(str[i][j+1]==' ') {//printf("diving into:i j+1\n");
            Akromon(i,j+1);}

    if(i+1<=index_i-1&&str[i+1][j]==' ') {//printf("diving into:i+1 j\n");
            Akromon(i+1,j);}
    if(i+1<=index_i-1&&str[i+1][j+1]==' ') {//printf("diving into:i+1 j+1\n");
            Akromon(i+1,j+1);}
    if(i+1<=index_i-1&&j-1>=0 && str[i+1][j-1]==' ') {//printf("diving into:i+1 j-1\n");
            Akromon(i+1,j-1);}
return;
}


int main(){

int T, t;

while(scanf("%d",&T)==1){

    //getchar();
    memset(train,0,sizeof(train));
    memset(str,'\0',sizeof(str));
    for(t=1;t<=T;t++){

        index_i=-1;

        do{
            index_i++;
            gets(&str[index_i][0]);
                train[index_i]=strlen(&str[index_i][0]);
    
        }while(str[index_i][0]!='_');
    
        for(int i=0; i<index_i;i++){
    
            for(int j=0;j<train[i];j++){
                if(str[i][j]=='*')
                        Akromon(i,j);
            }
        }


        for(int i=0; i<index_i;i++){

            for(int j=0;j<train[i];j++)
                printf("%c",str[i][j]);

        printf("\n");
        }

    
    }
}


return 0;
}

Code: Select all

code removed

Code: Select all

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

char M[35][85];
int V[35];

int dx[]={-1,-1,-1,0,0,1,1,1};
int dy[]={-1,0,1,-1,1,-1,0,1};


void BFS(int n, int m)
{
    queue<int>X;
    queue<int>Y;
    X.push(n);
    Y.push(m);
    M[n][m] = '#';
    while (!X.empty() && !Y.empty())
    {
        n = X.front();
        m = Y.front();
        for (int i=0; i<8; i++)
        {
            if (n >= 0 && n <= 30 && m >= 0 && m <= 80 && isspace(M[n+dx[i]][m+dy[i]]))
            {
                X.push(n+dx[i]);
                Y.push(m+dy[i]);
                M[n+dx[i]][m+dy[i]] = '#';
            }
        }
        X.pop();
        Y.pop();
    }
}


int main()
{
    int n1;
    string s;
    cin >> n1;
    for (int tc=1; tc<=n1; tc++)
    {
        memset (M, 0, sizeof(M));
        int n = -1;
        while (getline(cin, s))
        {
            n++;
            V[n] = s.length();
            for (int i=0; i<s.length(); i++)
            {
                M[n][i] = s[i];
            }
            if (s[0] == '_')
                break;
        }
        for (int i=0; i<=n; i++)
        {
            for (int j=0; j<V[i]; j++)
            {
                if (M[i][j] == '*')
                {
                    BFS(i, j);
                }
            }
        }
        for (int i=0; i<=n; i++)
        {
            for (int j=0; j<V[i]; j++)
            {
                cout << M[i][j];
            }
            cout << endl;
        }
    }
    return 0;
}