結果
| 問題 | No.2677 Minmax Independent Set |
| ユーザー |
 hitonanode
|
| 提出日時 | 2024-03-15 22:24:03 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 186 ms / 2,000 ms |
| コード長 | 10,334 bytes |
| コンパイル時間 | 2,263 ms |
| コンパイル使用メモリ | 198,704 KB |
| 実行使用メモリ | 37,808 KB |
| 最終ジャッジ日時 | 2024-09-30 01:48:13 |
| 合計ジャッジ時間 | 9,163 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 61 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <memory>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endif#include <cassert>#include <cstdlib>#include <utility>#include <vector>// Rerooting// Reference:// - https://atcoder.jp/contests/abc222/editorial/2749// - https://null-mn.hatenablog.com/entry/2020/04/14/124151template <class Edge, class St, class Ch, Ch (*merge)(Ch, Ch), Ch (*f)(St, int, Edge),St (*g)(Ch, int), Ch (*e)()>struct rerooting {int n_;std::vector<int> par, visited;std::vector<std::vector<std::pair<int, Edge>>> to;std::vector<St> dp_subtree;std::vector<St> dp_par;std::vector<St> dpall;rerooting(const std::vector<std::vector<std::pair<int, Edge>>> &to_): n_(to_.size()), par(n_, -1), visited(n_, 0), to(to_) {for (int i = 0; i < n_; ++i) dp_subtree.push_back(g(e(), i));dp_par = dpall = dp_subtree;}void run_connected(int root) {if (visited[root]) return;visited[root] = 1;std::vector<int> visorder{root};for (int t = 0; t < int(visorder.size()); ++t) {int now = visorder[t];for (const auto &edge : to[now]) {int nxt = edge.first;if (visited[nxt]) continue;visorder.push_back(nxt);visited[nxt] = 1;par[nxt] = now;}}for (int t = int(visorder.size()) - 1; t >= 0; --t) {int now = visorder[t];Ch ch = e();for (const auto &edge : to[now]) {int nxt = edge.first;if (nxt == par[now]) continue;ch = merge(ch, f(dp_subtree[nxt], nxt, edge.second));}dp_subtree[now] = g(ch, now);}std::vector<Ch> left;for (int now : visorder) {int m = int(to[now].size());left.assign(m + 1, e());for (int j = 0; j < m; j++) {int nxt = to[now][j].first;const St &st = (nxt == par[now] ? dp_par[now] : dp_subtree[nxt]);left[j + 1] = merge(left[j], f(st, nxt, to[now][j].second));}dpall[now] = g(left.back(), now);Ch rprod = e();for (int j = m - 1; j >= 0; --j) {int nxt = to[now][j].first;if (nxt != par[now]) dp_par[nxt] = g(merge(left[j], rprod), now);const St &st = (nxt == par[now] ? dp_par[now] : dp_subtree[nxt]);rprod = merge(f(st, nxt, to[now][j].second), rprod);}}}void run() {for (int i = 0; i < n_; ++i) {if (!visited[i]) run_connected(i);}}const St &get_subtree(int root_, int par_) const {if (par_ < 0) return dpall.at(root_);if (par.at(root_) == par_) return dp_subtree.at(root_);if (par.at(par_) == root_) return dp_par.at(par_);std::exit(1);}};using Subtree = pint; // (塗った、塗らない)using Child = pint;struct Edge {};Child e() { return {0, 0}; }Child merge(Child x, Child y) { return {max(x.first, x.second) + max(y.first, y.second), x.second + y.second}; }Child f(Subtree x, int, Edge) { return x; }Subtree g(Child x, int) { return {1 + x.second, max(x.first, x.second)}; }int main() {int N;cin >> N;vector<vector<pair<int, Edge>>> to(N);REP(e, N - 1) {int a, b;cin >> a >> b;--a, --b;to.at(a).emplace_back(b, Edge{});to.at(b).emplace_back(a, Edge{});}rerooting<Edge, Subtree, Child, merge, f, g, e> tree(to);tree.run();int ret = N;REP(i, N) {dbg(make_tuple(i, tree.dpall.at(i)));chmin(ret, tree.dpall.at(i).first);}cout << ret << '\n';}