QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#98769 | #6309. Aqre | JohnAlfnov | WA | 2ms | 9800kb | C++14 | 3.3kb | 2023-04-19 22:39:40 | 2023-04-19 22:39:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int a[1100][1100];
int b[1100][1100];
int main(){
int _;
cin>>_;
for(int i=0;i<=1050;i++)for(int j=0;j<=1050;j++){
if(i%4==0&&j%4==0)a[i][j]=1;
if(i%4==1&&j%4==2)a[i][j]=1;
if(i%4==2&&j%4==1)a[i][j]=1;
if(i%4==3&&j%4==3)a[i][j]=1;
}
for(int i=0;i<3;i++)for(int j=0;j<=1050;j++){
if(i==0&&j%4==1)b[i][j]=1;
if(i==1&&j%4==3)b[i][j]=1;
if(i==2&&j%4==3)b[i][j]=1;
}
while(_--){
int n,m;
cin>>n>>m;
if(n%4==0||m%4==0){
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n<=3&&m<=3){
cout<<n*m<<endl;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)printf("1");
printf("\n");
}
continue;
}
if(n==2){
int ans=0;
for(int i=0;i<2;i++){
for(int j=3;j<m+3;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=0;i<2;i++){
for(int j=3;j<m+3;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(m==2){
int ans=0;
for(int i=3;i<n+3;i++){
for(int j=0;j<2;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=3;i<n+3;i++){
for(int j=0;j<2;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n%4==1){
int ans=0;
for(int i=0;i<n;i++){
for(int j=1;j<m+1;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=0;i<n;i++){
for(int j=1;j<m+1;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(m%4==1){
int ans=0;
for(int i=1;i<n+1;i++){
for(int j=0;j<m;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=1;i<n+1;i++){
for(int j=0;j<m;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n%4==2&&m%4==3){
int ans=0;
for(int i=0;i<n;i++){
for(int j=1;j<m+1;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=0;i<n;i++){
for(int j=1;j<m+1;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n%4==3&&m%4==2){
int ans=0;
for(int i=1;i<n+1;i++){
for(int j=0;j<m;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=1;i<n+1;i++){
for(int j=0;j<m;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n%4==2&&m%4==2){
int ans=0;
for(int i=1;i<n+1;i++){
for(int j=3;j<m+3;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=1;i<n+1;i++){
for(int j=3;j<m+3;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
if(n==3){
int ans=0;
for(int i=0;i<3;i++){
for(int j=0;j<m;j++)ans+=1-b[i][j];
}
cout<<ans<<endl;
for(int i=0;i<3;i++){
for(int j=0;j<m;j++)printf("%d",1-b[i][j]);
printf("\n");
}
continue;
}
if(m==3){
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++)ans+=1-b[j][i];
}
cout<<ans<<endl;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++)printf("%d",1-b[j][i]);
printf("\n");
}
}
if(n%4==3&&m%4==3){
int ans=0;
for(int i=1;i<n+1;i++){
for(int j=2;j<m+2;j++)ans+=1-a[i][j];
}
cout<<ans<<endl;
for(int i=1;i<n+1;i++){
for(int j=2;j<m+2;j++)printf("%d",1-a[i][j]);
printf("\n");
}
continue;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 9208kb
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: 1ms
memory: 9800kb
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 101110111011101 1110111011101...
result:
wrong answer Length must be equal to m (test case 98)