結果

問題 No.277 根掘り葉掘り
ユーザー fumiphysfumiphys
提出日時 2019-10-27 21:54:17
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 210 ms / 3,000 ms
コード長 3,673 bytes
コンパイル時間 1,698 ms
コンパイル使用メモリ 173,520 KB
実行使用メモリ 21,376 KB
最終ジャッジ日時 2024-09-14 21:07:33
合計ジャッジ時間 4,851 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
8,192 KB
testcase_01 AC 4 ms
8,064 KB
testcase_02 AC 5 ms
8,028 KB
testcase_03 AC 4 ms
8,192 KB
testcase_04 AC 4 ms
8,064 KB
testcase_05 AC 3 ms
8,112 KB
testcase_06 AC 4 ms
8,192 KB
testcase_07 AC 3 ms
8,064 KB
testcase_08 AC 4 ms
8,024 KB
testcase_09 AC 210 ms
21,376 KB
testcase_10 AC 163 ms
13,012 KB
testcase_11 AC 189 ms
13,780 KB
testcase_12 AC 198 ms
16,992 KB
testcase_13 AC 198 ms
14,000 KB
testcase_14 AC 194 ms
14,080 KB
testcase_15 AC 195 ms
14,808 KB
testcase_16 AC 191 ms
14,300 KB
testcase_17 AC 191 ms
14,300 KB
testcase_18 AC 190 ms
14,336 KB
testcase_19 AC 191 ms
14,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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];
queue<int> q;

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

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(x);
  }
  dfs1(0);
  fill(r, r + n, -1);
  dfs(0);
  while(!q.empty()){
    auto p = q.front(); q.pop();
    for(auto e: edge[p]){
      if(r[e] < 0){
        r[e] = r[p] + 1;
        q.push(e);
      }
    }
  }
  rep(i, n)cout << min(l[i], r[i]) << endl;
  return 0;
}
0