結果
問題 | No.348 カゴメカゴメ |
ユーザー |
|
提出日時 | 2016-06-17 18:20:05 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 3,138 bytes |
コンパイル時間 | 1,939 ms |
コンパイル使用メモリ | 184,740 KB |
実行使用メモリ | 25,328 KB |
最終ジャッジ日時 | 2024-10-11 05:16:27 |
合計ジャッジ時間 | 5,198 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 53 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))#define rep(i,j) FOR(i,0,j)#define each(x,y) for(auto &(x):(y))#define mp make_pair#define all(x) (x).begin(),(x).end()#define debug(x) cout<<#x<<": "<<(x)<<endl#define smax(x,y) (x)=max((x),(y))#define smin(x,y) (x)=min((x),(y))#define MEM(x,y) memset((x),(y),sizeof (x))#define sz(x) (int)(x).size()typedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;typedef vector<ll> vll;const int DY[] = {-1,0,1,0};const int DX[] = {0,1,0,-1};const int dy[] = { 0, 1, -1, 0, 1, 1, -1, -1 };const int dx[] = { 1, 0, 0, -1, 1, -1, -1, 1 };struct R{vector<pii> ps;vi ch;};const int MAX = 1010;int H, W, vis[MAX][MAX];char g[MAX][MAX];vector<R> rn;void mkR(int sy, int sx){R r;queue<pair<int, int>> Q;Q.push(mp(sy, sx));while(sz(Q)){int y, x;tie(y, x) = Q.front();Q.pop();if(vis[y][x]++)continue;r.ps.emplace_back(y, x);rep(i, 8){int ny = y + dy[i];int nx = x + dx[i];if(ny<0||nx<0||ny>=H||nx>=W||vis[ny][nx]||g[ny][nx]=='.')continue;Q.push(mp(ny, nx));}}rn.push_back(r);}vi bfs(int sy, int sx){vi res;queue<pair<int, int>> Q;Q.push(mp(sy, sx));while(sz(Q)){int y, x;tie(y, x) = Q.front();Q.pop();if(vis[y][x]++)continue;if(g[y][x] == 'x'){res.push_back(sz(rn));vis[y][x] = 0;mkR(y, x);continue;}rep(i, 4){int ny = y + DY[i];int nx = x + DX[i];if(ny<0||nx<0||ny>=H||nx>=W||vis[ny][nx])continue;Q.push(mp(ny, nx));}}return res;}void init(){cin >> H >> W;MEM(g, '.');rep(y, H){scanf("%s", g[y+1] + 1);g[y+1][W + 1] = '.';}H += 2;W += 2;rn.push_back(R());for(int p = 0; p < sz(rn); ++p){int sy = -1, sx = -1;if(p == 0){sy = sx = 0;} else{each(q, rn[p].ps){int y, x;tie(y, x) = q;rep(i, 4){int ny = y + DY[i];int nx = x + DX[i];if(ny < 0 || nx < 0 || ny >= H || nx >= W)continue;if(g[ny][nx] == '.' && !vis[ny][nx]){sy = ny;sx = nx;break;}}if(sy != -1)break;}}if(sy != -1)rn[p].ch = bfs(sy, sx);}}int mem[MAX*MAX][2];int solve(int id, int use){int &res = mem[id][use];if(res != -1)return res;res = use*sz(rn[id].ps);each(ch, rn[id].ch){if(use)res += solve(ch, 0);else res += max(solve(ch, 0), solve(ch, 1));}return res;}int main(){init();int ans = 0;MEM(mem, -1);each(id, rn[0].ch)ans += max(solve(id, 0), solve(id, 1));cout << ans << endl;}