Submission #21299016

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename A,typename B>inline bool chmin(A &a,const B &b){if(a>b){a=b;return true;}else{return false;}}
template<typename A,typename B>inline bool chmax(A &a,const B &b){if(a<b){a=b;return true;}else{return false;}}

int main(){
    int H,W,X,Y;
    cin >> H >> W >> Y >> X;
    X--;
    Y--;
    char c[H][W];
    REP(i,H)REP(j,W)cin >> c[i][j];
    int ans = 0;
    for(int i=Y; i<H; i++){
        if(c[i][X] =='#')break;
        ans++;
    }
    for(int i=Y; i>=0; i--){
        if(c[i][X] =='#')break;
        ans++;
    }
    for(int j=X; j<W; j++){
        if(c[Y][j] =='#')break;
        ans++;
    }
    for(int j=X; j>=0; j--){
        if(c[Y][j] =='#')break;
        ans++;
    }
    cout << ans-3 << endl;
}

Submission Info

Judge Result