#394374 (C++14) No.277 根掘り葉掘り

• 問題: No.277 根掘り葉掘り
• ユーザー: fumiphys
• 提出日時: 2019-10-27 21:47:26
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,506 bytes
• コンパイル時間: 1,852 ms
• コンパイル使用メモリ: 169,756 KB
• 実行使用メモリ: 12,844 KB
• 最終ジャッジ日時: 2024-09-14 21:07:20
• 合計ジャッジ時間: 5,433 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 8,064 KB
testcase_01	AC	4 ms; 8,064 KB
testcase_02	WA	-
testcase_03	AC	4 ms; 8,064 KB
testcase_04	AC	4 ms; 8,064 KB
testcase_05	AC	5 ms; 8,064 KB
testcase_06	AC	5 ms; 8,024 KB
testcase_07	WA	-
testcase_08	AC	4 ms; 8,064 KB
testcase_09	WA	-
testcase_10	AC	166 ms; 12,844 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-

ソースコード

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

vector<int> edge[100010], child[100010];
bool vis[100010];

void dfs1(int i){
  vis[i] = true;
  for(auto e: edge[i]){
    if(!vis[e]){
      dfs1(e);
      child[i].pb(e);
    }
  }
}

int l[100010], r[100010];

void dfs(int i){
  if(sz(child[i]) == 0){
    r[i] = 0;
    return;
  }
  r[i] = inf;
  for(auto e: child[i]){
    l[e] = l[i] + 1;
    dfs(e);
    r[i] = min(r[i], r[e] + 1);
  }
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  rep(i, n - 1){
    int x, y; cin >> x >> y, x--, y--;
    edge[x].pb(y);
    edge[y].pb(y);
  }
  dfs1(0);
  dfs(0);
  rep(i, n)cout << min(l[i], r[i]) << endl;
  return 0;
}