結果

問題 No.2981 Pack Tree into Grid
ユーザー 👑 rin204
提出日時 2024-12-05 00:41:10
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 304 ms / 2,000 ms
コード長 26,649 bytes
コンパイル時間 4,155 ms
コンパイル使用メモリ 283,120 KB
実行使用メモリ 11,212 KB
最終ジャッジ日時 2024-12-05 00:41:19
合計ジャッジ時間 8,101 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on
// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on
// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);
// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)
// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}
template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}
template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}
template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}
// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}
// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}
// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}
// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}
// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}
// io functions
void FLUSH() {
    cout << flush;
}
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}
template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}
} // namespace io
using namespace io;
// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}
// yes / no
namespace yesno {
// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}
// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}
// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}
// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}
// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}
// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}
} // namespace yesno
using namespace yesno;
} // namespace templates
using namespace templates;
template <int MOD>
struct Modint {
    int x;
    Modint() : x(0) {}
    Modint(int64_t y) {
        if (y >= 0)
            x = y % MOD;
        else
            x = (y % MOD + MOD) % MOD;
    }
    Modint &operator+=(const Modint &p) {
        x += p.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    Modint &operator-=(const Modint &p) {
        x -= p.x;
        if (x < 0) x += MOD;
        return *this;
    }
    Modint &operator*=(const Modint &p) {
        x = int(1LL * x * p.x % MOD);
        return *this;
    }
    Modint &operator/=(const Modint &p) {
        *this *= p.inverse();
        return *this;
    }
    Modint &operator%=(const Modint &p) {
        assert(p.x == 0);
        return *this;
    }
    Modint operator-() const {
        return Modint(-x);
    }
    Modint &operator++() {
        x++;
        if (x == MOD) x = 0;
        return *this;
    }
    Modint &operator--() {
        if (x == 0) x = MOD;
        x--;
        return *this;
    }
    Modint operator++(int) {
        Modint result = *this;
        ++*this;
        return result;
    }
    Modint operator--(int) {
        Modint result = *this;
        --*this;
        return result;
    }
    friend Modint operator+(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) += rhs;
    }
    friend Modint operator-(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) -= rhs;
    }
    friend Modint operator*(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) *= rhs;
    }
    friend Modint operator/(const Modint &lhs, const Modint &rhs) {
        return Modint(lhs) /= rhs;
    }
    friend Modint operator%(const Modint &lhs, const Modint &rhs) {
        assert(rhs.x == 0);
        return Modint(lhs);
    }
    bool operator==(const Modint &p) const {
        return x == p.x;
    }
    bool operator!=(const Modint &p) const {
        return x != p.x;
    }
    bool operator<(const Modint &rhs) const {
        return x < rhs.x;
    }
    bool operator<=(const Modint &rhs) const {
        return x <= rhs.x;
    }
    bool operator>(const Modint &rhs) const {
        return x > rhs.x;
    }
    bool operator>=(const Modint &rhs) const {
        return x >= rhs.x;
    }
    Modint inverse() const {
        int a = x, b = MOD, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            u -= t * v;
            std::swap(a, b);
            std::swap(u, v);
        }
        return Modint(u);
    }
    Modint pow(int64_t k) const {
        Modint ret(1);
        Modint y(x);
        while (k > 0) {
            if (k & 1) ret *= y;
            y *= y;
            k >>= 1;
        }
        return ret;
    }
    std::pair<int, int> to_frac(int max_n = 1000) const {
        int y = x;
        for (int i = 1; i <= max_n; i++) {
            if (y <= max_n) {
                return {y, i};
            } else if (MOD - y <= max_n) {
                return {-(MOD - y), i};
            }
            y = (y + x) % MOD;
        }
        return {-1, -1};
    }
    friend std::ostream &operator<<(std::ostream &os, const Modint &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, Modint &p) {
        int64_t y;
        is >> y;
        p = Modint<MOD>(y);
        return (is);
    }
    static int get_mod() {
        return MOD;
    }
};
struct Arbitrary_Modint {
    int x;
    static int MOD;
    static void set_mod(int mod) {
        MOD = mod;
    }
    Arbitrary_Modint() : x(0) {}
    Arbitrary_Modint(int64_t y) {
        if (y >= 0)
            x = y % MOD;
        else
            x = (y % MOD + MOD) % MOD;
    }
    Arbitrary_Modint &operator+=(const Arbitrary_Modint &p) {
        x += p.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    Arbitrary_Modint &operator-=(const Arbitrary_Modint &p) {
        x -= p.x;
        if (x < 0) x += MOD;
        return *this;
    }
    Arbitrary_Modint &operator*=(const Arbitrary_Modint &p) {
        x = int(1LL * x * p.x % MOD);
        return *this;
    }
    Arbitrary_Modint &operator/=(const Arbitrary_Modint &p) {
        *this *= p.inverse();
        return *this;
    }
    Arbitrary_Modint &operator%=(const Arbitrary_Modint &p) {
        assert(p.x == 0);
        return *this;
    }
    Arbitrary_Modint operator-() const {
        return Arbitrary_Modint(-x);
    }
    Arbitrary_Modint &operator++() {
        x++;
        if (x == MOD) x = 0;
        return *this;
    }
    Arbitrary_Modint &operator--() {
        if (x == 0) x = MOD;
        x--;
        return *this;
    }
    Arbitrary_Modint operator++(int) {
        Arbitrary_Modint result = *this;
        ++*this;
        return result;
    }
    Arbitrary_Modint operator--(int) {
        Arbitrary_Modint result = *this;
        --*this;
        return result;
    }
    friend Arbitrary_Modint operator+(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) += rhs;
    }
    friend Arbitrary_Modint operator-(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) -= rhs;
    }
    friend Arbitrary_Modint operator*(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) *= rhs;
    }
    friend Arbitrary_Modint operator/(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        return Arbitrary_Modint(lhs) /= rhs;
    }
    friend Arbitrary_Modint operator%(const Arbitrary_Modint &lhs, const Arbitrary_Modint &rhs) {
        assert(rhs.x == 0);
        return Arbitrary_Modint(lhs);
    }
    bool operator==(const Arbitrary_Modint &p) const {
        return x == p.x;
    }
    bool operator!=(const Arbitrary_Modint &p) const {
        return x != p.x;
    }
    bool operator<(const Arbitrary_Modint &rhs) {
        return x < rhs.x;
    }
    bool operator<=(const Arbitrary_Modint &rhs) {
        return x <= rhs.x;
    }
    bool operator>(const Arbitrary_Modint &rhs) {
        return x > rhs.x;
    }
    bool operator>=(const Arbitrary_Modint &rhs) {
        return x >= rhs.x;
    }
    Arbitrary_Modint inverse() const {
        int a = x, b = MOD, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            u -= t * v;
            std::swap(a, b);
            std::swap(u, v);
        }
        return Arbitrary_Modint(u);
    }
    Arbitrary_Modint pow(int64_t k) const {
        Arbitrary_Modint ret(1);
        Arbitrary_Modint y(x);
        while (k > 0) {
            if (k & 1) ret *= y;
            y *= y;
            k >>= 1;
        }
        return ret;
    }
    friend std::ostream &operator<<(std::ostream &os, const Arbitrary_Modint &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, Arbitrary_Modint &p) {
        int64_t y;
        is >> y;
        p = Arbitrary_Modint(y);
        return (is);
    }
    static int get_mod() {
        return MOD;
    }
};
int Arbitrary_Modint::MOD = 998244353;
using modint9 = Modint<998244353>;
using modint1 = Modint<1000000007>;
using modint  = Arbitrary_Modint;
using mint    = modint9;
template <typename T>
struct Combination {
    int N;
    std::vector<T> fact, invfact;
    Combination(int N) : N(N) {
        fact.resize(N + 1);
        invfact.resize(N + 1);
        fact[0] = 1;
        for (int i = 1; i <= N; i++) {
            fact[i] = fact[i - 1] * i;
        }
        invfact[N] = T(1) / fact[N];
        for (int i = N - 1; i >= 0; i--) {
            invfact[i] = invfact[i + 1] * (i + 1);
        }
    }
    void extend(int n) {
        int le = fact.size();
        fact.resize(n + 1);
        invfact.resize(n + 1);
        for (int i = le; i <= n; i++) {
            fact[i] = fact[i - 1] * i;
        }
        invfact[n] = T(1) / fact[n];
        for (int i = n - 1; i >= le; i--) {
            invfact[i] = invfact[i + 1] * (i + 1);
        }
    }
    T nCk(int n, int k) {
        if (k > n || k < 0) return T(0);
        if (n >= int(fact.size())) extend(n);
        return fact[n] * invfact[k] * invfact[n - k];
    }
    T nPk(int n, int k) {
        if (k > n || k < 0) return T(0);
        if (n >= int(fact.size())) extend(n);
        return fact[n] * invfact[n - k];
    }
    T nHk(int n, int k) {
        if (n == 0 && k == 0) return T(1);
        return nCk(n + k - 1, k);
    }
    T catalan(int n) {
        return nCk(2 * n, n) - nCk(2 * n, n + 1);
    }
    // n 個の +1, m 個の -1, 累積和が常にk以下
    T catalan(int n, int m, int k) {
        if (n > m + k || k < 0)
            return T(0);
        else
            return nCk(n + m, n) - nCk(n + m, m + k + 1);
    }
    // return [x^n] C^k(x)
    // 先頭に ( が k - 1 個連続するような長さ n + k - 1 の括弧列と一対一対応
    T catalan_convolution(int n, int k) {
        return catalan(k + n - 1, n, k - 1);
    }
    T narayana(int n, int k) {
        return nCk(n, k) * nCk(n, k - 1) / n;
    }
    T inv(int n) {
        assert(n >= 1);
        if (n >= int(fact.size())) extend(n);
        return invfact[n] * fact[n - 1];
    }
};
struct RandomNumberGenerator {
    std::mt19937 mt;
    RandomNumberGenerator() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    RandomNumberGenerator(int seed) : mt(seed) {}
    int operator()(int a, int b) {
        std::uniform_int_distribution<int> dist(a, b - 1);
        return dist(mt);
    }
    int operator()(int b) {
        return (*this)(0, b);
    }
    template <typename T>
    void shuffle(std::vector<T> &v) {
        std::shuffle(v.begin(), v.end(), mt);
    }
};
std::vector<long long> treeHash(std::vector<std::vector<int>> &edges, int root = 0,
                                const long long MOD = 998244353, int seed = 0) {
    int n = edges.size();
    std::vector<int> dist(n, -1);
    std::vector<int> route;
    std::stack<int> st;
    st.push(root);
    route.push_back(root);
    dist[root] = 0;
    while (!st.empty()) {
        int pos = st.top();
        st.pop();
        for (auto npos : edges[pos]) {
            if (dist[npos] == -1) {
                dist[npos] = dist[pos] + 1;
                st.push(npos);
                route.push_back(npos);
            }
        }
    }
    std::reverse(route.begin(), route.end());
    int d = 0;
    for (auto di : dist) d = std::max(d, di);
    std::vector<long long> X(d + 1);
    RandomNumberGenerator rng(seed);
    for (int i = 0; i <= d; i++) X[i] = rng(MOD);
    std::vector<int> ma(n, 0);
    std::vector<long long> hash(n, 1);
    for (auto pos : route) {
        for (auto npos : edges[pos]) {
            if (dist[npos] < dist[pos]) continue;
            ma[pos] = std::max(ma[pos], ma[npos] + 1);
        }
        auto x = X[ma[pos]];
        for (auto npos : edges[pos]) {
            if (dist[npos] < dist[pos]) continue;
            hash[pos] *= (x + hash[npos]);
            hash[pos] %= MOD;
        }
    }
    return hash;
}
void solve() {
    INT(n);
    int nex = n;
    vvec(int, edges, n);
    fori(n - 1) {
        INT(u, v, w);
        u--;
        v--;
        fori(w - 1) {
            edges.push_back({});
            edges[u].push_back(nex);
            edges[nex].push_back(u);
            u = nex;
            nex++;
        }
        edges[u].push_back(v);
        edges[v].push_back(u);
    }
    INT(h, w);
    VVEC(char, S, h, w);
    vvec(int, idx, h, w, -1);
    int n2 = 0;
    fori(i, h) fori(j, w) {
        if (S[i][j] == '#') {
            idx[i][j] = n2++;
        }
    }
    if (n2 != len(edges)) {
        No();
        return;
    }
    vvec(int, edges2, n2);
    fori(i, h) fori(j, w) {
        if (S[i][j] != '#') continue;
        if (i > 0 and S[i - 1][j] == '#') {
            edges2[idx[i][j]].push_back(idx[i - 1][j]);
            edges2[idx[i - 1][j]].push_back(idx[i][j]);
        }
        if (j > 0 and S[i][j - 1] == '#') {
            edges2[idx[i][j]].push_back(idx[i][j - 1]);
            edges2[idx[i][j - 1]].push_back(idx[i][j]);
        }
    }
    auto h1_1 = treeHash(edges);
    auto h1_2 = treeHash(edges, 0, MOD1, 100);
    vec(ll, h1, n2);
    fori(i, n2) {
        h1[i] = h1_1[i] * MOD1 + h1_2[i];
    }
    fori(i, n2) {
        auto h2_1 = treeHash(edges2, i);
        auto h2_2 = treeHash(edges2, i, MOD1, 100);
        vec(ll, h2, n2);
        fori(j, n2) {
            h2[j] = h2_1[j] * MOD1 + h2_2[j];
        }
        if (h1[0] == h2[i]) {
            vec(Pll, to, n2);
            vec(Pll, ans, n);
            fori(i, h) fori(j, w) {
                if (idx[i][j] != -1) {
                    to[idx[i][j]] = {i + 1, j + 1};
                }
            }
            auto dfs = [&](auto &&self, int pos1, int bpos1, int pos2, int bpos2) -> void {
                map<ll, vector<int>> mp;
                if (pos1 < n) {
                    ans[pos1] = to[pos2];
                }
                for (auto npos2 : edges2[pos2]) {
                    if (npos2 == bpos2) continue;
                    mp[h2[npos2]].push_back(npos2);
                }
                for (auto npos1 : edges[pos1]) {
                    if (npos1 == bpos1) continue;
                    int npos2 = mp[h1[npos1]].back();
                    mp[h1[npos1]].pop_back();
                    self(self, npos1, pos1, npos2, pos2);
                }
            };
            dfs(dfs, 0, -1, i, -1);
            Yes();
            for (auto [x, y] : ans) {
                print(x, y);
            }
            return;
        }
    }
    No();
}
int main() {
#ifndef INTERACTIVE
    std::cin.tie(0)->sync_with_stdio(0);
#endif
    // std::cout << std::fixed << std::setprecision(12);
    int t;
    t = 1;
    std::cin >> t;
    while (t--) solve();
    return 0;
}
// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "misc/Modint.hpp"
// using mint = modint9;
//
// #include "math/Combination.hpp"
//
// #include "tree/treeHash.hpp"
//
// void solve() {
//     INT(n);
//     int nex = n;
//     vvec(int, edges, n);
//     fori(n - 1) {
//         INT(u, v, w);
//         u--;
//         v--;
//         fori(w - 1) {
//             edges.push_back({});
//             edges[u].push_back(nex);
//             edges[nex].push_back(u);
//             u = nex;
//             nex++;
//         }
//         edges[u].push_back(v);
//         edges[v].push_back(u);
//     }
//
//     INT(h, w);
//     VVEC(char, S, h, w);
//     vvec(int, idx, h, w, -1);
//     int n2 = 0;
//     fori(i, h) fori(j, w) {
//         if (S[i][j] == '#') {
//             idx[i][j] = n2++;
//         }
//     }
//
//     if (n2 != len(edges)) {
//         No();
//         return;
//     }
//
//     vvec(int, edges2, n2);
//     fori(i, h) fori(j, w) {
//         if (S[i][j] != '#') continue;
//         if (i > 0 and S[i - 1][j] == '#') {
//             edges2[idx[i][j]].push_back(idx[i - 1][j]);
//             edges2[idx[i - 1][j]].push_back(idx[i][j]);
//         }
//         if (j > 0 and S[i][j - 1] == '#') {
//             edges2[idx[i][j]].push_back(idx[i][j - 1]);
//             edges2[idx[i][j - 1]].push_back(idx[i][j]);
//         }
//     }
//
//     auto h1_1 = treeHash(edges);
//     auto h1_2 = treeHash(edges, 0, MOD1, 100);
//     vec(ll, h1, n2);
//     fori(i, n2) {
//         h1[i] = h1_1[i] * MOD1 + h1_2[i];
//     }
//
//     fori(i, n2) {
//         auto h2_1 = treeHash(edges2, i);
//         auto h2_2 = treeHash(edges2, i, MOD1, 100);
//         vec(ll, h2, n2);
//         fori(j, n2) {
//             h2[j] = h2_1[j] * MOD1 + h2_2[j];
//         }
//         if (h1[0] == h2[i]) {
//             vec(Pll, to, n2);
//             vec(Pll, ans, n);
//             fori(i, h) fori(j, w) {
//                 if (idx[i][j] != -1) {
//                     to[idx[i][j]] = {i + 1, j + 1};
//                 }
//             }
//
//             auto dfs = [&](auto &&self, int pos1, int bpos1, int pos2, int bpos2) -> void {
//                 map<ll, vector<int>> mp;
//                 if (pos1 < n) {
//                     ans[pos1] = to[pos2];
//                 }
//                 for (auto npos2 : edges2[pos2]) {
//                     if (npos2 == bpos2) continue;
//                     mp[h2[npos2]].push_back(npos2);
//                 }
//
//                 for (auto npos1 : edges[pos1]) {
//                     if (npos1 == bpos1) continue;
//                     int npos2 = mp[h1[npos1]].back();
//                     mp[h1[npos1]].pop_back();
//                     self(self, npos1, pos1, npos2, pos2);
//                 }
//             };
//             dfs(dfs, 0, -1, i, -1);
//
//             Yes();
//             for (auto [x, y] : ans) {
//                 print(x, y);
//             }
//
//             return;
//         }
//     }
//
//     No();
// }
//
// int main() {
// #ifndef INTERACTIVE
//     std::cin.tie(0)->sync_with_stdio(0);
// #endif
//     // std::cout << std::fixed << std::setprecision(12);
//     int t;
//     t = 1;
//     std::cin >> t;
//     while (t--) solve();
//     return 0;
// }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0