QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#193992 | #5438. Half Mixed | PHarr | WA | 96ms | 3476kb | C++20 | 1.3kb | 2023-09-30 18:21:03 | 2023-09-30 18:21:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define int long long
void solve() {
int n, m;
cin >> n >> m;
auto dd = [&](int x)-> string{
int rst = x * (x + 1) / 4 - x;
char bk = '1';
int cur = 1;
string b;
for (int i = 0;i < x;i++){
if (rst >= cur){
b.push_back(bk);
rst -= cur;
cur++;
}else{
if (bk == '1') bk = '0';
else
bk = '1';
b.push_back(bk);
cur = 1;
}
}
return b;
};
if (n * (n + 1) % 4 == 0){
cout << "Yes\n";
string r = dd(n);
for (int i = 0;i < n;i++)
for (int j = 0;j < m;j++)
cout << r[i] << " \n"[j == m - 1];
}else if (m * (m + 1) % 4 == 0){
cout << "Yes\n";
string r = dd(m);
for (int i = 0;i < n;i++)
for (int j = 0;j < m;j++)
cout << r[j] << " \n"[j == m - 1];
}else
cout << "No\n";
return;
}
int32_t main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int TC;
for (cin >> TC; TC; TC--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3448kb
input:
2 2 3 1 1
output:
Yes 0 1 0 0 1 0 No
result:
ok OK, Accepted. (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 96ms
memory: 3476kb
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 0 1 0 No Yes 0 1 0 Yes 1 0 1 0 Yes 0 1 0 0 1 0 Yes 0 0 1 1 0 0 Yes 1 0 1 0 No Yes 1 0 1 0 1 0 1 0 Yes 0 0 0 1 1 1 0 0 0 Yes 1 1 0 0 1 1 0 0 No No No Yes 0 0 0 0 1 1 1 1 0 0 0 0 Yes 1 1 1 0 0 0 1 1 1 0 0 0 No No Yes 1 1 1 0 0 1 0 No Yes 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 Yes 1 1 1 1 0 0 0 0 1...
result:
wrong answer 6 Mixed Submatrices Found, but 5 Expected (test case 7)