Submission #595230

---

Source Code Expand

#include<queue>
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...) fprintf(stderr, s)

template<class T> inline void amin(T &a, const T &b) { if (b<a) a=b; }
template<class T> inline void amax(T &a, const T &b) { if (a<b) a=b; }

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

int H, W;
char F[99][99];
int D[99][99];

bool in(int y, int x) {
    return 0 <= y && y < H && 0 <= x && x < W;
}

int bfs(char g, bool b) {
    memset(D, 0x3f, sizeof D);
    queue<int> Y, X;
    REP (i, H) REP (j, W) if (F[i][j] == 'S') {
	Y.push(i);
	X.push(j);
	D[i][j] = 0;
    }

    while (Y.size()) {
	int y = Y.front(); Y.pop();
	int x = X.front(); X.pop();
	REP (d, 4) {
	    int yy = y + dy[d];
	    int xx = x + dx[d];
	    if (in(yy, xx) && D[yy][xx] > D[y][x] + 1) {
		if ((b && (F[yy][xx] == '.' || F[yy][xx] == g)) || (!b && F[yy][xx] != '#')) {
		    D[yy][xx] = D[y][x] + 1;
		    Y.push(yy);
		    X.push(xx);
		}
	    }
	}
    }
	
    REP (i, H) REP (j, W) if (F[i][j] == g) {
	if (D[i][j] > 10000) return D[i][j];
	
	if (b) {
	    int y = i, x = j;
	    while (D[y][x] > 1) {
		REP (d, 4) {
		    int yy = y + dy[d];
		    int xx = x + dx[d];
		    if (in(yy, xx) && F[yy][xx] == '.' && D[yy][xx] == D[y][x] - 1) {
			y = yy;
			x = xx;
			F[yy][xx] = g^('a'-'A');
			break;
		    }
		}
	    }
	}

	return D[i][j];
    }
    return D[98][98];
}

int main() {
    scanf("%d%d", &H, &W);
    REP (i, H) scanf("%s", F[i]);

    int lenA = bfs('A', false);
    int lenB = bfs('B', false);

    if (lenA == D[98][98] || lenB == D[98][98]) {
	puts("NA");
    } else if (lenB == bfs('B', true) && lenA == bfs('A', true)) {
	REP (i, H) puts(F[i]);
    } else {
	REP (i, H) REP (j, W) if (F[i][j] == 'a' || F[i][j] == 'b') F[i][j] = '.';
	if (lenA == bfs('A', true) && lenB == bfs('B', true)) {
	    REP (i, H) puts(F[i]);	    
	} else {
	    puts("NA");
	}
    }

    
    

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:81:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:82:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result