結果
| 問題 | No.659 徘徊迷路 |
| ユーザー |
 recososo
|
| 提出日時 | 2022-04-10 02:16:03 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 79 ms / 2,000 ms |
| コード長 | 5,804 bytes |
| コンパイル時間 | 2,126 ms |
| コンパイル使用メモリ | 206,124 KB |
| 最終ジャッジ日時 | 2025-01-28 17:04:46 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 12 |
ソースコード
#include<bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REPR(i, n) for (int i = n - 1; i >= 0; --i)#define FOR(i, m, n) for (int i = m; i < n; ++i)#define FORR(i, m, n) for (int i = m; i >= n; --i)#define ALL(v) (v).begin(),(v).end()#define ALLR(v) (v).rbegin(),(v).rend()#define fi first#define se second#define PB push_back#define EB emplace_backusing P = pair<ll, ll>;template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}};template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];};template<typename T>void debug(const vector<T>&v){debug(v,v.size());}template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};const ll INF=1LL<<60;const int inf=(1<<30)-1;// const int mod=1e9+7;const int mod=998244353;int dx[8]={1,0,-1,0,-1,-1,1,1};int dy[8]={0,1,0,-1,-1,1,-1,1};template< class T >struct Matrix {vector< vector< T > > A;Matrix() {}Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}Matrix(size_t n) : A(n, vector< T >(n, 0)) {};size_t height() const {return (A.size());}size_t width() const {return (A[0].size());}inline const vector< T > &operator[](int k) const {return (A.at(k));}inline vector< T > &operator[](int k) {return (A.at(k));}static Matrix I(size_t n) {Matrix mat(n);for(int i = 0; i < n; i++) mat[i][i] = 1;return (mat);}Matrix &operator+=(const Matrix &B) {size_t n = height(), m = width();assert(n == B.height() && m == B.width());for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)(*this)[i][j] += B[i][j];return (*this);}Matrix &operator-=(const Matrix &B) {size_t n = height(), m = width();assert(n == B.height() && m == B.width());for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)(*this)[i][j] -= B[i][j];return (*this);}Matrix &operator*=(const Matrix &B) {size_t n = height(), m = B.width(), p = width();assert(p == B.height());vector< vector< T > > C(n, vector< T >(m, 0));for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)for(int k = 0; k < p; k++)C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);A.swap(C);return (*this);}Matrix &operator^=(long long k) {Matrix B = Matrix::I(height());while(k > 0) {if(k & 1) B *= *this;*this *= *this;k >>= 1LL;}A.swap(B.A);return (*this);}Matrix operator+(const Matrix &B) const {return (Matrix(*this) += B);}Matrix operator-(const Matrix &B) const {return (Matrix(*this) -= B);}Matrix operator*(const Matrix &B) const {return (Matrix(*this) *= B);}Matrix operator^(const long long k) const {return (Matrix(*this) ^= k);}T determinant() {Matrix B(*this);assert(width() == height());T ret = 1;for(int i = 0; i < width(); i++) {int idx = -1;for(int j = i; j < width(); j++) {if(B[j][i] != 0) idx = j;}if(idx == -1) return (0);if(i != idx) {ret *= -1;swap(B[i], B[idx]);}ret *= B[i][i];T vv = B[i][i];for(int j = 0; j < width(); j++) {B[i][j] /= vv;}for(int j = i + 1; j < width(); j++) {T a = B[j][i];for(int k = 0; k < width(); k++) {B[j][k] -= B[i][k] * a;}}}return (ret);}};int main(){cin.tie(0);ios::sync_with_stdio(false);int r,c,t;cin >> r >> c >> t;int sx,sy,gx,gy;cin >> sx >> sy >> gx >> gy;vector<string> s(r);REP(i,r) cin >> s[i];Matrix<double> a(r*c),b(r*c,1);REP(i,r) REP(j,c){if(s[i][j]=='#') continue;int cnt=0;REP(k,4){int x=i+dx[k],y=j+dy[k];if(s[x][y]!='#') cnt++;}if(cnt==0){a[i*c+j][i*c+j]=1;continue;}REP(k,4){int x=i+dx[k],y=j+dy[k];if(s[x][y]!='#'){a[x*c+y][i*c+j]=double(1)/cnt;}}}b[sx*c+sy][0]=1;Matrix<double> res=(a^t)*b;cout << fixed << setprecision(10) << res[gx*c+gy][0] << endl;}