結果

問題 No.2946 Puyo
ユーザー torus711torus711
提出日時 2024-10-25 21:28:33
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 6,383 bytes
コンパイル時間 1,804 ms
コンパイル使用メモリ 169,572 KB
実行使用メモリ 16,160 KB
最終ジャッジ日時 2024-10-25 21:28:39
合計ジャッジ時間 4,720 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 19 ms
16,000 KB
testcase_04 AC 18 ms
16,024 KB
testcase_05 AC 18 ms
16,160 KB
testcase_06 AC 19 ms
16,140 KB
testcase_07 AC 20 ms
16,108 KB
testcase_08 AC 4 ms
6,820 KB
testcase_09 AC 8 ms
7,424 KB
testcase_10 AC 3 ms
6,820 KB
testcase_11 AC 12 ms
9,728 KB
testcase_12 AC 3 ms
6,820 KB
testcase_13 AC 1 ms
6,816 KB
testcase_14 AC 5 ms
6,820 KB
testcase_15 AC 4 ms
6,816 KB
testcase_16 AC 7 ms
6,820 KB
testcase_17 AC 16 ms
10,496 KB
testcase_18 AC 2 ms
6,820 KB
testcase_19 AC 10 ms
6,816 KB
testcase_20 AC 13 ms
6,912 KB
testcase_21 AC 21 ms
9,344 KB
testcase_22 AC 4 ms
6,824 KB
testcase_23 AC 14 ms
6,820 KB
testcase_24 AC 29 ms
11,316 KB
testcase_25 AC 25 ms
10,368 KB
testcase_26 AC 28 ms
11,136 KB
testcase_27 AC 2 ms
6,816 KB
testcase_28 AC 15 ms
9,472 KB
testcase_29 AC 19 ms
12,180 KB
testcase_30 AC 12 ms
8,192 KB
testcase_31 AC 18 ms
10,624 KB
testcase_32 AC 17 ms
10,624 KB
testcase_33 AC 16 ms
9,472 KB
testcase_34 AC 21 ms
12,580 KB
testcase_35 AC 18 ms
10,880 KB
testcase_36 AC 19 ms
11,072 KB
testcase_37 AC 20 ms
11,956 KB
testcase_38 AC 16 ms
9,344 KB
testcase_39 AC 14 ms
9,088 KB
testcase_40 AC 9 ms
7,040 KB
testcase_41 AC 17 ms
11,524 KB
testcase_42 AC 16 ms
10,496 KB
testcase_43 AC 15 ms
8,960 KB
testcase_44 AC 17 ms
10,496 KB
testcase_45 AC 15 ms
9,344 KB
testcase_46 AC 10 ms
7,040 KB
testcase_47 AC 14 ms
9,088 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 > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< VT< T > >;
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￣|＼／
//   |      |／

class DisjointSetForest
{
private:
	const int N;

	vector<int> parent;
	vector<int> rank;

	int groups_;
	std::vector< int > sizes;

public:
	DisjointSetForest( int n ) : N( n ), parent( N ), rank( N, 0 ), groups_( N ), sizes( N, 1 )
	{
		std::iota( parent.begin(), parent.end(), 0 );

		return;
	}

	int find( int x )
	{
		if ( parent[x] == x )
		{
			return x;
		}
		return parent[x] = find( parent[x] );
	}

	bool same( int x, int y )
	{
		return find( x ) == find( y );
	}

	bool unite( int x, int y )
	{
		x = find( x );
		y = find( y );

		if ( x == y )
		{
			return false;
		}

		if ( rank[x] < rank[y] )
		{
			parent[x] = y;
			sizes[y] += sizes[x];
		}
		else
		{
			parent[y] = x;
			sizes[x] += sizes[y];

			if ( rank[x] == rank[y] )
			{
				++rank[x];
			}
		}

		--groups_;
		return true;
	}

	int groups() const
	{
		return groups_;
	}

	int groupSize( const int x )
	{
		return sizes[ find( x ) ];
	}
};
// DisjointSetForest( N )
// find( x )
// same( x, y )
// unite( x, y )
// groups()
// groupSize( x )

class DisjointSetForest2d : private DisjointSetForest
{
	const int H, W;

	inline int index( const int y, const int x ) const
	{
		return y * W + x;
	}

public:
	DisjointSetForest2d( const int h, const int w ) :
		DisjointSetForest( h * w ), H( h ), W( w )
	{
		return;
	}

	using base = DisjointSetForest;

	int find( const int y, const int x )
	{
		return base::find( index( y, x ) );
	}

	bool same( const int y1, const int x1, const int y2, const int x2 )
	{
		return base::same( index( y1, x1 ), index( y2, x2 ) );
	}

	bool unite( const int y1, const int x1, const int y2, const int x2 )
	{
		return base::unite( index( y1, x1 ), index( y2, x2 ) );
	}

	int groups() const
	{
		return base::groups();
	}

	int groupSize( const int y, const int x )
	{
		return base::groupSize( index( y, x ) );
	}
};
// find( y, x )
// same( y1, x1, y2, x2 )
// unite( y1, x1, y2, x2 )
// groups()
// groupSize( y, x )

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

	IN( int, H, W );
	VS board( H );
	cin >> board;

	DisjointSetForest2d dsf2d( H, W );
	REP( i, H )
	{
		REP( j, W )
		{
			if ( i + 1 < H && board[i][j] == board[ i + 1 ][j] )
			{
				dsf2d.unite( i, j, i + 1, j );
			}
			if ( j + 1 < W && board[i][j] == board[i][ j + 1 ] )
			{
				dsf2d.unite( i, j, i, j + 1 );
			}
		}
	}

	REP( i, H )
	{
		REP( j, W )
		{
			if ( 4 <= dsf2d.groupSize( i, j ) )
			{
				board[i][j] = '.';
			}
		}
	}

	copy( ALL( board ), OSI< string >( cout, "\n" ) );
	cout << flush;

	return 0;
}
0