QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#397978 | #3750. 全 1 子矩阵 | SamponYW# | WA | 1ms | 3968kb | C++14 | 1.2kb | 2024-04-24 20:55:25 | 2024-04-24 20:55:26 |
Judging History
answer
#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 20005
#define M 2019
int n, m;
il void WORK() {
int xl = n, xr = 0, yl = m, yr = 0, cnt = 0;
FOR(i, 1, n) {
FOR(j, 1, m) {
char c; cin >> c;
if(c & 1) ++cnt, xl = min(xl, i), xr = max(xr, i), yl = min(yl, j), yr = max(yr, j);
}
}
if(!cnt || cnt == (xr - xl + 1) * (yr - yl + 1)) cout << "Yes\n";
else cout << "No\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
while(cin >> n >> m) WORK();
cerr << 1.0 * clock() / CLOCKS_PER_SEC;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3968kb
input:
1 1 0 1 1 1 1 2 00 1 2 10 1 2 01 1 2 11 1 3 000 1 3 100 1 3 010 1 3 110 1 3 001 1 3 101 1 3 011 1 3 111 2 1 0 0 2 1 1 0 2 1 0 1 2 1 1 1 2 2 00 00 2 2 10 00 2 2 01 00 2 2 11 00 2 2 00 10 2 2 10 10 2 2 01 10 2 2 11 10 2 2 00 01 2 2 10 01 2 2 01 01 2 2 11 01 2 2 00 11 2 2 10 11 2 2 01 11 2 2 11 11 2 3 ...
output:
Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No Yes No Yes No Yes No No Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes No No No No No No Yes No Yes No No No No No Yes No No Yes No No No No Yes No No No Yes No No No No No No No No No No No Yes No No No...
result:
wrong answer 1st words differ - expected: 'No', found: 'Yes'