QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #111933 | #5438. Half Mixed | shiyihangxs | WA | 49ms | 3584kb | C++14 | 3.2kb | 2023-06-09 10:35:06 | 2023-06-09 10:35:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mpr make_pair
//mt19937_64 ra(time(0) ^ (*new char));
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
const ll SIZE = 1000005;
const ll mod = 998244353;
ll T;
ll n, m;
ll a[SIZE];
inline ll rd(){
ll x = 0, f = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9'){
x = (x<<1) + (x<<3) + (ch^48);
ch = getchar();
}
return x*f;
}
ll power(ll x, ll y){
ll jl = 1;
while(y){
if(y & 1) jl = (jl * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return jl;
}
//
//void dfs(ll x, ll y){
//// cout << x << " " << y << endl;
// if(x == n+1){
// ll cnt = 0; bool ff = 1, ff1 = 1;
// for(ll i = 1; i <= n; i++){
// for(ll j = 1; j <= m; j++){
// ll cnt0 = 0, cnt1 = 0;
// for(ll ii = i; ii <= n; ii++){
// for(ll jj = j; jj <= m; jj++){
// if(a[ii][jj]) cnt1++;
// else cnt0++;
// if(cnt0 == 0 || cnt1 == 0) cnt++;
// }
// }
// }
// }
// for(ll j = 1; j <= m; j++){
// ll cnt1 = 0, cnt0 = 0;
// for(ll i = 1; i <= n; i++){
// if(a[i][j]) cnt1++;
// else cnt0++;
// }
// if(cnt0 && cnt1){
// ff = 0;
// break;
// }
// }
// for(ll i = 1; i <= n; i++){
// ll cnt1 = 0, cnt0 = 0;
// for(ll j = 1; j <= m; j++){
// if(a[i][j]) cnt1++;
// else cnt0++;
// }
// if(cnt0 && cnt1){
// ff1 = 0;
// break;
// }
// }
//// cout << cnt << endl;
// if(cnt == n*(n+1)/2*m*(m+1)/2/2){
// for(ll i = 1; i <= n; i++){
// for(ll j = 1; j <= m; j++){
// printf("%d ", a[i][j]);
// }
// puts("");
// }
// cout << endl;
// }
// return;
// }
// if(y != m){
// a[x][y] = 0;
// dfs(x, y+1);
// a[x][y] = 1;
// dfs(x, y+1);
// }
// else{
// a[x][y] = 0;
// dfs(x+1, 1);
// a[x][y] = 1;
// dfs(x+1, 1);
// }
//}
int main(){
// freopen("My.out", "w", stdout);
T = rd();
while(T--){
n = rd(), m = rd();
if(((n*(n+1)/2)&1) && ((m*(m+1)/2)&1)) printf("No\n");
else{
int x = n*(n-1)/2, tot = 0, ss = 0;
while(x){
a[++tot] = floor(sqrt((double)x));
x -= a[tot] * a[tot];
ss += a[tot];
}
bool ff = 0;
if(ss != n){
x = m*(m-1)/2, tot = 0; ss = 0;
while(x){
a[++tot] = floor(sqrt((double)x));
x -= a[tot] * a[tot];
ss += a[tot];
}
if(ss == m){
ff = 1;
printf("Yes\n");
for(int i = 1; i <= n; i++){
int now = 0, hh = 1, uu = 1;
for(int j = 1; j <= m; j++){
now++;
if(now > a[hh]) now = 1, hh++, uu = !uu;
printf("%d ", uu);
}
puts("");
}
}
}
else{
ff = 1;
printf("Yes\n");
int now = 0, hh = 1, uu = 1;
for(int i = 1; i <= n; i++){
now++;
if(now > a[hh]) now = 1, hh++, uu = !uu;
for(int j = 1; j <= m; j++) printf("%d ", uu);
puts("");
}
}
if(!ff) printf("No\n");
// dfs(1, 1);
}
}
return 0;
}
/*
19
1 1
1 2
1 3
1 4
1 5
1 6
2 2
2 3
2 4
2 5
2 6
3 3
3 4
3 5
3 6
4 4
4 5
4 6
5 5
5
2 6
2 7
2 8
2 9
2 10
*/
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3584kb
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: 49ms
memory: 3520kb
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 1 1 0 0 0 1 1 1 Yes 1 1 1 1 0 0 1 1 No No No Yes 1 1 1 1 0 0 0 0 1 1 1 1 Yes 1 1 1 1 1 1 0 0 0 1 1 1 No No Yes 1 1 1 1 0 0 1 No Yes 1 1 1 1 1 0 0 0 0 0...
result:
wrong answer Wrong Verdict (test case 67)