結果

問題 No.650 行列木クエリ
ユーザー PachicobuePachicobue
提出日時 2019-03-17 18:12:48
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 124 ms / 2,000 ms
コード長 23,655 bytes
コンパイル時間 2,491 ms
コンパイル使用メモリ 223,604 KB
最終ジャッジ日時 2025-01-06 22:33:05
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
//!===========================================================!//
//! dP dP dP !//
//! 88 88 88 !//
//! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !//
//! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !//
//! 88 88 88. ... 88. .88 88. .88 88. ... 88 !//
//! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !//
//!===========================================================!//
using ld = long double;
using ll = long long;
using ull = unsigned long long;
std::mt19937 mt{std::random_device{}()};
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename T>
constexpr T MOD = static_cast<T>(1000000007);
template <typename F>
constexpr F PI() { return 3.1415926535897932385; }
#define SHOW(...) (std::cerr << "(" << #__VA_ARGS__ << ") = ("), HogeHogeSansuu(__VA_ARGS__), std::cerr << ")" << std::endl;
struct has_debugPrint_impl
{
template <class T>
static auto check(T&& x) -> decltype(x.debugPrint(), std::true_type{});
template <class T>
static auto check(...) -> std::false_type;
};
template <class T>
class has_debugPrint : public decltype(has_debugPrint_impl::check<T>(std::declval<T>()))
{
};
template <bool>
struct HogeHogeDump
{
template <typename T>
static void dump(const T& x) { x.debugPrint(); }
};
template <>
struct HogeHogeDump<false>
{
template <typename T>
static void dump(const T& x) { std::cerr << x; }
};
void HogeHogeSansuu() { ; }
template <typename T>
void HogeHogeSansuu(const T& x) { HogeHogeDump<has_debugPrint<T>::value>::dump(x); }
template <typename T, typename... Args>
void HogeHogeSansuu(const T& x, Args... args) { HogeHogeDump<has_debugPrint<T>::value>::dump(x), std::cerr << ",", HogeHogeSansuu(args...); }
template <typename T>
bool chmin(T& a, const T& b) { return a = std::min(a, b), a == b; }
template <typename T>
bool chmax(T& a, const T& b) { return a = std::max(a, b), a == b; }
template <typename T, typename F>
void For(const T s, const T t, const F f)
{
for (T i = s; i != t; i += T(s < t ? 1 : -1)) { f(i); }
}
template <typename T, typename F>
void Rep(const T N, const F f) { For<T, F>(0, N, f); }
template <typename T, typename F>
void RRep(const T N, const F f) { For<T, F>(N - 1, -1, f); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T PopCount(const T u)
{
unsigned long long v = static_cast<unsigned long long>(u);
return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v
        = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
}
template <typename T>
constexpr T log2p1(const T u)
{
unsigned long long v = static_cast<unsigned long long>(u);
return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32),
        PopCount(v);
}
template <typename T>
constexpr bool ispow2(const T v) { return (v << 1) == (T(1) << (log2p1(v))); }
template <typename T>
constexpr T ceil2(const T v) { return ispow2(v) ? v : T(1) << log2p1(v); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : ispow2(v) ? v : T(1) << (log2p1(v) - 1); }
template <typename T>
struct Accum
{
template <typename InIt>
Accum(const InIt first, const InIt last) : accum(std::size_t(std::distance(first, last))) { std::partial_sum(first, last, accum.begin()); }
T sum(const std::size_t i) const { return i == 0 ? T(0) : accum[i - 1]; }
T sum(const std::size_t l, const std::size_t r) const { return sum(r) - sum(l); }
std::vector<T> accum;
};
template <typename T>
struct Accum2D
{
Accum2D(const std::vector<std::vector<T>>& t) : accum{t}
{
for (std::size_t i = 0; i < accum.size(); i++) {
for (std::size_t j = 1; j < accum[i].size(); j++) { accum[i][j] += accum[i][j - 1]; }
}
for (std::size_t i = 1; i < accum.size(); i++) {
for (std::size_t j = 0; j < accum[i].size(); j++) { accum[i][j] += accum[i - 1][j]; }
}
}
T sum(const std::size_t y, const std::size_t x) const { return y == 0 or x == 0 ? T(0) : accum[y - 1][x - 1]; }
T sum(const std::size_t ymin, const std::size_t ysup, const std::size_t xmin, const std::size_t xsup) const { return sum(ysup, xsup) - sum(ymin,
        xmin); }
std::vector<std::vector<T>> accum;
};
template <typename T>
struct Zip
{
template <typename InIt>
Zip(const InIt first, const InIt last) : unzip(std::size_t(std::distance(first, last)))
{
std::copy(first, last, unzip), std::sort(unzip.begin(), unzip.end()), unzip.erase(std::unique(unzip.begin(), unzip.end()), unzip.end());
for (std::size_t i = 0; i < unzip.size(); i++) { zip[unzip[i]] = i; }
}
std::vector<T> unzip;
std::map<T, std::size_t> zip;
};
template <typename T, std::size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::deque<T, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multimap<K, T, C, A>& v)
{
os << "[";
for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
return (os << "]" << std::endl);
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multiset<T, C, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::map<K, T, C, A>& v)
{
os << "[";
for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& v) { return (os << "<" << v.first << "," << v.second << ">"); }
template <typename T1, typename T2, typename T3>
std::ostream& operator<<(std::ostream& os, const std::priority_queue<T1, T2, T3>& v)
{
auto q = v;
os << "[";
while (not q.empty()) { os << q.top() << ",", q.pop(); }
return os << "]\n";
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::queue<T1>& v)
{
auto q = v;
os << "[";
while (not q.empty()) { os << q.front() << ",", q.pop(); }
return os << "]\n";
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::set<T, C, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::stack<T1>& v)
{
auto q = v;
os << "[";
while (not q.empty()) { os << q.top() << ",", q.pop(); }
return os << "]\n";
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multimap<K, T, H, P, A>& v)
{
os << "[";
for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multiset<T, H, P, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_map<K, T, H, P, A>& v)
{
os << "[";
for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_set<T, H, P, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::vector<T, A>& v)
{
os << "[";
for (const auto& e : v) { os << e << ","; }
return (os << "]" << std::endl);
}
//!=================================================!//
//! .88888. dP !//
//! d8' '88 88 !//
//! 88 88d888b. .d8888b. 88d888b. 88d888b. !//
//! 88 YP88 88' '88 88' '88 88' '88 88' '88 !//
//! Y8. .88 88 88. .88 88. .88 88 88 !//
//! '88888' dP '88888P8 88Y888P' dP dP !//
//! 88 !//
//! dP !//
//!=================================================!//
struct Graph
{
Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}
void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }
const std::vector<std::size_t>& operator[](const std::size_t i) const { return edge[i]; }
void debugPrint() const
{
std::cerr << "[\n";
for (std::size_t i = 0; i < V; i++) {
for (const std::size_t to : edge[i]) { std::cerr << i << "->" << to << "\n"; }
}
std::cerr << "]\n";
}
const std::size_t V;
std::vector<std::vector<std::size_t>> edge, rev_edge;
};
//!==================================!//
//! dP dP dP 888888ba !//
//! 88 88 88 88 '8b !//
//! 88aaaaa88a 88 88 88 !//
//! 88 88 88 88 88 !//
//! 88 88 88 88 .8P !//
//! dP dP 88888888P 8888888P !//
//!==================================!//
class HLD
{
public:
HLD(Graph& g, const std::size_t r = 0) : par(g.V, g.V), top(g.V, g.V), in(g.V, g.V), out(g.V, g.V)
{
const std::size_t N = g.V;
std::vector<std::size_t> sz(N, N);
auto dfs1 = [&](auto&& self, const std::size_t s, const std::size_t p) -> std::size_t {
par[s] = p;
for (std::size_t& to : g.edge[s]) {
if (p == to) { continue; }
sz[s] += self(self, to, s);
if (sz[to] > sz[g.edge[s][0]]) { std::swap(to, g.edge[s][0]); }
}
return sz[s];
};
dfs1(dfs1, r, N);
top[r] = r;
auto dfs2 = [&](auto&& self, const std::size_t s, const std::size_t p, std::size_t& ind) -> void {
in[s] = ind++;
for (const std::size_t to : g.edge[s]) {
if (to == p) { continue; }
top[to] = (to == g.edge[s][0] ? top[s] : to);
self(self, to, s, ind);
}
out[s] = ind;
};
std::size_t ind = 0;
dfs2(dfs2, r, N, ind);
}
std::vector<std::size_t> tour() const
{
std::vector<std::size_t> ans(in.size());
for (std::size_t i = 0; i < in.size(); i++) { ans[in[i]] = i; }
return ans;
}
const std::vector<std::size_t>& invTour() const { return in; }
std::pair<std::size_t, std::size_t> sub(const std::size_t v) const { return {in[v], out[v]}; }
std::vector<std::pair<std::size_t, std::size_t>> path(std::size_t u, std::size_t v) const
{
using P = std::pair<std::size_t, std::size_t>;
std::vector<P> head, tail;
for (std::size_t pu = top[u], pv = top[v]; pu != pv;) {
if (in[pu] < in[pv]) {
tail.push_back({in[pv], in[v]});
v = par[pv], pv = top[v];
} else {
tail.push_back({in[u], in[pu]});
u = par[pu], pu = top[u];
}
}
head.push_back({in[u], in[v]});
std::reverse(tail.begin(), tail.end());
for (const auto& p : tail) { head.push_back(p); }
return head;
}
private:
std::vector<std::size_t> par, top, in, out;
};
//!===============================================================!//
//! 88888888b dP .88888. a88888b. 888888ba !//
//! 88 88 d8' '88 d8' '88 88 '8b !//
//! a88aaaa dP. .dP d8888P 88 88 88 88 !//
//! 88 '8bd8' 88 88 YP88 88 88 88 !//
//! 88 .d88b. 88 Y8. .88 Y8. .88 88 .8P !//
//! 88888888P dP' 'dP dP '88888' Y88888P' 8888888P !//
//!===============================================================!//
template <typename T>
constexpr std::pair<T, T> extgcd(const T a, const T b)
{
if (b == 0) { return std::pair<T, T>{1, 0}; }
const auto p = extgcd(b, a % b);
return {p.second, p.first - p.second * (a / b)};
}
template <typename T>
constexpr T inverse(const T a, const T mod) { return (mod + extgcd((mod + a % mod) % mod, mod).first % mod) % mod; }
//!========================================================!//
//! 8888ba.88ba dP dP dP !//
//! 88 '8b '8b 88 88 88 !//
//! 88 88 88 .d8888b. .d888b88 88 88d888b. d8888P !//
//! 88 88 88 88' '88 88' '88 88 88' '88 88 !//
//! 88 88 88 88. .88 88. .88 88 88 88 88 !//
//! dP dP dP '88888P' '88888P8 dP dP dP dP !//
//!========================================================!//
template <typename T, T mod>
class ModInt
{
private:
T value;
public:
ModInt() : value{0} {}
ModInt(const T val) : value{((val % mod) + mod) % mod} {}
ModInt(const ModInt<T, mod>& n) : value{n()} {}
ModInt<T, mod>& operator=(const ModInt<T, mod>& n) { return value = n(), (*this); }
ModInt<T, mod>& operator=(const T v) { return value = (mod + v % mod) % mod, (*this); }
ModInt<T, mod> operator+() const { return *this; }
ModInt<T, mod> operator-() const { return ModInt{mod - value}; }
ModInt<T, mod> operator+(const ModInt<T, mod>& val) const { return ModInt{value + val()}; }
ModInt<T, mod> operator-(const ModInt<T, mod>& val) const { return ModInt{value - val() + mod}; }
ModInt<T, mod> operator*(const ModInt<T, mod>& val) const { return ModInt{value * val()}; }
ModInt<T, mod> operator/(const ModInt<T, mod>& val) const { return ModInt{value * inverse(val(), mod)}; }
ModInt<T, mod>& operator+=(const ModInt<T, mod>& val) { return (((value += val()) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator-=(const ModInt<T, mod>& val) { return (((value -= val()) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator*=(const ModInt<T, mod>& val) { return (((value *= val()) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator/=(const ModInt<T, mod>& val) { return (((value *= inverse(val(), mod)) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod> operator+(const T val) const { return ModInt{value + val}; }
ModInt<T, mod> operator-(const T val) const { return ModInt{value - val}; }
ModInt<T, mod> operator*(const T val) const { return ModInt{value * val}; }
ModInt<T, mod> operator/(const T val) const { return ModInt{value * inverse(val, mod)}; }
template <typename I>
ModInt<T, mod> operator^(const I n) const { return n < 0 ? (T(1) / (*this)) ^ (-n) : n == 0 ? ModInt<T, mod>(1) : n % 2 == 1 ? (*this) * ((*this)
        ^ (n - 1)) : ((*this * *this) ^ (n / 2)); }
ModInt<T, mod>& operator+=(const T val) { return (((value += val) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator-=(const T val) { return (((value -= val) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator*=(const T val) { return (((value *= val) %= mod) += mod) %= mod, (*this); }
ModInt<T, mod>& operator/=(const T val) { return (((value *= inverse(val, mod)) %= mod) += mod) %= mod, (*this); }
template <typename I>
ModInt<T, mod>& operator^=(const I n) { return (*this) = ((*this) ^ n); }
bool operator==(const ModInt<T, mod>& val) const { return value == val.value; }
bool operator!=(const ModInt<T, mod>& val) const { return not(*this == val); }
bool operator==(const T val) const { return value == (mod + val % mod) % mod; }
bool operator!=(const T val) const { return not(*this == val); }
T operator()() const { return value; }
};
template <typename T, T mod>
inline ModInt<T, mod> operator+(const T val, const ModInt<T, mod>& n) { return ModInt<T, mod>{n() + val}; }
template <typename T, T mod>
inline ModInt<T, mod> operator-(const T val, const ModInt<T, mod>& n) { return ModInt<T, mod>{-n() + val}; }
template <typename T, T mod>
inline ModInt<T, mod> operator*(const T val, const ModInt<T, mod>& n) { return ModInt<T, mod>{n() * val}; }
template <typename T, T mod>
inline ModInt<T, mod> operator/(const T val, const ModInt<T, mod>& n) { return ModInt<T, mod>(val) / n; }
template <typename T, T mod>
inline bool operator==(const T val, const ModInt<T, mod>& n) { return n == val; }
template <typename T, T mod>
inline bool operator!=(const T val, const ModInt<T, mod>& n) { return not(val == n); }
template <typename T, T mod>
inline std::istream& operator>>(std::istream& is, ModInt<T, mod>& n)
{
T v;
return is >> v, n = v, is;
}
template <typename T, T mod>
std::ostream& operator<<(std::ostream& os, const ModInt<T, mod>& n) { return (os << n()); }
template <int mod>
using Mint = ModInt<int, mod>;
template <ll mod>
using Mll = ModInt<ll, mod>;
//!===================================================================!//
//! .d88888b d888888P !//
//! 88. "' 88 !//
//! 'Y88888b. .d8888b. .d8888b. 88 88d888b. .d8888b. .d8888b. !//
//! '8b 88ooood8 88' '88 88 88' '88 88ooood8 88ooood8 !//
//! d8' .8P 88. ... 88. .88 88 88 88. ... 88. ... !//
//! Y88888P '88888P' '8888P88 dP dP '88888P' '88888P' !//
//! .88 !//
//! d8888P !//
//!===================================================================!//
template <typename Monoid>
class SegTree
{
public:
using BaseMonoid = Monoid;
using T = typename Monoid::T;
SegTree(const std::size_t N, const T initial = Monoid::id()) : size(N), half(ceil2(size)), value(half << 1, Monoid::id())
{
if (initial != Monoid::id()) {
std::fill(value.begin() + half, value.end(), initial);
for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
}
}
template <typename InIt>
SegTree(const InIt first, const InIt last) : size(std::distance(first, last)), half(ceil2(size)), value(half << 1, Monoid::id())
{
std::copy(first, last, value.begin() + half);
for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
}
T get(const std::size_t a) const { return value[a + half]; }
void set(std::size_t a, const T& val)
{
value[a += half] = val;
while (a >>= 1) { up(a); }
}
T accumulate(std::size_t L, std::size_t R) const
{
T accl = Monoid::id(), accr = Monoid::id();
for (L += half, R += half; L < R; L >>= 1, R >>= 1) {
if (L & 1) { accl = acc(accl, value[L++]); }
if (R & 1) { accr = acc(value[--R], accr); }
}
return acc(accl, accr);
}
template <typename Pred>
std::size_t partitionPoint(const std::size_t L, const std::size_t R, const Pred& pred) const
{
auto prec = [&](auto&& self, const std::size_t index, const std::size_t left, const std::size_t right, const T& offset) -> std::pair<T, std
            ::size_t> {
if (right <= L or R <= left or pred(acc(offset, value[index]))) { return {Monoid::id(), R}; }
if (index >= half) { return {value[index], index - half}; }
const std::pair<T, std::size_t> lans = self(self, index << 1, left, (left + right) >> 1, offset);
if (lans.second != R) { return lans; }
return self(self, index << 1 | 1, (left + right) >> 1, right, acc(offset, lans.first));
};
return prec(prec, 1, 0, half, Monoid::id()).second;
}
void debugPrint() const
{
std::cerr << "[";
for (std::size_t i = half; i < half + size; i++) { std::cerr << value[i] << (i + 1 == half + size ? "" : ","); }
std::cerr << "]\n";
}
private:
void up(const std::size_t i) { value[i] = acc(value[i << 1], value[i << 1 | 1]); }
const std::size_t size, half;
std::vector<T> value;
const Monoid acc{};
};
//!============================================!//
//! 8888ba.88ba oo !//
//! 88 '8b '8b !//
//! 88 88 88 .d8888b. dP 88d888b. !//
//! 88 88 88 88' '88 88 88' '88 !//
//! 88 88 88 88. .88 88 88 88 !//
//! dP dP dP '88888P8 dP dP dP !//
//!============================================!//
struct Monoid
{
using mll = ModInt<ll, MOD<ll>>;
using T = std::array<std::array<mll, 2>, 2>;
T operator()(const T& a, const T& b) const
{
T ans{{{0, 0}, {0, 0}}};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) { ans[i][j] += a[i][k] * b[k][j]; }
}
}
return ans;
}
static T id() { return T{{{1, 0}, {0, 1}}}; }
};
int main()
{
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int N;
std::cin >> N;
Graph g(N);
using P = std::pair<int, int>;
std::vector<P> E(N - 1);
Rep(N - 1, [&](const int i) {
int u, v;
std::cin >> u >> v, E[i] = {u, v}, g.addEdge(u, v), g.addEdge(v, u);
});
HLD hld(g);
std::vector<int> dep(N, 0);
auto dfs = [&](auto&& self, const int s, const int p, const int d) -> void {
dep[s] = d;
for (const int to : g[s]) {
if (to == p) { continue; }
self(self, to, s, d + 1);
}
};
dfs(dfs, 0, -1, 0);
std::vector<int> V(N - 1);
Rep(N - 1, [&](const int i) { V[i] = (dep[E[i].first] < dep[E[i].second] ? E[i].second : E[i].first); });
SegTree<Monoid> seg(N);
const auto inv = hld.invTour();
int Q;
std::cin >> Q;
Rep(Q, [&](const int) {
char c;
std::cin >> c;
if (c == 'x') {
int i;
ll x00, x01, x10, x11;
std::cin >> i >> x00 >> x01 >> x10 >> x11;
seg.set(inv[V[i]], Monoid::T{{{x00, x01}, {x10, x11}}});
} else {
int i, j;
std::cin >> i >> j;
const auto range = hld.path(i, j);
auto ans = Monoid::id();
for (const auto& p : range) { ans = Monoid{}(ans, seg.accumulate(p.first == inv[i] ? inv[i] + 1 : p.first, p.second + 1)); }
std::cout << ans[0][0] << " " << ans[0][1] << " " << ans[1][0] << " " << ans[1][1] << std::endl;
}
});
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0