結果
問題 | No.277 根掘り葉掘り |
ユーザー |
|
提出日時 | 2015-09-06 11:10:06 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 52 ms / 3,000 ms |
コード長 | 2,716 bytes |
コンパイル時間 | 1,101 ms |
コンパイル使用メモリ | 161,956 KB |
実行使用メモリ | 15,828 KB |
最終ジャッジ日時 | 2024-07-19 04:21:16 |
合計ジャッジ時間 | 2,602 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#define EPS 1e-9#define INF 1070000000LL#define MOD 1000000007LL#define fir first#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)#define numa(x,a) for(auto x: a)#define ite iterator#define mp make_pair#define rep(i,n) rep2(i,0,n)#define rep2(i,m,n) for(int i=m;i<(n);i++)#define pb push_back#define pf push_front#define sec second#define sz(x) ((int)(x).size())#define ALL( c ) (c).begin(), (c).end()#define gcd(a,b) __gcd(a,b)#define mem(x,n) memset(x,n,sizeof(x))#define endl "\n"using namespace std;template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t);deploy<POS + 1, TUPLE, Ts...>(os, t); }template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e <<(--remain == 0 ? "}" : ", "); return os; }template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain== 0 ? "}" : ", "); return os; }template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }using ll = long long;vector <int> edge[100100];int L[100100];int R[100100];int N;int go(int x, int par=-1){if (x != 0) {R[x] = R[par] + 1;}else{R[x] = 0;}int z = INF;if (sz(edge[x]) == 1) {z = 0;}numa(y,edge[x]){if (y != par) {z = min(z, 1 + go(y, x));}}L[x] = z;return z;}void go2(int x, int par=-1) {if (x != 0) {L[x] = min(L[par] + 1, L[x]);}numa(y,edge[x]){if (y != par) {go2(y,x);}}}int main(){cin.tie(0);ios_base::sync_with_stdio(0);cin >> N;rep(i,N-1){int x,y;cin >> x >> y;x--;y--;edge[x].pb(y);edge[y].pb(x);}go(0);go2(0);rep(x,N){cout << min(L[x],R[x]) << endl;}return 0;}