QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#401847 | #5438. Half Mixed | noviciate | WA | 202ms | 3612kb | C++14 | 1.8kb | 2024-04-29 15:37:07 | 2024-04-29 15:37:07 |
Judging History
answer
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
using namespace std;
#define inf 0x3f3f3f
const int maxn = 2000005;
inline int read() {
int tp = 0, w = 1;
char c;
c = getchar();
while (c < '0' || c>'9') {
if (c == '-') w = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
tp = tp * 10 + (c - '0');
c = getchar();
}
return tp * w;
}
int t;
int main() {
t = read();
int n, m;
while (t--) {
cin >> n >> m;
if (n % 4 == 3) {
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) {
if (i % 2 == 0) {
for (int j = 1; j <= m; j++) {
cout << 1 << " ";
}
}
else {
for (int j = 1; j <= m; j++) {
cout << 0 << " ";
}
}
cout << endl;
}
}
else if (m % 4 == 3) {
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j % 2 == 1) {
cout << 1 << " ";
}
else cout << 0 << " ";
}
cout << endl;
}
}
else if (m % 4 == 0) {
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j == 1) {
cout << 1 << " ";
}
else if (j % 2 == 0) {
cout << 1 << " ";
}
else cout << 0 << " ";
}
cout << endl;
}
}
else if (n%4==0) {
cout << "Yes" << endl;
for (int i = 1; i <= n; i++) {
if (i == 1) {
for (int j = 1; j <= m; j++) {
cout << 1 << " ";
}
}
else if (i % 2 == 0) {
for (int j = 1; j <= m; j++) {
cout << 1 << " ";
}
}
else {
for (int j = 1; j <= m; j++) {
cout << 0 << " ";
}
}
cout << endl;
}
}
else{
cout << "No" << endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
input:
2 2 3 1 1
output:
Yes 1 0 1 1 0 1 No
result:
ok OK, Accepted. (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 202ms
memory: 3612kb
input:
5382 1 1 1 2 2 1 1 3 2 2 3 1 1 4 2 3 3 2 4 1 1 5 2 4 3 3 4 2 5 1 1 6 2 5 3 4 4 3 5 2 6 1 1 7 2 6 3 5 4 4 5 3 6 2 7 1 1 8 2 7 3 6 4 5 5 4 6 3 7 2 8 1 1 9 2 8 3 7 4 6 5 5 6 4 7 3 8 2 9 1 1 10 2 9 3 8 4 7 5 6 6 5 7 4 8 3 9 2 10 1 1 11 2 10 3 9 4 8 5 7 6 6 7 5 8 4 9 3 10 2 11 1 1 12 2 11 3 10 4 9 5 8 6 ...
output:
No No No Yes 1 0 1 No Yes 0 1 0 Yes 1 1 0 1 Yes 1 0 1 1 0 1 Yes 0 0 1 1 0 0 Yes 1 1 0 1 No Yes 1 1 0 1 1 1 0 1 Yes 0 0 0 1 1 1 0 0 0 Yes 1 1 1 1 0 0 1 1 No No No Yes 0 0 0 0 1 1 1 1 0 0 0 0 Yes 1 0 1 1 0 1 1 0 1 1 0 1 No No Yes 1 0 1 0 1 0 1 No Yes 0 0 0 0 0 1 1 1 1 1...
result:
wrong answer 21 Mixed Submatrices Found, but 14 Expected (test case 22)