結果

問題 No.340 雪の足跡
ユーザー torus711torus711
提出日時 2017-02-26 15:18:54
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 695 ms / 1,000 ms
コード長 4,858 bytes
コンパイル時間 1,462 ms
コンパイル使用メモリ 114,928 KB
実行使用メモリ 62,512 KB
最終ジャッジ日時 2023-09-02 09:56:13
合計ジャッジ時間 10,883 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 3 ms
4,380 KB
testcase_14 AC 19 ms
7,888 KB
testcase_15 AC 23 ms
8,320 KB
testcase_16 AC 13 ms
5,592 KB
testcase_17 AC 27 ms
8,776 KB
testcase_18 AC 25 ms
9,112 KB
testcase_19 AC 28 ms
9,088 KB
testcase_20 AC 247 ms
62,300 KB
testcase_21 AC 92 ms
4,380 KB
testcase_22 AC 105 ms
62,192 KB
testcase_23 AC 249 ms
62,512 KB
testcase_24 AC 220 ms
62,352 KB
testcase_25 AC 237 ms
62,240 KB
testcase_26 AC 24 ms
4,376 KB
testcase_27 AC 6 ms
4,376 KB
testcase_28 AC 26 ms
6,244 KB
testcase_29 AC 501 ms
37,684 KB
testcase_30 AC 333 ms
29,700 KB
testcase_31 AC 590 ms
57,248 KB
testcase_32 AC 678 ms
62,344 KB
testcase_33 AC 549 ms
62,264 KB
testcase_34 AC 695 ms
62,356 KB
testcase_35 AC 288 ms
62,456 KB
testcase_36 AC 287 ms
62,416 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 <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 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 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 > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

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 DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( 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

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

constexpr int dy[] = { 0, 1, 0, -1 };
constexpr int dx[] = { 1, 0, -1, 0 };

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

	int W, H, N;
	scanf( "%d%d%d", &W, &H, &N );

	VT< VVI > segments( H + 1, VVI( W + 1, VI( 4 ) ) );

	REP( N )
	{
		int M;
		scanf( "%d", &M );

		VI B( M + 1 );
		getv( B );

		REP( i, M )
		{
			const int y1 = B[i] / W;
			const int x1 = B[i] % W;
			const int y2 = B[ i + 1 ] / W;
			const int x2 = B[ i + 1 ] % W;

			int sy, gy, sx, gx;
			tie( sy, gy ) = minmax( y1, y2 );
			tie( sx, gx ) = minmax( x1, x2 );

			REP( k, 2 )
			{
				if ( sy == gy )
				{
					++segments[ sy ][ sx + k ][ k * 2 ];
					--segments[ sy ][ gx + k ][ k * 2 ];
				}
				else
				{
					++segments[ sy + k ][ sx ][ 1 + k * 2 ];
					--segments[ gy + k ][ sx ][ 1 + k * 2 ];
				}
			}
		}
	}

	REP( k, 4 )
	{
		REP( i, H )
		{
			REP( j, W )
			{
				const int hor = k % 2 == 0;
				segments[ i + !hor ][ j + hor ][k] += segments[i][j][k];
			}
		}
	}

	VVI distances( H, VI( W, INF ) );
	distances[0][0] = 0;

	queue< PII > que;
	que.EM( 0, 0 );

	while ( !que.empty() )
	{
		const int y = que.front().fst;
		const int x = que.front().snd;
		que.pop();

		REP( d, 4 )
		{
			const int ny = y + dy[d];
			const int nx = x + dx[d];

			if ( segments[y][x][d] && 
					0 <= ny && ny < H && 0 <= nx && nx < W &&
					distances[ ny ][ nx ] == INF )
			{
// 				cout << y << ' ' << x << " -> " << ny << ' ' << nx << endl;
				distances[ ny ][ nx ] = distances[y][x] + 1;
				que.EM( ny, nx );
			}
		}
	}

	const int res = distances[ H - 1 ][ W - 1 ];
	if ( res == INF )
	{
		puts( "Odekakedekinai.." );
	}
	else
	{
		printf( "%d\n", res );
	}
	fflush( stdout );


	return 0;
}
0