結果

問題 No.240 ナイト散歩
ユーザー torus711
提出日時 2015-07-10 22:31:54
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 3 ms
コード長 2,689 Byte
コンパイル時間 503 ms
使用メモリ 1,524 KB
最終ジャッジ日時 2018-09-26 02:33:27

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
99_challenge01.txt AC 3 ms
1,520 KB
99_challenge02.txt AC 2 ms
1,516 KB
challenge01.txt AC 3 ms
1,516 KB
challenge02.txt AC 3 ms
1,516 KB
sample1.txt AC 2 ms
1,520 KB
sample2.txt AC 3 ms
1,524 KB
sample3.txt AC 2 ms
1,516 KB
sample4.txt AC 2 ms
1,516 KB
system_test1.txt AC 2 ms
1,520 KB
system_test2.txt AC 3 ms
1,520 KB
system_test3.txt AC 3 ms
1,524 KB
system_test4.txt AC 3 ms
1,516 KB
system_test5.txt AC 3 ms
1,524 KB
system_test6.txt AC 3 ms
1,520 KB
system_test7.txt AC 2 ms
1,520 KB
system_test8.txt AC 2 ms
1,520 KB
system_test9.txt AC 2 ms
1,520 KB
system_test10.txt AC 3 ms
1,524 KB
test1.txt AC 2 ms
1,520 KB
test2.txt AC 2 ms
1,524 KB
test3.txt AC 3 ms
1,520 KB
test4.txt AC 3 ms
1,516 KB
test5.txt AC 2 ms
1,524 KB
test6.txt AC 2 ms
1,520 KB
test7.txt AC 2 ms
1,520 KB
test8.txt AC 3 ms
1,520 KB
test9.txt AC 2 ms
1,520 KB
test10.txt AC 3 ms
1,520 KB
test11.txt AC 2 ms
1,516 KB
test12.txt AC 2 ms
1,520 KB
test13.txt AC 3 ms
1,524 KB
test14.txt AC 3 ms
1,524 KB
test15.txt AC 2 ms
1,524 KB
test16.txt AC 2 ms
1,520 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 <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 ) << endl

const char *MSG[] = { "NO", "YES" };

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

bool dfs( const int x, const int y, const int depth = 0 )
{
	if ( 3 < depth )
	{
		return false;
	}
	if ( x == 0 && y == 0 )
	{
		return true;
	}

	bool res = false;
	REP( d, 8 )
	{
		res |= dfs( x + dx[d], y + dy[d], depth + 1 );
	}
	return res;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int X, Y;
	cin >> X >> Y;

	cout << MSG[ dfs( X, Y ) ] << endl;

	return 0;
}
0