結果
| 問題 | No.86 TVザッピング(2) |
| ユーザー |
 heno239
|
| 提出日時 | 2020-02-11 19:45:09 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 246 ms / 5,000 ms |
| コード長 | 4,348 bytes |
| コンパイル時間 | 1,467 ms |
| コンパイル使用メモリ | 114,768 KB |
| 実行使用メモリ | 7,624 KB |
| 最終ジャッジ日時 | 2024-12-25 12:52:19 |
| 合計ジャッジ時間 | 2,521 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;const ll mod = 1000000007;const ll INF = (1e+18) + 7;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-6;const ld pi = acos(-1.0);//typedef vector<vector<ll>> mat;typedef vector<int> vec;void debug(vector<int> &v) {rep(i, v.size()) {if (i > 0)cout << " ";cout << v[i];}cout << endl;}ll mod_pow(ll a, ll n,ll m=mod) {ll res = 1;while (n) {if (n & 1)res = res * a%m;a = a * a%m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n%mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, int n) {if (n == 0)return modint(1);modint res = (a*a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1<<18;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}struct uf {private:vector<int> par, ran;public:uf(int n) {par.resize(n, 0);ran.resize(n, 0);rep(i, n) {par[i] = i;}}int find(int x) {if (par[x] == x)return x;else return par[x] = find(par[x]);}void unite(int x, int y) {x = find(x), y = find(y);if (x == y)return;if (ran[x] < ran[y]) {par[x] = y;}else {par[y] = x;if (ran[x] == ran[y])ran[x]++;}}bool same(int x, int y) {return find(x) == find(y);}};int dx[4] = { 0,1,0,-1 };int dy[4] = { 1,0,-1,0 };char mp[102][102];bool exi[102][102];void solve() {int h, w; cin >> h >> w;int cnt = 0;rep(i, h + 2)rep(j, w + 2)mp[i][j] = '#';rep1(i, h)rep1(j,w) {cin >> mp[i][j];if (mp[i][j] == '.')cnt++;}rep1(i, h)rep1(j, w) {if (mp[i][j] == '#')continue;rep(k, 4) {rep1(x, h)rep1(y, w)exi[x][y] = false;int x = i, y = j, d = k;exi[i][j] = true;int tmp = 1;while (true) {if (mp[x + dx[d]][y + dy[d]] == '#'||exi[x+dx[d]][y+dy[d]])break;while (mp[x+dx[d]][y+dy[d]]!='#'&&!exi[x+dx[d]][y+dy[d]]) {x += dx[d]; y += dy[d];exi[x][y] = true; tmp++;}d--;if (d < 0)d += 4;}if (x + dx[d] == i && y + dy[d] == j && tmp == cnt) {cout << "YES" << endl; return;}d++;if (d == 4)d = 0;if (x + dx[d] == i && y + dy[d] == j && tmp == cnt) {cout << "YES" << endl; return;}}}cout << "NO" << endl;}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f(); //init();//init();//int t; cin >> t; rep(i, t)solve();//while(cin>>w>>h,w)solve();solve();stopreturn 0;}