QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#608433 | #5438. Half Mixed | LittleYoo | TL | 0ms | 3580kb | C++20 | 1.0kb | 2024-10-03 21:52:07 | 2024-10-03 21:52:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll = long long;
void solve()
{
int n, m;
cin >> n >> m;
if(1ll * n * m * (n + 1) * (m + 1) % 8 != 0) {
cout << "No\n";
return ;
}
cout << "Yes\n";
bool horizon = 1;
if(1ll * m * (m + 1) % 4 != 0) {
swap(n, m);
horizon = 0;
}
ll tar = 1ll * m * (m - 1) / 2;
int rem = m, cur = 0;
string s;
bool now = 1;
while(rem) {
// assert(tar - cur - rem >= 0);
int l = sqrt(tar - cur);
// cerr << l << '\n';
if(l * l > tar - cur)
--l;
// l -= rem;
for(int i = 0; i < l; ++i)
s += '0' + now;
now ^= 1;
rem -= l;
cur += 1ll * l * l;
}
if(horizon) {
for(int i = 0; i < n; ++i) {
for(auto &c : s)
cout << c << ' ';
cout << '\n';
}
} else {
for(auto &c : s) {
for(int i = 0; i < n; ++i)
cout << c << " \n"[i == n - 1];
}
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
cin >> T;
while(T--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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
Time Limit Exceeded
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 ...