結果

問題 No.277 根掘り葉掘り
ユーザー keikei
提出日時 2018-10-03 00:06:26
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 180 ms / 3,000 ms
コード長 2,058 bytes
コンパイル時間 1,767 ms
コンパイル使用メモリ 176,724 KB
実行使用メモリ 10,316 KB
最終ジャッジ日時 2024-10-12 10:08:42
合計ジャッジ時間 5,674 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://yukicoder.me/problems/no/277>
============================================================
=================================================================
=============================================================
================================================================
*/
void solve(){
int N; cin >> N;
vector<vector<int>> G(N+1);
for(int i = 0; i < N-1;i++){
int x,y; cin >> x >> y;
x--; y--;
G[x].push_back(y);
G[y].push_back(x);
}
G[N].push_back(0);
for(int i = 0; i < N;i++){
if(G[i].size()!=1) continue;
G[N].push_back(i);
}
vector<int> info(N+1,INF);
info[N] = 0;
queue<int> q; q.push(N);
while(q.size()){
int n = q.front(); q.pop();
for(auto next:G[n]){
if(info[next] > info[n] + 1){
info[next] = info[n] + 1;
q.push(next);
}
}
}
for(int i = 0; i < N;i++){
cout << info[i] - 1 << endl;
}
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0