結果

問題 No.1976 Cut then Connect
ユーザー stoqstoq
提出日時 2022-06-10 23:09:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,130 bytes
コンパイル時間 4,679 ms
コンパイル使用メモリ 270,752 KB
最終ジャッジ日時 2025-01-29 20:16:08
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 5 WA * 26
権限があれば一括ダウンロードができます

ソースコード

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

#define MOD_TYPE 2
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
//#include <atcoder/modint>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 0
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
io_init() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(30) << setiosflags(ios::fixed);
};
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
inline ll floor(ll a, ll b) {
if (b < 0) a *= -1, b *= -1;
if (a >= 0) return a / b;
return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
vector<T> val = v;
sort(all(val)), val.erase(unique(all(val)), val.end());
for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
is >> p.first >> p.second;
return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
os << p.first << " " << p.second;
return os;
}
ostream &operator<<(ostream &os, mint m) {
os << m.val();
return os;
}
ostream &operator<<(ostream &os, modint m) {
os << m.val();
return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
for (int i = 0; i < v.size(); i++) is >> v[i];
return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
for (int i = 0; i < v.size(); i++)
os << v[i] << (i + 1 == v.size() ? "" : " ");
return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
struct BiCoef {
vector<mint> fact_, inv_, finv_;
BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
mint C(ll n, ll k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
mint Ch1(ll n, ll k) const noexcept {
if (n < 0 || k < 0) return 0;
mint res = 0;
for (int i = 0; i < n; i++)
res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
return res;
}
mint fact(ll n) const noexcept {
if (n < 0) return 0;
return fact_[n];
}
mint inv(ll n) const noexcept {
if (n < 0) return 0;
return inv_[n];
}
mint finv(ll n) const noexcept {
if (n < 0) return 0;
return finv_[n];
}
};
BiCoef bc(200010);
#pragma endregion
// -------------------------------
template <typename T>
struct ReRooting {
using F_f = function<T(T, int, int)>;
using F_g = function<T(T, int)>;
using F_merge = function<T(T, T)>;
int V;
vector<vector<int>> G;
vector<vector<T>> dp;
// dp_v = g(merge(f(dp_c1,c1,v), f(dp_c2,c2,v), ..., f(dp_ck,ck,v)), v)
F_f f;
F_g g;
F_merge merge;
T mi; // identity of merge
ReRooting() {}
ReRooting(int V, F_f f, F_merge merge, T mi, F_g g)
: V(V), f(f), merge(merge), mi(mi), g(g) {
G.resize(V);
dp.resize(V);
}
void read(int idx = 1) {
int a, b;
for (int i = 0; i < V - 1; ++i) {
cin >> a >> b;
a -= idx, b -= idx;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
}
void add_edge(int a, int b) {
G[a].emplace_back(b);
G[b].emplace_back(a);
}
T dfs1(int p, int v) {
T res = mi;
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] == p) continue;
dp[v][i] = dfs1(v, G[v][i]);
res = merge(res, f(dp[v][i], G[v][i], v));
}
return g(res, v);
}
void dfs2(int p, int v, T from_par) {
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] == p) {
dp[v][i] = from_par;
break;
}
}
vector<T> pR(G[v].size() + 1);
pR[G[v].size()] = mi;
for (int i = G[v].size(); i > 0; --i)
pR[i - 1] = merge(pR[i], f(dp[v][i - 1], G[v][i - 1], v));
T pL = mi, val;
for (int i = 0; i < G[v].size(); ++i) {
if (G[v][i] != p) {
val = merge(pL, pR[i + 1]);
dfs2(v, G[v][i], g(val, v));
}
pL = merge(pL, f(dp[v][i], G[v][i], v));
}
}
void calc(int root = 0) {
for (int i = 0; i < V; ++i) dp[i].resize(G[i].size());
dfs1(-1, root);
dfs2(-1, root, mi);
}
T solve(int v) {
T ans = mi;
for (int i = 0; i < G[v].size(); ++i)
ans = merge(ans, f(dp[v][i], G[v][i], v));
return g(ans, v);
}
};
struct dat {
int dp0 = -1, dp1 = -INF;
int dp02 = -INF;
int val() { return max(dp0, dp1); }
};
void solve() {
int n;
cin >> n;
auto f = [&](dat A, int tmp, int tmp2) { return A; };
auto merge = [&](dat A, dat B) {
dat res;
res.dp1 = max(A.dp1, B.dp1);
vector<int> v;
v.push_back(A.dp0);
v.push_back(A.dp02);
v.push_back(B.dp0);
v.push_back(B.dp02);
sort(all(v));
reverse(all(v));
res.dp0 = v[0];
res.dp02 = v[1];
return res;
};
auto g = [&](dat A, int tmp) {
dat res = A;
chmax(res.dp1, A.dp0 + A.dp02 + 2);
res.dp0++;
res.dp02 = -INF;
return res;
};
ReRooting<dat> tr(n, f, merge, dat{}, g);
tr.read();
rep(i, n) { sort(all(tr.G[i])); }
tr.calc();
int ans = INF;
rep(u, n) {
rep(j, tr.G[u].size()) {
int v = tr.G[u][j];
int L = tr.dp[u][j].val();
int i = lower_bound(all(tr.G[v]), u) - tr.G[v].begin();
int R = tr.dp[v][i].val();
chmin(ans, (int)ceil(L, 2) + (int)ceil(R, 2) + 1);
}
}
cout << ans << "\n";
}
int main() { solve(); }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0