QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#690696 | #5438. Half Mixed | XiaoYang3 | WA | 5ms | 3640kb | C++23 | 1.8kb | 2024-10-31 00:47:54 | 2024-10-31 00:47:55 |
Judging History
answer
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int N = 2e5;
ll n, m, ans;
ll a[51][51], qz[51][51];
void solve() {
cin >> n >> m;
if (m == 3 || m == 4) {
cout << "Yes\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j == 1 || j == m || j == m / 2) {
cout << 1 << ' ';
} else {
cout << 0 << ' ';
}
}
cout << '\n';
}
} else if (m == 7) {
cout << "Yes\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j == 1 || j == m || j == 2) {
cout << 1 << ' ';
} else {
cout << 0 << ' ';
}
}
cout << '\n';
}
} else if (n == 3 || n == 4) {
cout << "Yes\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i == 1 || i == n || i == n / 2) {
cout << 1 << ' ';
} else {
cout << 0 << ' ';
}
}
cout << '\n';
}
} else if (n == 7) {
cout << "Yes\n";
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i == 1 || i == n || i == 2) {
cout << 1 << ' ';
} else {
cout << 0 << ' ';
}
}
cout << '\n';
}
} else {
cout << "No\n";
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int _ = 1;
cin >> _;
while (_--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 5ms
memory: 3604kb
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 1 0 1 Yes 1 1 0 1 Yes 1 0 1 1 0 1 Yes 1 1 0 0 1 1 Yes 1 1 0 1 No Yes 1 1 0 1 1 1 0 1 Yes 1 0 1 1 0 1 1 0 1 Yes 1 1 1 1 0 0 1 1 No No No Yes 1 1 0 1 1 1 0 1 1 1 0 1 Yes 1 0 1 1 0 1 1 0 1 1 0 1 No No Yes 1 1 0 0 0 0 1 No Yes 1 1 1 1 1 0 0 0 0 0...
result:
wrong answer Wrong Verdict (test case 29)