結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2016-04-23 02:15:47 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 71 ms / 3,000 ms |
コード長 | 3,177 bytes |
コンパイル時間 | 1,703 ms |
コンパイル使用メモリ | 170,868 KB |
実行使用メモリ | 11,040 KB |
最終ジャッジ日時 | 2024-10-04 15:15:15 |
合計ジャッジ時間 | 3,956 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define all(c) ((c).begin()), ((c).end())#define dump(c) cerr << "> " << #c << " = " << (c) << endl;#define iter(c) __typeof((c).begin())#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)#define REP(i, a, b) for (int i = a; i < (int)(b); i++)#define rep(i, n) REP(i, 0, n)#define mp make_pair#define fst first#define snd second#define pb push_back#define debug( fmt, ... ) \fprintf( stderr, \fmt "\n", \##__VA_ARGS__ \)typedef unsigned int uint;typedef long long ll;typedef unsigned long long ull;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<vll> vvll;typedef vector<vi> vvi;typedef vector<double> vd;typedef vector<vd> vvd;typedef vector<string> vs;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1 << 29;const double EPS = 1e-10;double zero(double d) {return d < EPS ? 0.0 : d;}template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2> &p) {return os << '(' << p.first << ',' << p.second << ')';}template<typename T>ostream &operator<<(ostream &os, const vector<T> &a) {os << '[';rep(i, a.size()) os << (i ? " " : "") << a[i];return os << ']';}string toString(int i) {stringstream ss;ss << i;return ss.str();}const int MOD = 1000000007;// a^kll fpow(ll a, ll k, int M) {ll res = 1ll;ll x = a;while (k != 0) {if ((k & 1) == 1)res = (res * x) % M;x = (x * x) % M;k >>= 1;}return res;}struct prepare {prepare() {cout.setf(ios::fixed, ios::floatfield);cout.precision(8);ios_base::sync_with_stdio(false);}} _prepare;int MAX_N = (int)(1e5) + 10;vvi edges(MAX_N);vi R(MAX_N);vi L(MAX_N);int main() {int N;cin >> N;rep(i, N-1) {int x,y;cin >> x >> y;--x, --y;edges[x].push_back(y);edges[y].push_back(x);}fill(all(R), -1);fill(all(L), INF);queue<pii> que, leaf_que;que.push(mp(0, 0));while(!que.empty()) {pii qp = que.front(); que.pop();int v = qp.first;int d = qp.second;R[v] = d;bool has_child = false;tr(it, edges[v]) {if(R[*it] == -1) {que.push(mp(*it, d+1));has_child = true;}}if(!has_child)leaf_que.push(mp(v, 0));}while(!leaf_que.empty()) {pii qp = leaf_que.front(); leaf_que.pop();int v = qp.first;int d = qp.second;if(! chmin(L[v], d) )continue;tr(it, edges[v]) {if(L[*it] > d+1) {leaf_que.push(mp(*it, d+1));}}}rep(i, N)printf("%d\n", min(R[i], L[i]));return 0;}