結果
問題 | No.2532 Want Play More |
ユーザー | dyktr_06 |
提出日時 | 2023-11-03 22:04:36 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 148 ms / 2,000 ms |
コード長 | 5,433 bytes |
コンパイル時間 | 4,319 ms |
コンパイル使用メモリ | 266,744 KB |
実行使用メモリ | 29,888 KB |
最終ジャッジ日時 | 2023-11-03 22:04:51 |
合計ジャッジ時間 | 7,049 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 148 ms
18,536 KB |
testcase_02 | AC | 147 ms
18,536 KB |
testcase_03 | AC | 134 ms
17,744 KB |
testcase_04 | AC | 126 ms
17,744 KB |
testcase_05 | AC | 122 ms
17,216 KB |
testcase_06 | AC | 78 ms
29,888 KB |
testcase_07 | AC | 3 ms
4,348 KB |
testcase_08 | AC | 5 ms
4,348 KB |
testcase_09 | AC | 4 ms
4,348 KB |
testcase_10 | AC | 51 ms
10,420 KB |
testcase_11 | AC | 48 ms
10,156 KB |
testcase_12 | AC | 92 ms
14,576 KB |
testcase_13 | AC | 62 ms
11,476 KB |
testcase_14 | AC | 19 ms
6,196 KB |
testcase_15 | AC | 140 ms
18,272 KB |
testcase_16 | AC | 117 ms
15,896 KB |
testcase_17 | AC | 4 ms
4,348 KB |
testcase_18 | AC | 77 ms
13,060 KB |
testcase_19 | AC | 112 ms
16,160 KB |
testcase_20 | AC | 2 ms
4,348 KB |
testcase_21 | AC | 2 ms
4,348 KB |
testcase_22 | AC | 2 ms
4,348 KB |
testcase_23 | AC | 2 ms
4,348 KB |
testcase_24 | AC | 2 ms
4,348 KB |
testcase_25 | AC | 2 ms
4,348 KB |
testcase_26 | AC | 2 ms
4,348 KB |
testcase_27 | AC | 1 ms
4,348 KB |
testcase_28 | AC | 54 ms
19,020 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll n; void input(){ in(n); } vll dist; vll ans; vector<vll> G; void dfs(ll curr, ll prev){ for(auto x : G[curr]){ if(x == prev) continue; dist[x] = dist[curr] + 1; dfs(x, curr); } } ll solve1(ll curr, ll prev){ ll mn = INF, mx = -INF; for(auto x : G[curr]){ if(x == prev) continue; ll ret = solve1(x, curr); chmin(mn, ret); chmax(mx, ret); } if(mn == INF){ mn = dist[curr]; mx = dist[curr]; } if(dist[curr] % 2 == 0){ return mx; }else{ return mn; } } ll solve2(ll curr, ll prev){ ll mn = INF, mx = -INF; for(auto x : G[curr]){ if(x == prev) continue; ll ret = solve2(x, curr); chmin(mn, ret); chmax(mx, ret); } if(mn == INF){ mn = dist[curr]; mx = dist[curr]; } if(dist[curr] % 2 == 1){ return mx; }else{ return mn; } } void solve(){ G.resize(n); dist.resize(n); ans.resize(n); rep(i, n - 1){ ll a, b; in(a, b); a--, b--; G[a].push_back(b); G[b].push_back(a); } dfs(0, -1); out(solve1(0, -1)); out(solve2(0, -1)); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }