Submission #3426570

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */


string solve(){
    int H,W; cin >> H >> W;
    vector<vector<char>> S(H,vector<char>(W));
    for(auto& vec:S) for(auto& in:vec) cin >> in;
    
    vector<vector<int>> G(H,vector<int>(W,-1));
    G[H-1][W-1] = 0;
    
    int di[3] = {1,1,0};
    int dj[3] = {0,1,1};
    for(int i = H-1; i >= 0; i--){
        for(int j = W-1; j >= 0; j--){
            if(S[i][j] == '#') continue;
            if(G[i][j] != -1) continue;
            set<int> st;
            for(int k = 0; k < 3;k++){
                int ni = i + di[k];
                int nj = j + dj[k];
                if(ni >= H || nj >= W) continue;
                if(S[ni][nj] == '#') continue;
                st.insert(G[ni][nj]);
            }
            for(int k = 0; k <= 4;k++){
                if(st.count(k)) continue;
                G[i][j] = k;
                break;
            }
        }
    }
    //cout << G << endl;
    if(G[0][0]) return "First";
    else return "Second";
}
int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}

Submission Info

Judge Result