結果

問題 No.2641 draw X
ユーザー hitonanodehitonanode
提出日時 2024-02-24 23:44:07
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 214 ms / 2,000 ms
コード長 8,971 bytes
コンパイル時間 2,173 ms
コンパイル使用メモリ 194,412 KB
実行使用メモリ 39,848 KB
最終ジャッジ日時 2024-09-29 10:25:00
合計ジャッジ時間 6,711 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,816 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,820 KB
testcase_09 AC 2 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 AC 2 ms
6,816 KB
testcase_14 AC 2 ms
6,816 KB
testcase_15 AC 176 ms
39,848 KB
testcase_16 AC 193 ms
39,848 KB
testcase_17 AC 2 ms
6,820 KB
testcase_18 AC 2 ms
6,820 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 14 ms
6,816 KB
testcase_21 AC 27 ms
8,888 KB
testcase_22 AC 12 ms
6,816 KB
testcase_23 AC 24 ms
8,140 KB
testcase_24 AC 9 ms
6,820 KB
testcase_25 AC 7 ms
6,820 KB
testcase_26 AC 33 ms
9,224 KB
testcase_27 AC 8 ms
6,816 KB
testcase_28 AC 73 ms
18,320 KB
testcase_29 AC 156 ms
33,588 KB
testcase_30 AC 131 ms
28,168 KB
testcase_31 AC 91 ms
20,036 KB
testcase_32 AC 172 ms
33,680 KB
testcase_33 AC 171 ms
33,076 KB
testcase_34 AC 104 ms
23,340 KB
testcase_35 AC 86 ms
18,920 KB
testcase_36 AC 171 ms
36,000 KB
testcase_37 AC 182 ms
38,016 KB
testcase_38 AC 170 ms
34,128 KB
testcase_39 AC 214 ms
39,272 KB
testcase_40 AC 192 ms
37,568 KB
testcase_41 AC 166 ms
34,332 KB
testcase_42 AC 186 ms
35,624 KB
testcase_43 AC 184 ms
34,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

template <typename T> std::vector<std::vector<T>> rotate90(const std::vector<std::vector<T>> &in) {
    const int H = in.size(), W = in[0].size();
    std::vector<std::vector<T>> ret(W, std::vector<T>(H));
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) ret[j][i] = in[i][W - 1 - j];
    }
    return ret;
}

std::vector<std::string> rotate90(const std::vector<std::string> &in) {
    const int H = in.size(), W = in[0].size();
    std::vector<std::string> ret(W, std::string(H, '\0'));
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) ret[j][i] = in[i][W - 1 - j];
    }
    return ret;
}

vector<vector<int>> gen(const vector<string> &S) {
    const int H = S.size(), W = S.front().size();
    vector dp(H, vector<int>(W));
    REP(i, H) REP(j, W) {
        if (S.at(i).at(j) != '#') continue;
        if (i and j) chmax(dp.at(i).at(j), dp.at(i - 1).at(j - 1));
        dp.at(i).at(j)++;
    }
    return dp;
}

vector<vector<int>> build(const vector<vector<int>> &dp) {
    const int H = dp.size(), W = dp.front().size();
    vector ret(H, vector<int>(W));
    REP(i, H) REP(j, W) {
        if (i and j) chmax(ret.at(i).at(j), ret.at(i - 1).at(j - 1) - 1);
        chmax(ret.at(i).at(j), dp.at(i).at(j));
    }
    return ret;
}

int main() {
    int H, W;
    cin >> H >> W;
    vector<string> S(H);
    cin >> S;
    dbg(S);

    vector dp(H, vector<int>(W));

    {
        auto dp1 = gen(S);
        auto dp2 = rotate90(rotate90(rotate90(gen(rotate90(S)))));
        auto dp3 = rotate90(rotate90(gen(rotate90(rotate90(S)))));
        auto dp4 = rotate90(gen(rotate90(rotate90(rotate90(S)))));


        REP(i, H) REP(j, W) {
            const int mini = min({dp1.at(i).at(j), dp2.at(i).at(j), dp3.at(i).at(j), dp4.at(i).at(j)});
            if (mini > 1) dp.at(i).at(j) = mini;
        }
    }
    dbg(dp);

    auto ret1 = build(dp);
    auto ret2 = rotate90(rotate90(rotate90(build(rotate90(dp)))));
    auto ret3 = rotate90(rotate90(build(rotate90(rotate90(dp)))));
    auto ret4 = rotate90(build(rotate90(rotate90(rotate90(dp)))));
    dbg(ret1);

    REP(i, H) REP(j, W) {
        if (S.at(i).at(j) == '#') {
            if (!ret1.at(i).at(j) and !ret2.at(i).at(j) and !ret3.at(i).at(j) and !ret4.at(i).at(j)) {
                puts("No");
                return 0;
            }
        }
    }

    puts("Yes");
}
0