QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #942554 | #3750. 全 1 子矩阵 | Horcruxs# | AC ✓ | 2ms | 3584kb | C++23 | 1.5kb | 2025-03-19 10:24:31 | 2025-03-19 10:24:31 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
int n, m;
void solve() {
std::vector < std::vector <int> > a(n, std::vector <int> (m));
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
char c;
std::cin >> c;
a[i][j] = c - '0';
}
}
bool ans = false;
for(int X1 = 0; X1 < n && !ans; X1++) {
for(int X2 = X1; X2 < n && !ans; X2++) {
for(int Y1 = 0; Y1 < m && !ans; Y1++) {
for(int Y2 = Y1; Y2 < m && !ans; Y2++) {
bool flag = true;
for(int i = 0; i < n && flag; i++) {
for(int j = 0; j < m && flag; j++) {
bool ok = ((i >= X1) && (i <= X2) && (j >= Y1) && (j <= Y2));
if(ok && a[i][j] == 0) {
flag = false;
}
if(!ok && a[i][j] == 1) {
flag = false;
}
}
}
ans |= flag;
}
}
}
}
if(ans) {
std::cout << "Yes\n";
} else {
std::cout << "No\n";
}
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
while(std::cin >> n >> m) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3584kb
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:
No Yes No Yes Yes Yes No Yes Yes Yes Yes No Yes Yes No Yes Yes Yes No Yes Yes Yes Yes Yes No No Yes No Yes No Yes No No Yes No 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 No No...
result:
ok 1000 tokens