QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #111908 | #5438. Half Mixed | shiyihangxs | WA | 40ms | 3524kb | C++14 | 3.1kb | 2023-06-09 09:16:35 | 2023-06-09 09:16:39 |
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 = 200005;
const ll mod = 998244353;
ll T;
ll n, m;
ll a[100][100];
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 && (ff || ff1)){
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{
bool ff = 0;
for(ll i = 1; i <= n; i++){
for(ll j = i; j <= n; j++){
// if(i == 3 && j == 3) cout << (j-i+1)*(j-i+2)*2+2*(n-j)*(n-j+1)+2*i*(i-1) << endl;
if((j-i+1)*(j-i+2)*2+2*(n-j)*(n-j+1)+2*i*(i-1) == n*(n+1)){
ff = 1;
printf("Yes\n");
for(ll ii = 1; ii <= n; ii++){
for(ll jj = 1; jj <= m; jj++){
if(ii >= i && ii <= j) printf("1 ");
else printf("0 ");
}
puts("");
}
break;
}
}
if(ff) break;
}
for(ll i = 1; i <= m; i++){
if(ff) break;
for(ll j = i; j <= m; j++){
if((j-i+1)*(j-i+2)*2+2*(m-j)*(m-j+1)+2*i*(i-1) == m*(m+1)){
ff = 1;
printf("Yes\n");
for(ll ii = 1; ii <= n; ii++){
for(ll jj = 1; jj <= m; jj++){
if(jj >= i && jj <= j) printf("1 ");
else printf("0 ");
}
puts("");
}
break;
}
}
if(ff) break;
}
if(!ff) printf("Yes\n");
}
}
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3360kb
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: 40ms
memory: 3524kb
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 0 1 0 0 Yes 0 1 0 0 1 0 Yes 0 0 1 1 0 0 Yes 0 1 0 0 No Yes 0 1 0 0 0 1 0 0 Yes 0 0 0 1 1 1 0 0 0 Yes 0 0 1 1 0 0 0 0 No No No Yes 0 0 0 0 1 1 1 1 0 0 0 0 Yes 0 0 0 1 1 1 0 0 0 0 0 0 No No Yes 0 1 1 0 0 0 0 No Yes 0 0 0 0 0 1 1 1 1 1...
result:
wrong output format Expected integer, but "Yes" found (test case 29)