Submission #1131182

---

Source Code Expand

#include<queue>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
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(...) fprintf(stderr, __VA_ARGS__)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}

int N;
char F[511][511];
int D[1<<9];

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

    memset(D, 0x3f, sizeof D);
    const int INF = D[0];
    int s = 0, c = 0;
    REP (i, N) REP (j, N) {
	if (F[i][j] == '#') s |= 1<<c;
	c++;
    }

    D[s] = 0;
    queue<int> qu; qu.push(s);
    while (!qu.empty()) {
	int v = qu.front(); qu.pop();
	REP (i, N) REP (j, N) {
	    int w = v;
	    REP (k, N) {
		bool b = v & (1 << (k + i*N));
		if (b) w |= 1 << (j + k*N);
		else w &= ~(1 << (j + k*N));
	    }

	    if (D[w] > D[v] + 1) {
		D[w] = D[v] + 1;
		qu.push(w);
	    }
	}
    }

    int m = N * N;
    int ans = D[(1<<m)-1];
    if (ans == INF) ans = -1;
    printf("%d\n", ans);

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
                    ^
./Main.cpp:30:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     REP (i, N) scanf("%s", F[i]);
                                 ^

Judge Result