提出詳細
ソースコード
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
#include <numeric>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x),greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define sprint(X) printf("%f\n", (X)) // 小数点の出力
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
#define case(X) cout << "Case #" << (X) + 1 << ":" << "\n"
static const int INF = 1e+9+7;
vll A;
void solve(vvll N, ll i, ll j, ll count){
if(N[i][j] == 0){
count++;
N[i][j] = 3;
solve(N, i+1, j, count);
solve(N, i-1, j, count);
solve(N, i, j+1, count);
solve(N, i, j-1, count);
}
else if(N[i][j] == 2){
A.pb(count+1);
return;
}
else return;
}
int main(){
ll T;
cin >> T;
rep(p,0,T){
case(p);
ll W,H;
cin >> W >> H;
ll si,sj;
vvll N(H+2, vll(W+2, 3));
rep(i,0,H){
rep(j,0,W){
cin >> N[i+1][j+1];
if(N[i+1][j+1] == 1){
si = i+1;
sj = j+1;
}
}
}
A.clear();
solve(N,si+1,sj,0);
solve(N,si-1,sj,0);
solve(N,si,sj+1,0);
solve(N,si,sj-1,0);
if(A.empty()) print(0);
else print(vec_min(A));
}
return 0;
}
提出情報
提出出力結果
テストケース情報