結果
問題 | No.2987 Colorful University of Tree |
ユーザー |
👑 |
提出日時 | 2024-12-12 21:44:01 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 27,828 bytes |
コンパイル時間 | 5,157 ms |
コンパイル使用メモリ | 276,048 KB |
実行使用メモリ | 33,756 KB |
最終ジャッジ日時 | 2024-12-12 21:44:40 |
合計ジャッジ時間 | 23,259 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 WA * 14 |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")// #define INTERACTIVE#include <bits/stdc++.h>using namespace std;namespace templates {// typeusing 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 valueconst 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)// functionvector<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 outputnamespace io {// __int128_tstd::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;}// tupletemplate <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 functionsvoid 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);elseprint(B);return f;}template <class... T>void inp(T &...a) {(cin >> ... >> a);}} // namespace iousing namespace io;// read graphvector<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 / nonamespace yesno {// yesinline 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;}// noinline 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;}// possibleinline 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;}// impossibleinline 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 Bobinline 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 Aokiinline 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 yesnousing namespace yesno;} // namespace templatesusing namespace templates;void solve() {INT(n);vvec(int, edges, n);vec(int, deg, n);vec(Pii, E, n - 1, {-1, -1});fori(i, n) {cin >> deg[i];fori(deg[i]) {INT(x);x--;if (E[x].first == -1) {E[x].first = i;} else {E[x].second = i;}edges[i].push_back(x);}}vec(int, idx, n);iota(all(idx), 0);sort(all(idx), [&](int i, int j) { return deg[i] > deg[j]; });ll x = 0;while (x * x < 2 * n - 2) x++;ll y = x + 2;for (auto d : deg) chmax(x, d);auto vertex_color = [&](ll x) -> vector<ll> {vec(ll, color, n, -1);ll y_ = min(x, y);vec(ll, cnt, y_, x);for (auto i : idx) {ll ma = -1;int ii = -1;fori(j, y_) {if (chmax(ma, cnt[j])) {ii = j;}}if (ii == -1 or ma < deg[i]) {return {};}cnt[ii] -= deg[i];color[i] = ii;}return color;};auto vertex_color2 = [&](ll x) -> vector<ll> {vec(ll, color, n, -1);ll y_ = min(x, y);vec(ll, cnt, y_, x);for (auto i : idx) {ll mi = x + 10;int ii = -1;fori(j, y_) {if (cnt[j] >= deg[i] and chmin(mi, cnt[j])) {ii = j;}}if (ii == -1) {return {};}cnt[ii] -= deg[i];color[i] = ii;}return color;};auto vertex_color3 = [&](ll x) -> vector<ll> {vec(ll, color, n, -1);ll y_ = min(x, y);vec(ll, cnt, y_, x);for (auto i : idx) {ll ma = -2;int ii = -1;fori(j, y_) {if (deg[i] & 1) {if (cnt[j] > ma) {if ((cnt[j] % 2 == 1) or (ma % 2 == 0)) {ma = cnt[j];ii = j;}} else if (cnt[j] > deg[i] and (cnt[j] % 2 == 1) and (ma % 2 == 0)) {ma = cnt[j];ii = j;}} else {if (chmax(ma, cnt[j])) {ii = j;}}}if (ii == -1 or ma < deg[i]) {return {};}cnt[ii] -= deg[i];color[i] = ii;}return color;};auto vertex_color4 = [&](ll x) -> vector<ll> {vec(ll, color, n, -1);ll y_ = min(x, y);vec(ll, cnt, y_, x);for (auto i : idx) {ll mi = x + 10 + (x % 2);int ii = -1;fori(j, y_) {if (cnt[j] < deg[i]) continue;if (deg[i] % 2 == 1) {if (cnt[j] < mi) {if ((cnt[j] % 2 == 1) or (mi % 2 == 0)) {mi = cnt[j];ii = j;}} else if ((cnt[j] % 2 == 1) and (mi % 2 == 0)) {mi = cnt[j];ii = j;}} else {if (cnt[j] < mi) {mi = cnt[j];ii = j;}}}if (ii == -1) {return {};}cnt[ii] -= deg[i];color[i] = ii;}return color;};vec(ll, V_color, 0);while (1) {V_color = vertex_color(x);if (!V_color.empty()) break;V_color = vertex_color2(x);if (!V_color.empty()) break;V_color = vertex_color3(x);if (!V_color.empty()) break;V_color = vertex_color4(x);if (!V_color.empty()) break;x++;}for (auto &[u, v] : E) {if (V_color[u] > V_color[v]) swap(u, v);}vvec(int, Es, x);vvec(int, same, x);fori(i, n - 1) {auto [u, v] = E[i];if (V_color[u] == V_color[v]) {same[V_color[u]].push_back(i);} else {Es[V_color[u]].push_back(i);Es[V_color[v]].push_back(i);}}vec(Pii, E_color, n - 1, {-1, -1});fori(t, x) {int a = 0;int b = 1;bool op2 = false;fori(i, len(Es[t]) - 1) {int j1 = Es[t][i];int j2 = Es[t][i + 1];int u1 = E[j1].first;int u2 = E[j2].first;if (u1 == u2) {op2 = true;break;}}if (!same[t].empty()) {op2 = false;}for (auto j : Es[t]) {auto [u, v] = E[j];if (V_color[u] == t) {op2 = false;break;}}if (!op2) {for (auto j : Es[t]) {auto [u, v] = E[j];if (a > b) swap(a, b);int c = b + 1;if (t == V_color[u]) {E_color[j].first = a;a = c;} else {if (a != E_color[j].first) {E_color[j].second = a;a = c;} else {E_color[j].second = b;b = c;}}}for (auto j : same[t]) {auto [u, v] = E[j];E_color[j] = {a, b};int c = max(a, b) + 1;int d = c + 1;a = c;b = d;}}if (op2) {int idx = -1;fori(i, len(Es[t]) - 1) {int j1 = Es[t][i];int j2 = Es[t][i + 1];int u1 = E[j1].first;int u2 = E[j2].first;if (u1 == u2) {idx = i;break;}}int a = 0;int b = 1;for (auto j : Es[t]) {if (j == idx or j == idx + 1) continue;auto [u, v] = E[j];if (a > b) swap(a, b);int c = b + 1;if (t == V_color[u]) {E_color[j].first = a;a = c;} else {if (a != E_color[j].first) {E_color[j].second = a;a = c;} else {E_color[j].second = b;b = c;}}}{if (E_color[Es[t][idx]].first != a and E_color[Es[t][idx + 1]].first != b) {E_color[Es[t][idx]].second = a;E_color[Es[t][idx + 1]].second = b;} else {E_color[Es[t][idx]].second = b;E_color[Es[t][idx + 1]].second = a;}}}}print(x);fori(i, n) {vec(int, out, deg[i] + 1, -1);out[0] = V_color[i] + 1;fori(j, deg[i]) {int ii = edges[i][j];if (i == E[ii].first) {out[j + 1] = E_color[ii].first + 1;} else {out[j + 1] = E_color[ii].second + 1;}}print(out);}#ifdef RIN__LOCALfori(i, n - 1) {assert(E_color[i].first != E_color[i].second);}map<Pii, Pii> mp;fori(i, n) {vec(int, out, deg[i] + 1, -1);out[0] = V_color[i] + 1;fori(j, deg[i]) {int ii = edges[i][j];if (i == E[ii].first) {out[j + 1] = E_color[ii].first + 1;} else {out[j + 1] = E_color[ii].second + 1;}assert(!mp.count({out[0], out[j + 1]}));mp[{out[0], out[j + 1]}] = {i, j};}}#endif}int main() {#ifndef INTERACTIVEstd::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"//// void solve() {// INT(n);// vvec(int, edges, n);// vec(int, deg, n);// vec(Pii, E, n - 1, {-1, -1});// fori(i, n) {// cin >> deg[i];// fori(deg[i]) {// INT(x);// x--;// if (E[x].first == -1) {// E[x].first = i;// } else {// E[x].second = i;// }// edges[i].push_back(x);// }// }//// vec(int, idx, n);// iota(all(idx), 0);// sort(all(idx), [&](int i, int j) { return deg[i] > deg[j]; });// ll x = 0;// while (x * x < 2 * n - 2) x++;// ll y = x + 2;// for (auto d : deg) chmax(x, d);//// auto vertex_color = [&](ll x) -> vector<ll> {// vec(ll, color, n, -1);// ll y_ = min(x, y);// vec(ll, cnt, y_, x);// for (auto i : idx) {// ll ma = -1;// int ii = -1;//// fori(j, y_) {// if (chmax(ma, cnt[j])) {// ii = j;// }// }// if (ii == -1 or ma < deg[i]) {// return {};// }//// cnt[ii] -= deg[i];// color[i] = ii;// }// return color;// };//// auto vertex_color2 = [&](ll x) -> vector<ll> {// vec(ll, color, n, -1);// ll y_ = min(x, y);// vec(ll, cnt, y_, x);// for (auto i : idx) {// ll mi = x + 10;// int ii = -1;//// fori(j, y_) {// if (cnt[j] >= deg[i] and chmin(mi, cnt[j])) {// ii = j;// }// }// if (ii == -1) {// return {};// }//// cnt[ii] -= deg[i];// color[i] = ii;// }// return color;// };//// auto vertex_color3 = [&](ll x) -> vector<ll> {// vec(ll, color, n, -1);// ll y_ = min(x, y);// vec(ll, cnt, y_, x);// for (auto i : idx) {// ll ma = -2;// int ii = -1;//// fori(j, y_) {// if (deg[i] & 1) {// if (cnt[j] > ma) {// if ((cnt[j] % 2 == 1) or (ma % 2 == 0)) {// ma = cnt[j];// ii = j;// }// } else if (cnt[j] > deg[i] and (cnt[j] % 2 == 1) and (ma % 2 == 0)) {// ma = cnt[j];// ii = j;// }// } else {// if (chmax(ma, cnt[j])) {// ii = j;// }// }// }// if (ii == -1 or ma < deg[i]) {// return {};// }//// cnt[ii] -= deg[i];// color[i] = ii;// }// return color;// };//// auto vertex_color4 = [&](ll x) -> vector<ll> {// vec(ll, color, n, -1);// ll y_ = min(x, y);// vec(ll, cnt, y_, x);// for (auto i : idx) {// ll mi = x + 10 + (x % 2);// int ii = -1;//// fori(j, y_) {// if (cnt[j] < deg[i]) continue;// if (deg[i] % 2 == 1) {// if (cnt[j] < mi) {// if ((cnt[j] % 2 == 1) or (mi % 2 == 0)) {// mi = cnt[j];// ii = j;// }// } else if ((cnt[j] % 2 == 1) and (mi % 2 == 0)) {// mi = cnt[j];// ii = j;// }// } else {// if (cnt[j] < mi) {// mi = cnt[j];// ii = j;// }// }// }// if (ii == -1) {// return {};// }//// cnt[ii] -= deg[i];// color[i] = ii;// }// return color;// };//// vec(ll, V_color, 0);// while (1) {// V_color = vertex_color(x);// if (!V_color.empty()) break;// V_color = vertex_color2(x);// if (!V_color.empty()) break;// V_color = vertex_color3(x);// if (!V_color.empty()) break;// V_color = vertex_color4(x);// if (!V_color.empty()) break;//// x++;// }//// for (auto &[u, v] : E) {// if (V_color[u] > V_color[v]) swap(u, v);// }//// vvec(int, Es, x);// vvec(int, same, x);//// fori(i, n - 1) {// auto [u, v] = E[i];// if (V_color[u] == V_color[v]) {// same[V_color[u]].push_back(i);// } else {// Es[V_color[u]].push_back(i);// Es[V_color[v]].push_back(i);// }// }//// vec(Pii, E_color, n - 1, {-1, -1});//// fori(t, x) {// int a = 0;// int b = 1;//// bool op2 = false;// fori(i, len(Es[t]) - 1) {// int j1 = Es[t][i];// int j2 = Es[t][i + 1];// int u1 = E[j1].first;// int u2 = E[j2].first;//// if (u1 == u2) {// op2 = true;// break;// }// }//// if (!same[t].empty()) {// op2 = false;// }// for (auto j : Es[t]) {// auto [u, v] = E[j];// if (V_color[u] == t) {// op2 = false;// break;// }// }//// if (!op2) {// for (auto j : Es[t]) {// auto [u, v] = E[j];//// if (a > b) swap(a, b);// int c = b + 1;// if (t == V_color[u]) {// E_color[j].first = a;// a = c;// } else {// if (a != E_color[j].first) {// E_color[j].second = a;// a = c;// } else {// E_color[j].second = b;// b = c;// }// }// }// for (auto j : same[t]) {// auto [u, v] = E[j];// E_color[j] = {a, b};// int c = max(a, b) + 1;// int d = c + 1;// a = c;// b = d;// }// }//// if (op2) {// int idx = -1;// fori(i, len(Es[t]) - 1) {// int j1 = Es[t][i];// int j2 = Es[t][i + 1];// int u1 = E[j1].first;// int u2 = E[j2].first;//// if (u1 == u2) {// idx = i;// break;// }// }//// int a = 0;// int b = 1;// for (auto j : Es[t]) {// if (j == idx or j == idx + 1) continue;// auto [u, v] = E[j];// if (a > b) swap(a, b);//// int c = b + 1;// if (t == V_color[u]) {// E_color[j].first = a;// a = c;// } else {// if (a != E_color[j].first) {// E_color[j].second = a;// a = c;// } else {// E_color[j].second = b;// b = c;// }// }// }// {// if (E_color[Es[t][idx]].first != a and E_color[Es[t][idx + 1]].first != b) {// E_color[Es[t][idx]].second = a;// E_color[Es[t][idx + 1]].second = b;// } else {// E_color[Es[t][idx]].second = b;// E_color[Es[t][idx + 1]].second = a;// }// }// }// }//// print(x);//// fori(i, n) {// vec(int, out, deg[i] + 1, -1);// out[0] = V_color[i] + 1;// fori(j, deg[i]) {// int ii = edges[i][j];// if (i == E[ii].first) {// out[j + 1] = E_color[ii].first + 1;// } else {// out[j + 1] = E_color[ii].second + 1;// }// }// print(out);// }//// #ifdef RIN__LOCAL// fori(i, n - 1) {// assert(E_color[i].first != E_color[i].second);// }// map<Pii, Pii> mp;// fori(i, n) {// vec(int, out, deg[i] + 1, -1);// out[0] = V_color[i] + 1;// fori(j, deg[i]) {// int ii = edges[i][j];// if (i == E[ii].first) {// out[j + 1] = E_color[ii].first + 1;// } else {// out[j + 1] = E_color[ii].second + 1;// }// assert(!mp.count({out[0], out[j + 1]}));// mp[{out[0], out[j + 1]}] = {i, j};// }// }// #endif// }//// 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;// }