結果
問題 | No.2641 draw X |
ユーザー |
![]() |
提出日時 | 2024-02-19 22:04:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 197 ms / 2,000 ms |
コード長 | 2,705 bytes |
コンパイル時間 | 1,485 ms |
コンパイル使用メモリ | 134,744 KB |
最終ジャッジ日時 | 2025-02-19 17:00:39 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <array>#include <iterator>#include <string>#include <cctype>#include <cstring>#include <cstdlib>#include <cassert>#include <cmath>#include <ctime>#include <iomanip>#include <numeric>#include <stack>#include <queue>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <bitset>#include <random>#include <utility>#include <functional>using namespace std;void Main(){int H,W;cin >> H >> W;vector<string> S(H);vector<vector<int>> A(H,vector<int>(W)),B(H,vector<int>(W));for(int i = 0;i < H;i++){cin >> S[i];for(int j = 0;j < W;j++){if(S[i][j] == '#'){A[i][j]++;B[i][j]++;}}}for(int i = 0;i < H;i++){for(int j = 0;j < W;j++){if(i - 1 >= 0 && j - 1 >= 0){A[i][j] += A[i - 1][j - 1];}if(i - 1 >= 0 && j + 1 < W){B[i][j] += B[i - 1][j + 1];}}}vector<vector<int>> C(H,vector<int>(W,0)),D(H,vector<int>(W,0));for(int i = 0;i < H;i++){for(int j = 0;j < W;j++){if(S[i][j] == '.'){continue;}int ok = 0,ng = min(H,W) + 1;while(ng - ok > 1){int mid = (ok + ng) / 2;if(i + mid >= H){ng = mid;continue;}if(i - mid < 0){ng = mid;continue;}if(j + mid >= W){ng = mid;continue;}if(j - mid < 0){ng = mid;continue;}bool check = true;{int S = 0;S += A[i + mid][j + mid];if(i - mid - 1 >= 0 && j - mid - 1 >= 0){S -= A[i - mid - 1][j - mid - 1];}check &= (S == 2 * mid + 1);}{int S = 0;S += B[i + mid][j - mid];if(i - mid - 1 >= 0 && j + mid + 1 < W){S -= B[i - mid - 1][j + mid + 1];}check &= (S == 2 * mid + 1);}if(check){ok = mid;}else{ng = mid;}}int mx = ok;if(mx == 0){continue;}C[i + mx][j + mx]++;if(i - mx - 1 >= 0 && j - mx - 1 >= 0){C[i - mx - 1][j - mx - 1]--;}D[i + mx][j - mx]++;if(i - mx - 1 >= 0 && j + mx + 1 < W){D[i - mx - 1][j + mx + 1]--;}}}vector<string> T(H,string(W,'.'));for(int i = H - 1;i >= 0;i--){for(int j = W - 1;j >= 0;j--){if(i - 1 >= 0 && j - 1 >= 0){C[i - 1][j - 1] += C[i][j];}if(i - 1 >= 0 && j + 1 < W){D[i - 1][j + 1] += D[i][j];}if(C[i][j] || D[i][j]){T[i][j] = '#';}}}cout << (S == T ? "Yes\n":"No\n");}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;/* cin >> tt; */while(tt--) Main();}