結果

問題 No.86 TVザッピング(2)
ユーザー keikei
提出日時 2018-04-28 01:46:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,727 ms / 5,000 ms
コード長 4,684 bytes
コンパイル時間 2,091 ms
コンパイル使用メモリ 176,072 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-25 12:52:01
合計ジャッジ時間 4,825 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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;
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:https://yukicoder.me/problems/no/86>
============================================================
yuki
NMN×M
yuki
yuki
yuki
90
N, M,
=================================================================
=============================================================
================================================================
*/
int dy[4] = {0,-1,0,1};
int dx[4] = {1,0,-1,0};
void dfs(pii p,int dir,int dep,vector<vector<int>>& visited,vector<vector<char>>& masu,const pii& from,const int& cnt,bool& ok){
if(dep == cnt-1){
for(int i = 0; i <= 1; i++){
int ny = p.first + dy[(dir+i)%4], nx = p.second + dx[(dir+i)%4];
if(from == pii(ny,nx)) ok = true;
}
return;
}
visited[p.first][p.second] = 1;
for(int i = 0; i <= 1;i++){
int ny = p.first + dy[(dir+i)%4], nx = p.second + dx[(dir+i)%4];
if(visited[ny][nx] == 1) continue;
if(masu[ny][nx] == '#') continue;
dfs({ny,nx},(dir+i)%4,dep+1,visited,masu,from,cnt,ok);
break;
}
visited[p.first][p.second] = 0;
return;
}
string solve(){
ll N,M; cin >> N >> M;
vector<vector<char>> masu(N+2,vector<char>(M+2,'#'));
int cnt = 0;
for(int i = 1; i <= N;i++) for(int j = 1; j <= M;j++){
cin >> masu[i][j];
if(masu[i][j] == '.') cnt++;
}
bool ok = false;
vector<vector<int>> visited(N+2,vector<int>(M+2,0));
// cout << masu << endl;
for(int i = 1; i <= N;i++){
for(int j = 1; j <= M;j++){
if(masu[i][j] == '#') continue;
for(int k = 0; k < 4;k++){
pii from = {i,j};
dfs({i,j},k,0,visited,masu,{i,j},cnt,ok);
if(ok) return "YES";
}
}
}
return "NO";
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0