結果

問題 No.2888 Mamehinata
ユーザー torus711torus711
提出日時 2024-09-13 21:58:17
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 149 ms / 2,000 ms
コード長 4,639 bytes
コンパイル時間 2,283 ms
コンパイル使用メモリ 171,804 KB
実行使用メモリ 19,436 KB
最終ジャッジ日時 2024-09-13 21:58:27
合計ジャッジ時間 8,249 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 22 ms
5,376 KB
testcase_14 AC 21 ms
8,584 KB
testcase_15 AC 78 ms
9,600 KB
testcase_16 AC 104 ms
16,056 KB
testcase_17 AC 19 ms
7,552 KB
testcase_18 AC 43 ms
6,144 KB
testcase_19 AC 112 ms
15,580 KB
testcase_20 AC 97 ms
13,072 KB
testcase_21 AC 93 ms
12,664 KB
testcase_22 AC 38 ms
9,216 KB
testcase_23 AC 55 ms
11,264 KB
testcase_24 AC 100 ms
17,304 KB
testcase_25 AC 81 ms
16,960 KB
testcase_26 AC 79 ms
16,872 KB
testcase_27 AC 41 ms
14,828 KB
testcase_28 AC 15 ms
5,504 KB
testcase_29 AC 40 ms
8,972 KB
testcase_30 AC 118 ms
17,148 KB
testcase_31 AC 97 ms
15,148 KB
testcase_32 AC 60 ms
11,244 KB
testcase_33 AC 88 ms
14,400 KB
testcase_34 AC 71 ms
12,008 KB
testcase_35 AC 58 ms
10,928 KB
testcase_36 AC 143 ms
18,088 KB
testcase_37 AC 141 ms
18,572 KB
testcase_38 AC 30 ms
7,808 KB
testcase_39 AC 149 ms
15,916 KB
testcase_40 AC 149 ms
18,188 KB
testcase_41 AC 18 ms
6,144 KB
testcase_42 AC 115 ms
16,328 KB
testcase_43 AC 73 ms
16,196 KB
testcase_44 AC 84 ms
17,644 KB
testcase_45 AC 95 ms
19,436 KB
testcase_46 AC 12 ms
5,376 KB
testcase_47 AC 81 ms
17,408 KB
testcase_48 AC 69 ms
12,120 KB
testcase_49 AC 10 ms
5,376 KB
testcase_50 AC 30 ms
5,888 KB
testcase_51 AC 3 ms
5,376 KB
testcase_52 AC 2 ms
5,376 KB
testcase_53 AC 6 ms
5,376 KB
testcase_54 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 <ranges>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#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 VLL = vector< long long >;
using VVLL = vector< vector< long long > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< 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; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T, typename V >
auto make_vector( const int n, const V &v )
{
 return vector< T >( n, v );
}
template < typename T, typename... TS >
auto make_vector( const int n, TS... ts )
{
 return vector< decltype( make_vector< T >( forward< TS >( ts )...) ) >( n, make_vector< T >( forward< TS >( ts )... ) );
}

template < typename T, typename V >
auto make_vector0()
{
	return vector< T >();
}
template < typename T, typename... TS >
auto make_vector0( const int n, TS... ts )
{
	return vector< decltype( make_vector0< T >( forward< TS >( ts )...) ) >( n, make_vector0< T >( forward< TS >( ts )... ) );
}

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 NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#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, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define MAP_PRED( c ) transform( begin( c ), end( c ), begin( c ), bind( minus< int >(), _1, 1 ) );

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

constexpr auto INF = LIM<>::max() / 2;

int main()
{
	cin.tie( nullptr );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, M );
	VVI G( N );
	REP( M )
	{
		IN( int, u, v );
		--u, --v;
		G[u].PB( v );
		G[v].PB( u );
	}

	if ( G[0].empty() )
	{
		REP( N )
		{
			cout << 0 << '\n';
		}
		cout << flush;
		return 0;
	}

	queue< int > que;
	que.push( 0 );

	VI distances( N, INF );
	distances[0] = 0;

	VI evens( N + 1 ), odds( N + 1 );

	while ( !que.empty() )
	{
		const int u = que.front();
		que.pop();

		++( distances[u] % 2 ? odds : evens )[ distances[u] ];

		FOR( v, G[u] )
		{
			if ( chmin( distances[v], distances[u] + 1 ) )
			{
				que.push( v );
			}
		}
	}

	VI psum_e( 1 ), psum_o( 1 );
	partial_sum( ALL( evens ), BI( psum_e ) );
	partial_sum( ALL( odds ), BI( psum_o ) );

	REP( i, 1, N + 1 )
	{
		cout << ( i % 2 ? psum_o : psum_e )[ i + 1 ] << '\n';
	}
	cout << flush;

	return 0;
}
0