結果

問題 No.2981 Pack Tree into Grid
ユーザー ecottea
提出日時 2024-11-30 18:14:57
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 135 ms / 2,000 ms
コード長 10,741 bytes
コンパイル時間 8,320 ms
コンパイル使用メモリ 339,100 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-04 23:32:01
合計ジャッジ時間 11,798 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

//
// QCFium
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<1000000007>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//
/*
* to :
* cost :
*/
struct WEdge {
// verify : https://judge.yosupo.jp/problem/shortest_path
int to; //
ll cost; //
WEdge() : to(-1), cost(-INFL) {}
WEdge(int to, ll cost) : to(to), cost(cost) {}
//
operator int() const { return to; }
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const WEdge& e) {
os << "(" << e.to << "," << e.cost << ")";
return os;
}
#endif
};
//
/*
* WGraph g
* g[v] : v
*
* verify : https://judge.yosupo.jp/problem/shortest_path
*/
using WGraph = vector<vector<WEdge>>;
//O(n + m)
/*
* (, , ) n m
*
* n :
* m : n-1
* directed : false
* zero_indexed : 0-indexed false
*/
WGraph read_WGraph(int n, int m = -1, bool directed = false, bool zero_indexed = false) {
// verify : https://judge.yosupo.jp/problem/shortest_path
WGraph g(n);
if (m == -1) m = n - 1;
rep(j, m) {
int u, v; ll c;
cin >> u >> v >> c;
if (!zero_indexed) { --u; --v; }
g[u].push_back({ v, c });
if (!directed && u != v) g[v].push_back({ u, c });
}
return g;
}
//O(h w)
/*
* h w 4 g
* wall
* i j (i, j) i * w + j
*/
template <class T>
Graph grid_to_graph(const vector<vector<T>>& c, T wall = '#') {
int h = sz(c), w = sz(c[0]);
Graph g(h * w);
rep(x, h) rep(y, w) {
//
if (c[x][y] == wall) continue;
//
rep(k, 4) {
// 4
int nx = x + DX[k];
int ny = y + DY[k];
//
if (nx < 0 || nx >= h || ny < 0 || ny >= w || c[nx][ny] == wall) continue;
//
g[x * w + y].push_back(nx * w + ny);
}
}
return g;
}
//O(n log n)
/*
* r g
*/
vector<string> rooted_tree_classification(const Graph& g, int r) {
// : https://chocobaby-aporo.hatenablog.com/entry/2017/12/05/233027
// verify : https://judge.yosupo.jp/problem/rooted_tree_isomorphism_classification
int n = sz(g);
vector<string> h(n);
function<string(int s, int p)> dfs = [&](int s, int p) {
vector<string> hcs;
repe(t, g[s]) {
if (t == p) continue;
hcs.push_back("(" + dfs(t, s) + ")");
}
sort(all(hcs));
repe(hc, hcs) h[s] += hc;
return h[s];
};
dfs(r, -1);
return h;
}
void Main() {
int n;
cin >> n;
auto g = read_WGraph(n);
dumpel(g);
int h, w;
cin >> h >> w;
vvc s(h, vc(w));
cin >> s;
// T No
ll n1 = 1;
rep(s, n) repe(t, g[s]) if (s < t) n1 += t.cost - 1;
if (n1 > h * w) {
Yes(0);
return;
}
Graph g1(n); int p = n;
rep(s, n) repe(t, g[s]) {
if (s > t) continue;
int v = s;
rep(hoge, t.cost - 1) {
g1.push_back(vi());
g1[v].push_back(p);
g1[p].push_back(v);
v = p;
p++;
}
g1[v].push_back(t);
g1[t].push_back(v);
}
dumpel(g1);
auto g2 = grid_to_graph(s, '.');
dumpel(g2);
auto h1 = rooted_tree_classification(g1, 0);
rep(x, h) rep(y, w) {
if (s[x][y] == '.') continue;
auto h2 = rooted_tree_classification(g2, x * w + y);
dump(h1); dump(h2);
if (h1[0] == h2[x * w + y]) {
vi v1_to_v2(sz(g1));
v1_to_v2[0] = x * w + y;
function<void(int, int, int, int)> dfs = [&](int s1, int p1, int s2, int p2) {
dump(s1, p1, s2, p2);
map<string, stack<int>> h_to_v2;
repe(t2, g2[s2]) {
if (t2 == p2) continue;
h_to_v2[h2[t2]].push(t2);
}
dump(h_to_v2);
repe(t1, g1[s1]) {
if (t1 == p1) continue;
int t2 = h_to_v2[h1[t1]].top(); h_to_v2[h1[t1]].pop();
v1_to_v2[t1] = t2;
dfs(t1, s1, t2, s2);
}
};
dfs(0, -1, x * w + y, -1);
dump(v1_to_v2);
Yes(1);
rep(i, n) {
int x = v1_to_v2[i] / w;
int y = v1_to_v2[i] % w;
x++;
y++;
cout << x << " " << y << "\n";
}
return;
}
}
Yes(0);
}
void make_testcase2() {
int Q = 40;
cout << Q << endl;
rep(hoge, Q) {
int h = 12, w = 25;
int n = h * w;
cout << n << endl;
rep(i, n - 1) {
cout << i + 1 << " " << i + 2 << " " << h * w << endl;
}
cout << h << " " << w << endl;
rep(i, h) {
rep(j, w) cout << '.';
cout << endl;
}
}
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
// make_testcase2(); return 0;
int t = 1;
cin >> t; //
while (t--) {
dump("------------------------------");
Main();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0