結果

問題 No.2532 Want Play More
ユーザー umimel
提出日時 2023-11-03 22:27:22
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 3,361 bytes
コンパイル時間 1,669 ms
コンパイル使用メモリ 178,084 KB
実行使用メモリ 47,032 KB
最終ジャッジ日時 2024-09-25 20:51:54
合計ジャッジ時間 4,683 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;
template<typename T>
struct edge{
int from, to;
T cost;
edge(){}
edge(int to, T cost = 1) : from(-1), to(to), cost(cost){}
edge(int from, int to, T cost) : from(from), to(to), cost(cost){}
};
template<typename T>
struct redge{
int from, to;
T cap, cost;
int rev;
redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}
redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}
};
template<typename T> using Edges = vector<edge<T>>;
template<typename T> using weighted_graph = vector<Edges<T>>;
template<typename T> using tree = vector<Edges<T>>;
using unweighted_graph = vector<vector<int>>;
template<typename T> using residual_graph = vector<vector<redge<T>>>;
void solve(){
ll n; cin >> n;
tree<ll> T(n);
rep(i, n-1){
ll u, v; cin >> u >> v;
u--; v--;
T[u].pb(edge<ll>(v));
T[v].pb(edge<ll>(u));
}
//Case1 : Halc
{
vector<ll> dp(n, 0);
//turn=0:Halc, turn=1:Sapp
function<void(ll, ll, ll)> dfs = [&](ll v, ll p, bool turn){
if(turn==false){
for(edge<ll> e : T[v]) if(e.to!=p){
dfs(e.to, v, !turn);
dp[v] = max(dp[v], dp[e.to]+1);
}
}
if(turn==true){
bool check = false;
for(edge<ll> e : T[v]) if(e.to!=p){
dfs(e.to, v, !turn);
if(!check){
dp[v] = dp[e.to]+1;
check = true;
}else{
dp[v] = min(dp[v], dp[e.to]+1);
}
}
}
};
dfs(0, -1, 0);
cout << dp[0] << endl;
}
//Case2 : Halc
{
vector<ll> dp(n, 0);
//turn=0:Halc, turn=1:Sapp
function<void(ll, ll, ll)> dfs = [&](ll v, ll p, bool turn){
if(turn==false){
for(edge<ll> e : T[v]) if(e.to!=p){
dfs(e.to, v, !turn);
dp[v] = max(dp[v], dp[e.to]+1);
}
}
if(turn==true){
bool check = false;
for(edge<ll> e : T[v]) if(e.to!=p){
dfs(e.to, v, !turn);
if(!check){
dp[v] = dp[e.to]+1;
check = true;
}else{
dp[v] = min(dp[v], dp[e.to]+1);
}
}
}
};
dfs(0, -1, 1);
cout << dp[0] << endl;
}
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int T=1;
//cin >> T;
while(T--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0