#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1613" #include "../../template/template.hpp" // #include "../../tree/tree-hash.hpp" using namespace Nyaan; // https://kimiyuki.net/writeups/algo-etc-icpc-2016-domestic-f/ #define whole(f, x, ...) \ ([&](decltype((x)) y) { return (f)(begin(y), end(y), ##__VA_ARGS__); })(x) template <typename T, typename X> auto vectors(T a, X x) { return vector<T>(x, a); } template <typename T, typename X, typename Y, typename... Zs> auto vectors(T a, X x, Y y, Zs... zs) { auto cont = vectors(a, y, zs...); return vector<decltype(cont)>(x, cont); } const int dy[] = {-1, 1, 0, 0, -1, 1, -1, 1}; const int dx[] = {0, 0, 1, -1, -1, 1, 1, -1}; vector<vector<bool> > load_image() { int h, w; cin >> h >> w; if (h == 0 and w == 0) return vector<vector<bool> >(); vector<vector<bool> > f = vectors(false, h + 2, w + 2); rep(y, h) rep(x, w) { char c; cin >> c; f[y + 1][x + 1] = c == '#'; } return f; } vector<set<int> > make_tree(vector<vector<bool> > const& f) { int h = f.size(); int w = f.front().size(); vector<vector<int> > k = vectors(-1, h, w); vector<set<int> > g; function<void(int, int, int)> dfs = [&](int y, int x, int cur_k) { k[y][x] = cur_k; rep(i, f[y][x] ? 8 : 4) { int ny = y + dy[i]; int nx = x + dx[i]; if (ny < 0 or h <= ny or nx < 0 or w <= nx) continue; if (f[ny][nx] == f[y][x]) { if (k[ny][nx] == -1) { dfs(ny, nx, cur_k); } } else { if (k[ny][nx] != -1) { g[k[ny][nx]].insert(k[y][x]); } } } }; rep(y, h) rep(x, w) if (k[y][x] == -1) { g.emplace_back(); dfs(y, x, g.size() - 1); } return g; } using Hash = typename TreeHash<vvi>::Hash; Hash tree_hash(vector<set<int> > f) { vvi g(sz(f)); rep(i, sz(f)) { each(x, f[i]) { g[i].push_back(x); g[x].push_back(i); } } TreeHash hash(g); return hash.hash[0]; } void Nyaan::solve() { while (true) { auto g1 = load_image(); if (g1.empty()) exit(0); auto g2 = load_image(); auto t1 = make_tree(g1); auto t2 = make_tree(g2); auto h1 = tree_hash(t1); auto h2 = tree_hash(t2); out(h1 == h2 ? "yes" : "no"); } }
#line 1 "verify/verify-aoj-other/aoj-1613.test.cpp" #define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1613" #line 2 "template/template.hpp" using namespace std; // intrinstic #include <immintrin.h> #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cctype> #include <cfenv> #include <cfloat> #include <chrono> #include <cinttypes> #include <climits> #include <cmath> #include <complex> #include <cstdarg> #include <cstddef> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <initializer_list> #include <iomanip> #include <ios> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <streambuf> #include <string> #include <tuple> #include <type_traits> #include <typeinfo> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> // utility #line 1 "template/util.hpp" namespace Nyaan { using ll = long long; using i64 = long long; using u64 = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; template <typename T> using V = vector<T>; template <typename T> using VV = vector<vector<T>>; using vi = vector<int>; using vl = vector<long long>; using vd = V<double>; using vs = V<string>; using vvi = vector<vector<int>>; using vvl = vector<vector<long long>>; template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>; template <typename T, typename U> struct P : pair<T, U> { template <typename... Args> P(Args... args) : pair<T, U>(args...) {} using pair<T, U>::first; using pair<T, U>::second; P &operator+=(const P &r) { first += r.first; second += r.second; return *this; } P &operator-=(const P &r) { first -= r.first; second -= r.second; return *this; } P &operator*=(const P &r) { first *= r.first; second *= r.second; return *this; } template <typename S> P &operator*=(const S &r) { first *= r, second *= r; return *this; } P operator+(const P &r) const { return P(*this) += r; } P operator-(const P &r) const { return P(*this) -= r; } P operator*(const P &r) const { return P(*this) *= r; } template <typename S> P operator*(const S &r) const { return P(*this) *= r; } P operator-() const { return P{-first, -second}; } }; using pl = P<ll, ll>; using pi = P<int, int>; using vp = V<pl>; constexpr int inf = 1001001001; constexpr long long infLL = 4004004004004004004LL; template <typename T> int sz(const T &t) { return t.size(); } template <typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template <typename T> inline T Max(const vector<T> &v) { return *max_element(begin(v), end(v)); } template <typename T> inline T Min(const vector<T> &v) { return *min_element(begin(v), end(v)); } template <typename T> inline long long Sum(const vector<T> &v) { return accumulate(begin(v), end(v), 0LL); } template <typename T> int lb(const vector<T> &v, const T &a) { return lower_bound(begin(v), end(v), a) - begin(v); } template <typename T> int ub(const vector<T> &v, const T &a) { return upper_bound(begin(v), end(v), a) - begin(v); } constexpr long long TEN(int n) { long long ret = 1, x = 10; for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1); return ret; } template <typename T, typename U> pair<T, U> mkp(const T &t, const U &u) { return make_pair(t, u); } template <typename T> vector<T> mkrui(const vector<T> &v, bool rev = false) { vector<T> ret(v.size() + 1); if (rev) { for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1]; } else { for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i]; } return ret; }; template <typename T> vector<T> mkuni(const vector<T> &v) { vector<T> ret(v); sort(ret.begin(), ret.end()); ret.erase(unique(ret.begin(), ret.end()), ret.end()); return ret; } template <typename F> vector<int> mkord(int N, F f) { vector<int> ord(N); iota(begin(ord), end(ord), 0); sort(begin(ord), end(ord), f); return ord; } template <typename T> vector<int> mkinv(vector<T> &v) { int max_val = *max_element(begin(v), end(v)); vector<int> inv(max_val + 1, -1); for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i; return inv; } vector<int> mkiota(int n) { vector<int> ret(n); iota(begin(ret), end(ret), 0); return ret; } template <typename T> T mkrev(const T &v) { T w{v}; reverse(begin(w), end(w)); return w; } template <typename T> bool nxp(vector<T> &v) { return next_permutation(begin(v), end(v)); } // 返り値の型は入力の T に依存 // i 要素目 : [0, a[i]) template <typename T> vector<vector<T>> product(const vector<T> &a) { vector<vector<T>> ret; vector<T> v; auto dfs = [&](auto rc, int i) -> void { if (i == (int)a.size()) { ret.push_back(v); return; } for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back(); }; dfs(dfs, 0); return ret; } // F : function(void(T&)), mod を取る操作 // T : 整数型のときはオーバーフローに注意する template <typename T> T Power(T a, long long n, const T &I, const function<void(T &)> &f) { T res = I; for (; n; f(a = a * a), n >>= 1) { if (n & 1) f(res = res * a); } return res; } // T : 整数型のときはオーバーフローに注意する template <typename T> T Power(T a, long long n, const T &I) { return Power(a, n, I, function<void(T &)>{[](T &) -> void {}}); } } // namespace Nyaan #line 58 "template/template.hpp" // bit operation #line 1 "template/bitop.hpp" namespace Nyaan { __attribute__((target("popcnt"))) inline int popcnt(const u64 &a) { return _mm_popcnt_u64(a); } inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; } template <typename T> inline int gbit(const T &a, int i) { return (a >> i) & 1; } template <typename T> inline void sbit(T &a, int i, bool b) { if (gbit(a, i) != b) a ^= T(1) << i; } constexpr long long PW(int n) { return 1LL << n; } constexpr long long MSK(int n) { return (1LL << n) - 1; } } // namespace Nyaan #line 61 "template/template.hpp" // inout #line 1 "template/inout.hpp" namespace Nyaan { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } istream &operator>>(istream &is, __int128_t &x) { string S; is >> S; x = 0; int flag = 0; for (auto &c : S) { if (c == '-') { flag = true; continue; } x *= 10; x += c - '0'; } if (flag) x = -x; return is; } istream &operator>>(istream &is, __uint128_t &x) { string S; is >> S; x = 0; for (auto &c : S) { x *= 10; x += c - '0'; } return is; } ostream &operator<<(ostream &os, __int128_t x) { if (x == 0) return os << 0; if (x < 0) os << '-', x = -x; string S; while (x) S.push_back('0' + x % 10), x /= 10; reverse(begin(S), end(S)); return os << S; } ostream &operator<<(ostream &os, __uint128_t x) { if (x == 0) return os << 0; string S; while (x) S.push_back('0' + x % 10), x /= 10; reverse(begin(S), end(S)); return os << S; } void in() {} template <typename T, class... U> void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } struct IoSetupNya { IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetupnya; } // namespace Nyaan #line 64 "template/template.hpp" // debug #line 1 "template/debug.hpp" namespace DebugImpl { template <typename U, typename = void> struct is_specialize : false_type {}; template <typename U> struct is_specialize< U, typename conditional<false, typename U::iterator, void>::type> : true_type {}; template <typename U> struct is_specialize< U, typename conditional<false, decltype(U::first), void>::type> : true_type {}; template <typename U> struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type { }; void dump(const char& t) { cerr << t; } void dump(const string& t) { cerr << t; } void dump(const bool& t) { cerr << (t ? "true" : "false"); } void dump(__int128_t t) { if (t == 0) cerr << 0; if (t < 0) cerr << '-', t = -t; string S; while (t) S.push_back('0' + t % 10), t /= 10; reverse(begin(S), end(S)); cerr << S; } void dump(__uint128_t t) { if (t == 0) cerr << 0; string S; while (t) S.push_back('0' + t % 10), t /= 10; reverse(begin(S), end(S)); cerr << S; } template <typename U, enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr> void dump(const U& t) { cerr << t; } template <typename T> void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) { string res; if (t == Nyaan::inf) res = "inf"; if constexpr (is_signed<T>::value) { if (t == -Nyaan::inf) res = "-inf"; } if constexpr (sizeof(T) == 8) { if (t == Nyaan::infLL) res = "inf"; if constexpr (is_signed<T>::value) { if (t == -Nyaan::infLL) res = "-inf"; } } if (res.empty()) res = to_string(t); cerr << res; } template <typename T, typename U> void dump(const pair<T, U>&); template <typename T> void dump(const pair<T*, int>&); template <typename T> void dump(const T& t, enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) { cerr << "[ "; for (auto it = t.begin(); it != t.end();) { dump(*it); cerr << (++it == t.end() ? "" : ", "); } cerr << " ]"; } template <typename T, typename U> void dump(const pair<T, U>& t) { cerr << "( "; dump(t.first); cerr << ", "; dump(t.second); cerr << " )"; } template <typename T> void dump(const pair<T*, int>& t) { cerr << "[ "; for (int i = 0; i < t.second; i++) { dump(t.first[i]); cerr << (i == t.second - 1 ? "" : ", "); } cerr << " ]"; } void trace() { cerr << endl; } template <typename Head, typename... Tail> void trace(Head&& head, Tail&&... tail) { cerr << " "; dump(head); if (sizeof...(tail) != 0) cerr << ","; trace(forward<Tail>(tail)...); } } // namespace DebugImpl #ifdef NyaanDebug #define trc(...) \ do { \ cerr << "## " << #__VA_ARGS__ << " = "; \ DebugImpl::trace(__VA_ARGS__); \ } while (0) #else #define trc(...) (void(0)) #endif #ifdef NyaanLocal #define trc2(...) \ do { \ cerr << "## " << #__VA_ARGS__ << " = "; \ DebugImpl::trace(__VA_ARGS__); \ } while (0) #else #define trc2(...) (void(0)) #endif #line 67 "template/template.hpp" // macro #line 1 "template/macro.hpp" #define each(x, v) for (auto&& x : v) #define each2(x, y, v) for (auto&& [x, y] : v) #define all(v) (v).begin(), (v).end() #define rep(i, N) for (long long i = 0; i < (long long)(N); i++) #define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--) #define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++) #define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--) #define reg(i, a, b) for (long long i = (a); i < (b); i++) #define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--) #define fi first #define se second #define ini(...) \ int __VA_ARGS__; \ in(__VA_ARGS__) #define inl(...) \ long long __VA_ARGS__; \ in(__VA_ARGS__) #define ins(...) \ string __VA_ARGS__; \ in(__VA_ARGS__) #define in2(s, t) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i]); \ } #define in3(s, t, u) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i]); \ } #define in4(s, t, u, v) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i], v[i]); \ } #define die(...) \ do { \ Nyaan::out(__VA_ARGS__); \ return; \ } while (0) #line 70 "template/template.hpp" namespace Nyaan { void solve(); } int main() { Nyaan::solve(); } #line 4 "verify/verify-aoj-other/aoj-1613.test.cpp" // #line 2 "tree/tree-hash.hpp" #line 7 "tree/tree-hash.hpp" using namespace std; #line 2 "internal/internal-hash.hpp" namespace internal { using i64 = long long; using u64 = unsigned long long; using u128 = __uint128_t; template <int BASE_NUM = 2> struct Hash : array<u64, BASE_NUM> { using array<u64, BASE_NUM>::operator[]; static constexpr int n = BASE_NUM; Hash() : array<u64, BASE_NUM>() {} static constexpr u64 md = (1ull << 61) - 1; constexpr static Hash set(const i64 &a) { Hash res; fill(begin(res), end(res), cast(a)); return res; } Hash &operator+=(const Hash &r) { for (int i = 0; i < n; i++) if (((*this)[i] += r[i]) >= md) (*this)[i] -= md; return *this; } Hash &operator+=(const i64 &r) { u64 s = cast(r); for (int i = 0; i < n; i++) if (((*this)[i] += s) >= md) (*this)[i] -= md; return *this; } Hash &operator-=(const Hash &r) { for (int i = 0; i < n; i++) if (((*this)[i] += md - r[i]) >= md) (*this)[i] -= md; return *this; } Hash &operator-=(const i64 &r) { u64 s = cast(r); for (int i = 0; i < n; i++) if (((*this)[i] += md - s) >= md) (*this)[i] -= md; return *this; } Hash &operator*=(const Hash &r) { for (int i = 0; i < n; i++) (*this)[i] = modmul((*this)[i], r[i]); return *this; } Hash &operator*=(const i64 &r) { u64 s = cast(r); for (int i = 0; i < n; i++) (*this)[i] = modmul((*this)[i], s); return *this; } Hash operator+(const Hash &r) { return Hash(*this) += r; } Hash operator+(const i64 &r) { return Hash(*this) += r; } Hash operator-(const Hash &r) { return Hash(*this) -= r; } Hash operator-(const i64 &r) { return Hash(*this) -= r; } Hash operator*(const Hash &r) { return Hash(*this) *= r; } Hash operator*(const i64 &r) { return Hash(*this) *= r; } Hash operator-() const { Hash res; for (int i = 0; i < n; i++) res[i] = (*this)[i] == 0 ? 0 : md - (*this)[i]; return res; } friend Hash pfma(const Hash &a, const Hash &b, const Hash &c) { Hash res; for (int i = 0; i < n; i++) res[i] = modfma(a[i], b[i], c[i]); return res; } friend Hash pfma(const Hash &a, const Hash &b, const i64 &c) { Hash res; u64 s = cast(c); for (int i = 0; i < n; i++) res[i] = modfma(a[i], b[i], s); return res; } Hash pow(long long e) { Hash a{*this}, res{Hash::set(1)}; for (; e; a *= a, e >>= 1) { if (e & 1) res *= a; } return res; } static Hash get_basis() { static auto rand_time = chrono::duration_cast<chrono::nanoseconds>( chrono::high_resolution_clock::now().time_since_epoch()) .count(); static mt19937_64 rng(rand_time); Hash h; for (int i = 0; i < n; i++) { while (isPrimitive(h[i] = rng() % (md - 1) + 1) == false) ; } return h; } private: static u64 modpow(u64 a, u64 b) { u64 r = 1; for (a %= md; b; a = modmul(a, a), b >>= 1) r = modmul(r, a); return r; } static bool isPrimitive(u64 x) { for (auto &d : vector<u64>{2, 3, 5, 7, 11, 13, 31, 41, 61, 151, 331, 1321}) if (modpow(x, (md - 1) / d) <= 1) return false; return true; } static inline constexpr u64 cast(const long long &a) { return a < 0 ? a + md : a; } static inline constexpr u64 modmul(const u64 &a, const u64 &b) { u128 d = u128(a) * b; u64 ret = (u64(d) & md) + u64(d >> 61); return ret >= md ? ret - md : ret; } static inline constexpr u64 modfma(const u64 &a, const u64 &b, const u64 &c) { u128 d = u128(a) * b + c; u64 ret = (d >> 61) + (u64(d) & md); return ret >= md ? ret - md : ret; } }; } // namespace internal /** * @brief ハッシュ構造体 * @docs docs/internal/internal-hash.md */ #line 10 "tree/tree-hash.hpp" template <typename G> struct TreeHash { using Hash = internal::Hash<3>; const G& g; int n; vector<Hash> hash; vector<int> depth; static vector<Hash>& xs() { static vector<Hash> _xs; return _xs; } TreeHash(const G& _g, int root = 0) : g(_g), n(g.size()) { hash.resize(n); depth.resize(n, 0); while ((int)xs().size() <= n) xs().push_back(Hash::get_basis()); dfs(root, -1); } private: int dfs(int c, int p) { int dep = 0; for (auto& d : g[c]) { if (d != p) dep = max(dep, dfs(d, c) + 1); } Hash x = xs()[dep], h = Hash::set(1); for (auto& d : g[c]) { if (d != p) h = h * (x + hash[d]); } hash[c] = h; return depth[c] = dep; } }; /** * @brief 根付き木のハッシュ */ #line 6 "verify/verify-aoj-other/aoj-1613.test.cpp" using namespace Nyaan; // https://kimiyuki.net/writeups/algo-etc-icpc-2016-domestic-f/ #define whole(f, x, ...) \ ([&](decltype((x)) y) { return (f)(begin(y), end(y), ##__VA_ARGS__); })(x) template <typename T, typename X> auto vectors(T a, X x) { return vector<T>(x, a); } template <typename T, typename X, typename Y, typename... Zs> auto vectors(T a, X x, Y y, Zs... zs) { auto cont = vectors(a, y, zs...); return vector<decltype(cont)>(x, cont); } const int dy[] = {-1, 1, 0, 0, -1, 1, -1, 1}; const int dx[] = {0, 0, 1, -1, -1, 1, 1, -1}; vector<vector<bool> > load_image() { int h, w; cin >> h >> w; if (h == 0 and w == 0) return vector<vector<bool> >(); vector<vector<bool> > f = vectors(false, h + 2, w + 2); rep(y, h) rep(x, w) { char c; cin >> c; f[y + 1][x + 1] = c == '#'; } return f; } vector<set<int> > make_tree(vector<vector<bool> > const& f) { int h = f.size(); int w = f.front().size(); vector<vector<int> > k = vectors(-1, h, w); vector<set<int> > g; function<void(int, int, int)> dfs = [&](int y, int x, int cur_k) { k[y][x] = cur_k; rep(i, f[y][x] ? 8 : 4) { int ny = y + dy[i]; int nx = x + dx[i]; if (ny < 0 or h <= ny or nx < 0 or w <= nx) continue; if (f[ny][nx] == f[y][x]) { if (k[ny][nx] == -1) { dfs(ny, nx, cur_k); } } else { if (k[ny][nx] != -1) { g[k[ny][nx]].insert(k[y][x]); } } } }; rep(y, h) rep(x, w) if (k[y][x] == -1) { g.emplace_back(); dfs(y, x, g.size() - 1); } return g; } using Hash = typename TreeHash<vvi>::Hash; Hash tree_hash(vector<set<int> > f) { vvi g(sz(f)); rep(i, sz(f)) { each(x, f[i]) { g[i].push_back(x); g[x].push_back(i); } } TreeHash hash(g); return hash.hash[0]; } void Nyaan::solve() { while (true) { auto g1 = load_image(); if (g1.empty()) exit(0); auto g2 = load_image(); auto t1 = make_tree(g1); auto t2 = make_tree(g2); auto h1 = tree_hash(t1); auto h2 = tree_hash(t2); out(h1 == h2 ? "yes" : "no"); } }