結果
| 問題 | No.923 オセロきりきざむたん |
| ユーザー |
 haruki_K
|
| 提出日時 | 2019-11-08 22:16:35 |
| 言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 10 ms / 2,000 ms |
| コード長 | 3,672 bytes |
| コンパイル時間 | 1,627 ms |
| コンパイル使用メモリ | 167,436 KB |
| 実行使用メモリ | 6,552 KB |
| 最終ジャッジ日時 | 2023-10-13 05:31:04 |
| 合計ジャッジ時間 | 4,439 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,348 KB |
| testcase_01 | AC | 1 ms
4,352 KB |
| testcase_02 | AC | 2 ms
4,352 KB |
| testcase_03 | AC | 1 ms
4,348 KB |
| testcase_04 | AC | 1 ms
4,376 KB |
| testcase_05 | AC | 2 ms
4,352 KB |
| testcase_06 | AC | 2 ms
4,352 KB |
| testcase_07 | AC | 2 ms
4,352 KB |
| testcase_08 | AC | 2 ms
4,348 KB |
| testcase_09 | AC | 1 ms
4,356 KB |
| testcase_10 | AC | 2 ms
4,352 KB |
| testcase_11 | AC | 1 ms
4,348 KB |
| testcase_12 | AC | 1 ms
4,352 KB |
| testcase_13 | AC | 2 ms
4,352 KB |
| testcase_14 | AC | 2 ms
4,348 KB |
| testcase_15 | AC | 1 ms
4,356 KB |
| testcase_16 | AC | 2 ms
4,352 KB |
| testcase_17 | AC | 2 ms
4,352 KB |
| testcase_18 | AC | 1 ms
4,348 KB |
| testcase_19 | AC | 1 ms
4,352 KB |
| testcase_20 | AC | 2 ms
4,352 KB |
| testcase_21 | AC | 1 ms
4,352 KB |
| testcase_22 | AC | 2 ms
4,352 KB |
| testcase_23 | AC | 1 ms
4,348 KB |
| testcase_24 | AC | 1 ms
4,352 KB |
| testcase_25 | AC | 1 ms
4,352 KB |
| testcase_26 | AC | 2 ms
4,352 KB |
| testcase_27 | AC | 2 ms
4,372 KB |
| testcase_28 | AC | 2 ms
4,352 KB |
| testcase_29 | AC | 2 ms
4,352 KB |
| testcase_30 | AC | 2 ms
4,352 KB |
| testcase_31 | AC | 1 ms
4,352 KB |
| testcase_32 | AC | 2 ms
4,356 KB |
| testcase_33 | AC | 1 ms
4,352 KB |
| testcase_34 | AC | 2 ms
4,348 KB |
| testcase_35 | AC | 1 ms
4,348 KB |
| testcase_36 | AC | 2 ms
4,372 KB |
| testcase_37 | AC | 1 ms
4,348 KB |
| testcase_38 | AC | 1 ms
4,348 KB |
| testcase_39 | AC | 2 ms
4,352 KB |
| testcase_40 | AC | 1 ms
4,348 KB |
| testcase_41 | AC | 2 ms
4,356 KB |
| testcase_42 | AC | 1 ms
4,352 KB |
| testcase_43 | AC | 2 ms
4,352 KB |
| testcase_44 | AC | 1 ms
4,348 KB |
| testcase_45 | AC | 1 ms
4,376 KB |
| testcase_46 | AC | 1 ms
4,352 KB |
| testcase_47 | AC | 2 ms
4,352 KB |
| testcase_48 | AC | 1 ms
4,352 KB |
| testcase_49 | AC | 2 ms
4,352 KB |
| testcase_50 | AC | 3 ms
4,352 KB |
| testcase_51 | AC | 3 ms
4,352 KB |
| testcase_52 | AC | 3 ms
4,352 KB |
| testcase_53 | AC | 6 ms
4,972 KB |
| testcase_54 | AC | 3 ms
4,348 KB |
| testcase_55 | AC | 3 ms
4,352 KB |
| testcase_56 | AC | 3 ms
4,352 KB |
| testcase_57 | AC | 1 ms
4,348 KB |
| testcase_58 | AC | 1 ms
4,356 KB |
| testcase_59 | AC | 1 ms
4,348 KB |
| testcase_60 | AC | 1 ms
4,352 KB |
| testcase_61 | AC | 2 ms
4,352 KB |
| testcase_62 | AC | 1 ms
4,352 KB |
| testcase_63 | AC | 1 ms
4,352 KB |
| testcase_64 | AC | 1 ms
4,352 KB |
| testcase_65 | AC | 8 ms
6,488 KB |
| testcase_66 | AC | 9 ms
6,496 KB |
| testcase_67 | AC | 9 ms
6,552 KB |
| testcase_68 | AC | 10 ms
6,492 KB |
| testcase_69 | AC | 2 ms
4,356 KB |
| testcase_70 | AC | 1 ms
4,376 KB |
| testcase_71 | AC | 8 ms
6,552 KB |
| testcase_72 | AC | 2 ms
4,376 KB |
| testcase_73 | AC | 1 ms
4,352 KB |
| testcase_74 | AC | 1 ms
4,352 KB |
| testcase_75 | AC | 2 ms
4,348 KB |
| testcase_76 | AC | 1 ms
4,348 KB |
| testcase_77 | AC | 2 ms
4,352 KB |
| testcase_78 | AC | 2 ms
4,352 KB |
| testcase_79 | AC | 2 ms
4,352 KB |
| testcase_80 | AC | 2 ms
4,348 KB |
| testcase_81 | AC | 2 ms
4,352 KB |
| testcase_82 | AC | 2 ms
4,348 KB |
| testcase_83 | AC | 2 ms
4,352 KB |
| testcase_84 | AC | 2 ms
4,352 KB |
| testcase_85 | AC | 2 ms
4,348 KB |
| testcase_86 | AC | 2 ms
4,348 KB |
| testcase_87 | AC | 2 ms
4,356 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", my_dmp(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
void my_dmp(const char*) { cerr << endl; }
template <class T, class... U> void my_dmp(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; my_dmp(s, y...); }
#else
#define dump(...)
#define say(x)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct my_Init { my_Init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } my_init;
template <class T, size_t d, class = typename enable_if<(d == 0)>::type> constexpr auto make_v(T const& x = {}) { return x; }
template <class T, size_t d, class... U, class = typename enable_if<(d > 0)>::type> constexpr auto make_v(size_t n, U... x) { auto val = make_v<T,d-1>(x...); return vector<decltype(val)>(n, move(val)); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
////////////////////////////////
#define YN(x) ((x) ? "YES" : "NO")
int32_t main() {
int n,m; cin >> n >> m;
vector<string> a(n); cin >> a;
if (n == 1 && m == 1) {
quit(YN(a[0][0] == '1'));
}
if (n == 1) {
bool flag = false;
rep (j,m) if (a[0][0] != a[0][j]) flag = true;
if (!flag) quit("NO");
}
if (m == 1) {
bool flag = false;
rep (i,n) if (a[0][0] != a[i][0]) flag = true;
if (!flag) quit("NO");
}
bool f0 = false;
rep (i,n) {
bool flag = false;
rep (j,m) if (a[i][0] != a[i][j]) flag = true;
if (!flag) f0 = true;
}
bool f1 = false;
rep (j,m) {
bool flag = false;
rep (i,n) if (a[0][j] != a[i][j]) flag = true;
if (!flag) f1 = true;
}
quit(YN(!f0 || !f1));
}