#18575 (C++11) No.179 塗り分け

• 問題: No.179 塗り分け
• ユーザー: torus711
• 提出日時: 2015-04-06 00:12:59
• 言語: C++11 (gcc 13.3.0)
• 結果: WA
• 実行時間: -
• コード長: 3,181 bytes
• コンパイル時間: 987 ms
• コンパイル使用メモリ: 105,644 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-02 13:24:00
• 合計ジャッジ時間: 2,446 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 6
other	AC * 38 WA * 2

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#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
bool solve( const VS &board, const int dy, const int dx )
{
    const int H = SZ( board ), W = SZ( board[0] );
    VVI done( H, VI( W ) );
    REP( i, H )
    {
        REP( j, W )
        {
            if ( board[i][j] == '.' || done[i][j] )
            {
                continue;
            }
            const int ty = i + dy;
            const int tx = j + dx;
            if ( !( 0 <= ty && ty < H && 0 <= tx && tx < W ) || board[ ty ][ tx ] == '.' || done[ ty ][ tx ] )
            {
                return false;
            }
            done[i][j] = done[ ty ][ tx ] = 1;
        }
    }
    return true;
}
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
    int H, W;
    cin >> H >> W;
    VS board( H );
    cin >> board;
    VS rev( board );
    reverse( ALL( rev ) );
    {
        const string s( W, '.' );
        if ( all_of( ALL( board ), bind( equal_to< string >(), _1, s ) ) )
        {
            cout << "YES" << endl;
            return 0;
        }
    }
    REP( dy, H )
    {
        REP( dx, W )
        {
            if ( !dy && !dx )
            {
                continue;
            }
            if ( solve( board, dy, dx ) || solve( rev, dy, dx ) )
            {
                cout << "YES" << endl;
                return 0;
            }
        }
    }
    cout << "NO" << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX