結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2016-08-14 14:08:35 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 234 ms / 3,000 ms |
コード長 | 2,662 bytes |
コンパイル時間 | 1,532 ms |
コンパイル使用メモリ | 165,740 KB |
実行使用メモリ | 17,024 KB |
最終ジャッジ日時 | 2024-11-07 16:45:39 |
合計ジャッジ時間 | 5,966 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include "bits/stdc++.h"using namespace std;typedef long long ll;typedef unsigned long long ull;typedef vector<int> veci;typedef vector<ll> vecll;typedef vector<string> vecs;template<class T,class U> using Hash=unordered_map<T,U>;#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)#define rep(i, n) REP(i, 0, n)#define rrep(i, n) RREP(i, 0, n)#define MD 1000000007#define _SPLIT " "template<class T> T read(){T a;cin >> a;return a;}template<class T> void read(T& a){cin >> a;}template<class T,class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);}template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}template<class T> void write(T a){cout << setprecision(22) << a << endl;}template<class T,class ...Args> void write(T a, Args... args){cout << setprecision(22) << a << _SPLIT; write(args...);}template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}vector<int> v[100000];int n,res[100000];int solve1(int i,int bef,int d){if(v[i].size()<=1&&v[i][0]==bef)return res[i]=0;res[i]=d;for(auto at:v[i]){if(at==bef)continue;res[i]=min(res[i],solve1(at,i,d+1)+1);}return res[i];}void solve2(int i,int bef,int d){res[i]=min(res[i],d);for(auto at:v[i]){if(at==bef)continue;solve2(at,i,res[i]+1);}}int main(void){rep(i,100000)res[i]=1e9;read(n);rep(i,n-1){int a,b;read(a,b);a--;b--;v[a].push_back(b);v[b].push_back(a);}solve1(0,-1,0);solve2(0,-1,0);rep(i,n)write(res[i]);return 0;}