#952929 (C++17) No.2641 draw X

提出ソース

結果

問題	No.2641 draw X
ユーザー	kaikey
提出日時	2024-02-19 22:39:36
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	83 ms / 2,000 ms
コード長	6,748 bytes
コンパイル時間	2,144 ms
コンパイル使用メモリ	222,324 KB
実行使用メモリ	43,776 KB
最終ジャッジ日時	2024-02-19 22:39:41
合計ジャッジ時間	4,859 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,676 KB
testcase_01	AC	1 ms 6,676 KB
testcase_02	AC	1 ms 6,676 KB
testcase_03	AC	1 ms 6,676 KB
testcase_04	AC	2 ms 6,676 KB
testcase_05	AC	1 ms 6,676 KB
testcase_06	AC	1 ms 6,676 KB
testcase_07	AC	1 ms 6,676 KB
testcase_08	AC	1 ms 6,676 KB
testcase_09	AC	1 ms 6,676 KB
testcase_10	AC	1 ms 6,676 KB
testcase_11	AC	1 ms 6,676 KB
testcase_12	AC	1 ms 6,676 KB
testcase_13	AC	1 ms 6,676 KB
testcase_14	AC	2 ms 6,676 KB
testcase_15	AC	76 ms 43,776 KB
testcase_16	AC	81 ms 43,776 KB
testcase_17	AC	2 ms 6,676 KB
testcase_18	AC	1 ms 6,676 KB
testcase_19	AC	1 ms 6,676 KB
testcase_20	AC	6 ms 6,676 KB
testcase_21	AC	12 ms 9,600 KB
testcase_22	AC	5 ms 6,676 KB
testcase_23	AC	10 ms 8,704 KB
testcase_24	AC	4 ms 6,676 KB
testcase_25	AC	4 ms 6,676 KB
testcase_26	AC	13 ms 9,856 KB
testcase_27	AC	4 ms 6,676 KB
testcase_28	AC	26 ms 18,804 KB
testcase_29	AC	61 ms 35,968 KB
testcase_30	AC	49 ms 30,592 KB
testcase_31	AC	33 ms 21,760 KB
testcase_32	AC	66 ms 36,096 KB
testcase_33	AC	61 ms 35,608 KB
testcase_34	AC	35 ms 22,928 KB
testcase_35	AC	31 ms 20,096 KB
testcase_36	AC	82 ms 39,424 KB
testcase_37	AC	76 ms 41,728 KB
testcase_38	AC	71 ms 37,504 KB
testcase_39	AC	83 ms 43,136 KB
testcase_40	AC	79 ms 41,088 KB
testcase_41	AC	68 ms 37,632 KB
testcase_42	AC	74 ms 39,168 KB
testcase_43	AC	72 ms 38,144 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint 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)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e13;
lint dx[8] = { 0, 1, 0, -1, 1, -1, -1, 1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<plint, V<plint>> vVl;
typedef pair<string, string> pstr;
typedef pair<ld, lint> pint;

void solve() {
    lint H, W;
    cin >> H >> W;
    V<string> arr(H);
    cin >> arr;
    VVVl sums(4, VVl(H, Vl(W)));
    REP(i, H) {
        REP(j, W) {
            if (arr[i][j] == '#') {
                REP(k, 4) sums[k][i][j] = 1;
            }
        }
    }

    V<V<plint>> sts(5);
    REP(i, W) sts[0].push_back({ 0, i });
    REP(i, H) sts[1].push_back({ i, W - 1 });
    IREP(i, W) sts[2].push_back({ H - 1, i });
    IREP(i, H) sts[3].push_back({ i, 0 });
    REP(i, W) sts[4].push_back({ 0, i });

    REP(k, 4) {
        REP(i, SZ(sts[k]) - 1) {
            lint cx = sts[k][i].first, cy = sts[k][i].second;
            while (true) {
                lint nx = cx + dx[k + 4], ny = cy + dy[k + 4];
                if (nx < 0 || nx >= H) break;
                if (ny < 0 || ny >= W) break;
                sums[k][nx][ny] += sums[k][cx][cy];
                if (sums[k][nx][ny] == sums[k][cx][cy]) sums[k][nx][ny] = 0;
                cx = nx, cy = ny;
            }
        }
        REP(i, SZ(sts[k + 1])) {
            lint cx = sts[k + 1][i].first, cy = sts[k + 1][i].second;
            while (true) {
                lint nx = cx + dx[k + 4], ny = cy + dy[k + 4];
                if (nx < 0 || nx >= H) break;
                if (ny < 0 || ny >= W) break;
                sums[k][nx][ny] += sums[k][cx][cy];
                if (sums[k][nx][ny] == sums[k][cx][cy]) sums[k][nx][ny] = 0;
                cx = nx, cy = ny;
            }
        }
    }

    VVl ok(H, Vl(W));
    REP(i, H) {
        REP(j, W) {
            lint minv = INF;
            REP(k, 4) {
                chmin(minv, sums[k][i][j]);
            }
            chmax(minv, 0ll);
            if (minv == 1) minv = 0;
            ok[i][j] = minv;
        }
    }

    REP(k, 4) {
        REP(i, SZ(sts[k]) - 1) {
            lint cx = sts[k][i].first, cy = sts[k][i].second;
            lint curr = ok[cx][cy];
            if (curr > 0) arr[cx][cy] = '.';
            while (true) {
                lint nx = cx + dx[k + 4], ny = cy + dy[k + 4];
                if (nx < 0 || nx >= H) break;
                if (ny < 0 || ny >= W) break;
                chmax(curr, ok[nx][ny]);
                if (curr > 0) arr[nx][ny] = '.';
                curr--;
                cx = nx, cy = ny;
            }
        }
        REP(i, SZ(sts[k + 1])) {
            lint cx = sts[k + 1][i].first, cy = sts[k + 1][i].second;
            lint curr = ok[cx][cy];
            if (curr > 0) arr[cx][cy] = '.';
            while (true) {
                lint nx = cx + dx[k + 4], ny = cy + dy[k + 4];
                if (nx < 0 || nx >= H) break;
                if (ny < 0 || ny >= W) break;
                chmax(curr, ok[nx][ny]);
                if (curr > 0) arr[nx][ny] = '.';
                curr--;
                cx = nx, cy = ny;
            }
        }
    }

    REP(i, H) {
        REP(j, W) {
            if (arr[i][j] == '#') {
                yn(false);
                return;
            }
        }
    }
    yn(true);

}

int main() {
    lint T = 1;
    //cin >> T;
    while (T--) solve();
}

yukicoder

結果

テストケース

ソースコード