QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #111945 | #5438. Half Mixed | shiyihangxs | Compile Error | / | / | C++14 | 3.1kb | 2023-06-09 10:47:25 | 2023-06-09 10:47:28 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-06-09 10:47:28]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2023-06-09 10:47:25]
- 提交
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{
printf("Yes\n");
if(m*(m+1)%4 == 0){
ll 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];
}
ll now = 0, hh = 1, uu = 1;
for(ll i = 1; i <= n; i++){
now++;
if(now > a[hh]) now = 1, hh++, uu = !uu;
for(ll j = 1; j <= m; j++) printf("%d ", uu);
puts("");
}
}
else{
ll 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];
}
for(ll i = 1; i <= n; i++){
ll now = 0, hh = 1, uu = 1;
for(ll j = 1; j <= m; j++){
now++;
if(now > a[hh]) now = 1, hh++, uu = !uu;
printf("%d ", uu);
}
puts("");
}
}
// 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
*/
Details
answer.code: In function ‘int main()’:
answer.code:124:77: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
124 | for(ll j = 1; j <= m; j++) printf("%d ", uu);
| ~^ ~~
| | |
| int long long int
| %lld
answer.code:129:60: error: ‘ss’ was not declared in this scope
129 | ll x = m*(m-1)/2, tot = 0; ss = 0;
| ^~
answer.code:140:58: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
140 | printf("%d ", uu);
| ~^ ~~
| | |
| int long long int
| %lld