QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #122068 | #6309. Aqre | P3KO | WA | 4ms | 3480kb | C++20 | 3.1kb | 2023-07-09 13:14:12 | 2023-07-09 13:14:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e3+5;
const int MAXM=1e3+5;
int n,m;
int a[MAXN][MAXM];
//10111
//11101
//11011
//01110
//10111
//1101
//1110
//
int main(){
int t;cin>>t;
while(t--){
cin>>n>>m;
int ans=n*m;
if(max(n,m)<=3){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
a[i][j]=1;
}
}
}else if(min(n,m)==3&&(max(m,n)-min(m,n))%4==0){
if(n==3){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
if(i==1||i==3){
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
}else{
for(int i=1;i<=n;i++){
if(i%2==1)a[i][1]=a[i][2]=a[i][3]=1;
else if(i%4==2)a[i][1]=a[i][3]=1,a[i][2]=0,ans--;
else a[i][1]=a[i][3]=0,a[i][2]=1,ans-=2;
}
}
}else if(n%4==2&&m%4==2&&min(n,m)>2){
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
if(i%4==1){
if(j%4==3)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==2){
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==3){
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==1)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
}else if(n%4==1&&m%4==1||n%4==1&&m%4==2){
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
if(i%4==1){
if(j%4==3)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==2){
if(j%4==1)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==3){
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
}else if(n%4==1&&m%4==3){
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
if(i%4==1){
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==2){
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==3){
if(j%4==3)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==1)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
}else if(n%4==0||m%4==0){
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
if(i%4==1){
if(j%4==1)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==2){
if(j%4==3)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==3){
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
}else if(m==2){
for(int i=1;i<=n;i++)
if(i%4==1)a[i][1]=1,a[i][2]=1;
else if(i%4==2)a[i][1]=0,a[i][2]=1,ans--;
else if(i%4==3)a[i][1]=1,a[i][2]=1;
else a[i][1]=1,a[i][2]=0,ans--;
}else{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
if(i%4==1){
if(j%4==2)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==2){
if(j%4==0)a[i][j]=0,ans--;
else a[i][j]=1;
}else if(i%4==3){
if(j%4==3)a[i][j]=0,ans--;
else a[i][j]=1;
}else{
if(j%4==1)a[i][j]=0,ans--;
else a[i][j]=1;
}
}
cout<<"?"<<endl;
}
cout<<ans<<"\n";
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[i][j];
}
cout<<"\n";
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3308kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 0111 1101 1011 18 01110111 11011101 10111011
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 3480kb
input:
361 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 4 12 4 13 4 14 4 15 4 16 4 17 4 18 4 19 4 20 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 1...
output:
4 11 11 6 111 111 6 0111 1101 ? 8 10111 11101 ? 9 101110 111011 ? 11 1011101 1110111 12 01110111 11011101 ? 14 101110111 111011101 ? 15 1011101110 1110111011 ? 17 10111011101 11101110111 18 011101110111 110111011101 ? 20 1011101110111 1110111011101 ? 21 10111011101110 11101110111011 ? 23 10111011101...
result:
wrong output format Expected integer, but "?" found (test case 4)