#80245 (C++11（廃止可能性あり）) No.348 カゴメカゴメ

• 問題: No.348 カゴメカゴメ
• ユーザー: Hachimori
• 提出日時: 2016-03-05 17:44:14
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 221 ms / 2,000 ms
• コード長: 3,372 bytes
• コンパイル時間: 813 ms
• コンパイル使用メモリ: 77,736 KB
• 実行使用メモリ: 150,432 KB
• 最終ジャッジ日時: 2024-09-24 14:23:15
• 合計ジャッジ時間: 4,606 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
other	AC * 53

ソースコード

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
137
138
139
140
#include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<cstring>
#define r first
#define c second
using namespace std;
typedef pair<int, int> Point;
const int BUF = 1005;
int row, col;
char b[BUF][BUF];
void read() {
    cin >> row >> col;
    for (int i = 0; i < row + 2; ++i) {
        for (int j = 0; j < col + 2; ++j) {
            b[i][j] = '.';
        }
    }
    
    for (int i = 1; i <= row; ++i) {
        for (int j = 1; j <= col; ++j) {
            cin >> b[i][j];
        }
    }
    
    row += 2;
    col += 2;
}
bool isInside(int r, int c) {
    return 0 <= r && r < row && 0 <= c && c < col;
}
void traceRing(int r, int c, int curId, int ringId[BUF][BUF]) {
    
    static int dr[] = {-1, -1, -1, 0, 1, 1,  1,  0};
    static int dc[] = {-1,  0,  1, 1, 1, 0, -1, -1};
    
    ringId[r][c] = curId;
    
    for (int i = 0; i < 8; ++i) {
        int nr = r + dr[i];
        int nc = c + dc[i];
        if (isInside(nr, nc) && b[nr][nc] == 'x' && ringId[nr][nc] == -1) {
            traceRing(nr, nc, curId, ringId);
        }
    }
}
void colorArea(int r, int c, int currId, bool visited[BUF][BUF],
               vector< set<int> > &adjRing, int ringId[BUF][BUF]) {
    visited[r][c] = true;
    static int dr[] = {-1, 0, 1, 0};
    static int dc[] = {0, 1, 0, -1};
    for (int i = 0; i < 4; ++i) {
        int nr = r + dr[i];
        int nc = c + dc[i];
        if (!isInside(nr, nc)) continue;
        if (b[nr][nc] == 'x') {
            if (currId != ringId[nr][nc])
                adjRing[currId].insert(ringId[nr][nc]);
        }
        else if (!visited[nr][nc]) {
            colorArea(nr, nc, currId, visited, adjRing, ringId);
        }
    }
}
int doDp(bool preUsed, int curr, vector< vector<int> > &dp,
         vector< set<int> > &adjRing, vector<int> &ringId2cnt) {
    
    int &ret = dp[preUsed][curr];
    if (ret != -1) return ret;
    
    int A = 0; // use current
    int B = 0; // do not use current
    for (set<int>::iterator it = adjRing[curr].begin(); it != adjRing[curr].end(); ++it) {
        A += doDp(true, *it, dp, adjRing, ringId2cnt);
        B += doDp(false, *it, dp, adjRing, ringId2cnt);
    }
    
    return ret = (preUsed ? B : max(A + ringId2cnt[curr], B));
}
void work() {
    int nRing = 1;
    static int ringId[BUF][BUF];
    memset(ringId, -1, sizeof(ringId));
    for (int i = 0; i < row; ++i)
        for (int j = 0; j < col; ++j)
            if (b[i][j] == 'x' && ringId[i][j] == -1) {
                traceRing(i, j, nRing++, ringId);
            }
    
    vector<int> ringId2cnt(nRing, 0);
    for (int i = 0; i < row; ++i)
        for (int j = 0; j < col; ++j)
            if (ringId[i][j] != -1) {
                ++ringId2cnt[ringId[i][j]];
            }
    vector< set<int> > adjRing;
    adjRing.assign(nRing, set<int>());
    
    static bool visited[BUF][BUF];
    memset(visited, 0, sizeof(visited));
    
    colorArea(0, 0, 0, visited, adjRing, ringId);
    for (int i = 0; i < row; ++i)
        for (int j = 0; j < col; ++j)
            if (!visited[i][j] && ringId[i][j] != -1) {
                colorArea(i, j, ringId[i][j], visited, adjRing, ringId);
            }
    
    vector< vector<int> > dp(2, vector<int>(nRing, -1));
    cout << doDp(false, 0, dp, adjRing, ringId2cnt) << endl;
}
int main() {
    read();
    work();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX