結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2015-09-04 22:48:33 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 50 ms / 3,000 ms |
コード長 | 3,134 bytes |
コンパイル時間 | 833 ms |
コンパイル使用メモリ | 102,672 KB |
実行使用メモリ | 11,088 KB |
最終ジャッジ日時 | 2024-07-19 01:28:13 |
合計ジャッジ時間 | 2,353 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <iostream>#include <iomanip>#include <sstream>#include <vector>#include <string>#include <set>#include <unordered_set>#include <map>#include <unordered_map>#include <stack>#include <queue>#include <deque>#include <algorithm>#include <functional>#include <iterator>#include <limits>#include <numeric>#include <utility>#include <cmath>#include <cassert>#include <cstdio>using namespace std; using namespace placeholders;using LL = long long;using ULL = unsigned long long;using VI = vector< int >;using VVI = vector< vector< int > >;using VS = vector< string >;using SS = stringstream;using PII = pair< int, int >;using VPII = vector< pair< int, int > >;template < typename T = int > using VT = vector< T >;template < typename T = int > using VVT = vector< vector< T > >;template < typename T = int > using LIM = numeric_limits< T >;template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i) << v[i]; } return s; }template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };#define REP2( i, n ) REP3( i, 0, n )#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )#define GET_REP( a, b, c, F, ... ) F#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )#define FOR( e, c ) for ( auto &e : c )#define ALL( c ) ( c ).begin(), ( c ).end()#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()#define SZ( v ) ( (int)( v ).size() )#define PB push_back#define EM emplace#define EB emplace_back#define BI back_inserter#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )#define MP make_pair#define fst first#define snd second#define DUMP( x ) cerr << #x << " = " << ( x ) << endlVI bfs( const VVI &G, const VI &starts ){const int N = SZ( G );VI distances( N, N );queue< int > que;FOR( v, starts ){distances[v] = 0;que.push( v );}while ( !que.empty() ){const int u = que.front();que.pop();FOR( v, G[u] ){if ( distances[u] + 1 < distances[v] ){distances[v] = distances[u] + 1;que.push( v );}}}return distances;}int main(){cin.tie( 0 );ios::sync_with_stdio( false );int N;cin >> N;VVI G( N );REP( i, N - 1 ){int a, b;cin >> a >> b;--a, --b;G[a].PB( b );G[b].PB( a );}VI leaves;REP( i, N ){if ( SZ( G[i] ) == 1 ){leaves.PB( i );}}const VI from_root = bfs( G, { 0 } );const VI from_leaves = bfs( G, leaves );VI res;transform( ALL( from_root ), begin( from_leaves ), BI( res ), []( const int a, const int b ){ return min( a, b ); } );copy( ALL( res ), ostream_iterator< int >( cout , "\n" ) );cout << flush;return 0;}