結果
問題 | No.277 根掘り葉掘り |
ユーザー |
|
提出日時 | 2019-03-19 20:42:02 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 180 ms / 3,000 ms |
コード長 | 3,070 bytes |
コンパイル時間 | 2,001 ms |
コンパイル使用メモリ | 178,972 KB |
実行使用メモリ | 12,780 KB |
最終ジャッジ日時 | 2024-09-14 06:45:11 |
合計ジャッジ時間 | 5,739 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include "bits/stdc++.h"using namespace std;/* macro */#define rep(i,a,b) for(int i=a;i<b;i++)#define revrep(i,a,b) for(int i = a; i > b; i--)#define int long long#define exist(s,e) ((s).find(e)!=(s).end())#define all(v) (v).begin(), (v).end()#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)#define sum(v) accumulate(all(v), (0LL))#define isin(a, b, c) (b <= a && a <= c)#define println cout << "\n";#define sz(v) (int)v.size()#define bin(x) static_cast<bitset<16> >(x)/* alias */template<class T> using vec = vector<T>;typedef vector<int> vi;typedef pair<int, int> pi;typedef tuple<int, int, int> ti;typedef map<int, int> mi;typedef set<int> si;/* constant */const int inf = 1LL << 62;const int mod = 1e9 + 7;const int dx[8]={1,0,-1,0,-1,1,-1,1};const int dy[8]={0,1,0,-1,-1,-1,1,1};const string alphabet = "abcdefghijklmnopqrstuvwxyz";/* io_method */int input(){int tmp;cin >> tmp;return tmp;}string raw_input(){string tmp;cin >> tmp;return tmp;}template<class T> void printx(T n){cout << n;}template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}template<class T> void print(T n){printx(n);cout << endl;}template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" <<endl;}template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;}/* general_method */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 (b<a) { a=b; return 1; } return 0; }template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}/* main */int n;vec<vi> edges(101010);vi leaf = {0};void in(){cin >> n;rep(i,0,n - 1){int f, t; cin >> f >> t;f--; t--;edges[f].push_back(t);edges[t].push_back(f);}rep(i,0,n){if(sz(edges[i]) == 1) leaf.push_back(i);}}void solve(){vi dist(n, inf);queue<pi> que;for(int l : leaf){dist[l] = 0;que.push(pi(l, 0));}while(not que.empty()){int v = que.front().first;int d = que.front().second;que.pop();rep(i,0,sz(edges[v])){int nxt = edges[v][i];if(chmin(dist[nxt], d + 1)){que.push(pi(nxt, dist[nxt]));}}}rep(i,0,n){print(dist[i]);}}signed main(){cin.tie(0);ios::sync_with_stdio(false);in();solve();}