結果

問題 No.923 オセロきりきざむたん
ユーザー gazellegazelle
提出日時 2019-11-08 21:41:12
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 4,849 bytes
コンパイル時間 826 ms
コンパイル使用メモリ 88,180 KB
実行使用メモリ 86,664 KB
最終ジャッジ日時 2023-10-13 05:30:02
合計ジャッジ時間 5,583 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
81,320 KB
testcase_01 AC 21 ms
81,000 KB
testcase_02 AC 22 ms
80,952 KB
testcase_03 AC 22 ms
81,380 KB
testcase_04 AC 21 ms
80,948 KB
testcase_05 AC 22 ms
81,380 KB
testcase_06 AC 22 ms
80,928 KB
testcase_07 AC 21 ms
80,820 KB
testcase_08 AC 22 ms
81,384 KB
testcase_09 AC 21 ms
81,004 KB
testcase_10 AC 22 ms
81,320 KB
testcase_11 AC 21 ms
81,116 KB
testcase_12 AC 22 ms
80,932 KB
testcase_13 AC 22 ms
81,392 KB
testcase_14 AC 21 ms
81,220 KB
testcase_15 AC 21 ms
80,916 KB
testcase_16 AC 21 ms
80,824 KB
testcase_17 AC 22 ms
81,320 KB
testcase_18 AC 22 ms
80,916 KB
testcase_19 AC 22 ms
80,864 KB
testcase_20 AC 21 ms
81,020 KB
testcase_21 AC 22 ms
80,808 KB
testcase_22 AC 22 ms
81,380 KB
testcase_23 AC 21 ms
81,332 KB
testcase_24 AC 21 ms
81,288 KB
testcase_25 AC 22 ms
81,272 KB
testcase_26 AC 23 ms
81,576 KB
testcase_27 AC 23 ms
81,536 KB
testcase_28 AC 24 ms
81,508 KB
testcase_29 AC 23 ms
81,580 KB
testcase_30 AC 21 ms
81,528 KB
testcase_31 AC 23 ms
81,772 KB
testcase_32 AC 22 ms
81,244 KB
testcase_33 AC 22 ms
81,256 KB
testcase_34 AC 22 ms
81,380 KB
testcase_35 AC 21 ms
81,260 KB
testcase_36 AC 22 ms
81,376 KB
testcase_37 AC 22 ms
81,260 KB
testcase_38 AC 21 ms
81,004 KB
testcase_39 AC 22 ms
81,256 KB
testcase_40 AC 22 ms
81,300 KB
testcase_41 AC 22 ms
81,316 KB
testcase_42 AC 22 ms
81,320 KB
testcase_43 AC 21 ms
81,256 KB
testcase_44 AC 22 ms
81,324 KB
testcase_45 AC 22 ms
81,248 KB
testcase_46 AC 22 ms
81,260 KB
testcase_47 AC 22 ms
81,320 KB
testcase_48 AC 22 ms
81,312 KB
testcase_49 AC 22 ms
81,244 KB
testcase_50 AC 24 ms
82,176 KB
testcase_51 AC 24 ms
82,052 KB
testcase_52 AC 24 ms
82,112 KB
testcase_53 AC 28 ms
83,960 KB
testcase_54 AC 25 ms
82,100 KB
testcase_55 AC 25 ms
82,304 KB
testcase_56 AC 25 ms
82,428 KB
testcase_57 AC 22 ms
81,380 KB
testcase_58 AC 22 ms
81,324 KB
testcase_59 AC 22 ms
81,260 KB
testcase_60 AC 22 ms
81,252 KB
testcase_61 AC 21 ms
81,192 KB
testcase_62 AC 22 ms
81,384 KB
testcase_63 AC 22 ms
81,324 KB
testcase_64 AC 21 ms
81,028 KB
testcase_65 AC 32 ms
86,600 KB
testcase_66 AC 32 ms
86,532 KB
testcase_67 AC 32 ms
86,600 KB
testcase_68 AC 31 ms
86,468 KB
testcase_69 AC 24 ms
81,780 KB
testcase_70 AC 23 ms
81,912 KB
testcase_71 AC 32 ms
86,664 KB
testcase_72 AC 23 ms
82,044 KB
testcase_73 AC 22 ms
81,260 KB
testcase_74 AC 21 ms
81,512 KB
testcase_75 AC 23 ms
81,572 KB
testcase_76 AC 22 ms
81,524 KB
testcase_77 AC 23 ms
81,644 KB
testcase_78 AC 22 ms
81,256 KB
testcase_79 AC 24 ms
81,508 KB
testcase_80 AC 24 ms
81,644 KB
testcase_81 AC 23 ms
81,528 KB
testcase_82 AC 23 ms
81,532 KB
testcase_83 AC 23 ms
81,592 KB
testcase_84 AC 23 ms
81,828 KB
testcase_85 AC 24 ms
81,528 KB
testcase_86 AC 23 ms
81,580 KB
testcase_87 AC 24 ms
81,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#define FOR(i, n, m) for(ll i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-15;

template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}

struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }

#define MAX_N 10000001
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}

using mi = modint;

mi mod_pow(ll a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int h, w;
    cin >> h >> w;
    vector<vector<int>> a(h, vector<int>(w));
    REP(i, h) REP(j, w) {
        char c;
        cin >> c;
        if(c == '0') a[i][j] = 0;
        else a[i][j] = 1;
    }
    bool b1 = false, b2 = false;
    REP(i, h) {
        bool tmp = true;
        REP(j, w) if(a[i][j] != a[i][0]) tmp = false;
        if(tmp) b1 = true;
    }
    REP(i, w) {
        bool tmp = true;
        REP(j, h) if(a[j][i] != a[0][i]) tmp = false;
        if(tmp) b2 = true;
    }
    if(b1 && b2) cout << "NO" << endl;
    else cout << "YES" << endl;
    return 0;
}
0