提出 #27995668

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;

const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

void solve() {
    int H, W;
    cin >> H >> W;
    vector<string> grid(H);
    vector<vector<int>> score(H, vector<int>(W, 0));
    score[0][0] = 1;
    rep(i,H) cin >> grid[i];

    queue<pair<int,int>> que;
    que.push({0,0});
    while (!que.empty()) {
        auto p = que.front();
        que.pop();
        int x = p.first, y = p.second;
        if (0 <= x+1 && x+1 < H && grid[x+1][y] == '.') {
            if (score[x+1][y] == 0) {
                que.push({x+1, y});
                chmax(score[x+1][y], score[x][y]+1);
            }
        }
        if (0 <= y+1 && y+1 < H && grid[x][y+1] == '.') {
            if (score[x][y+1] == 0) {
                que.push({x, y+1});
                chmax(score[x][y+1], score[x][y]+1);
            }
        }
    }

    int ans = 0;
    rep(i,H) rep(j,W) chmax(ans, score[i][j]);
    cout << ans << endl;
}

int main() {
    solve();
    return 0;
}

提出情報

ジャッジ結果