結果
問題 | No.2532 Want Play More |
ユーザー |
👑 ![]() |
提出日時 | 2023-08-01 00:14:30 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 167 ms / 2,000 ms |
コード長 | 4,197 bytes |
コンパイル時間 | 16,241 ms |
コンパイル使用メモリ | 263,648 KB |
最終ジャッジ日時 | 2025-02-15 21:12:50 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法.x^nをmodで割った余り.ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }void dfs(vector<vector<ll>> &graph, vector<bool> &isvisited, vector<ll> &dp1,vector<ll> &dp2, ll v) {isvisited[v] = true;ll ret_min = 1000000;ll ret_max = 0;bool passed = false;for (ll i = 0; i < graph[v].size(); i++) {if (isvisited[graph[v][i]]) {continue;}passed = true;dfs(graph, isvisited, dp1, dp2, graph[v][i]);ret_min = min(ret_min, dp1[graph[v][i]]);ret_max = max(ret_max, dp2[graph[v][i]]);}if (passed) {dp1[v] = ret_max + 1;dp2[v] = ret_min + 1;} else {dp1[v] = 0;dp2[v] = 0;}}int main() {ll N;cin >> N;vector<ll> a(N - 1);vector<ll> b(N - 1);for (ll i = 0; i < N - 1; i++) {cin >> a[i] >> b[i];a[i]--;b[i]--;}vector<vector<ll>> graph(N, vector<ll>(0));for (ll i = 0; i < N - 1; i++) {graph[a[i]].push_back(b[i]);graph[b[i]].push_back(a[i]);}vector<ll> dp1(N); // この頂点に Halcvector<ll> dp2(N); // この頂点に Sappvector<bool> isvisited(N, false);dfs(graph, isvisited, dp1, dp2, 0);cout << dp1[0] << endl;cout << dp2[0] << endl;}