QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#257811 | #6309. Aqre | pengpeng_fudan# | WA | 2ms | 3624kb | C++14 | 1.5kb | 2023-11-19 13:06:31 | 2023-11-19 13:06:31 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
int a[4][4]={{0,1,0,0},{0,0,0,1},{1,0,0,0},{0,0,1,0}};
int b[4][4]={{0,0,1,0},{1,0,0,0},{0,0,0,1},{0,1,0,0}};
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int q;cin>>q;
for(int I=0;I<q;I++){
int n,m;cin>>n>>m;
if(n<=3&&m<=3){
cout<<n*m<<"\n";
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<"1";
}
cout<<"\n";
}
continue;
}
int sum=0;
if(n>m){
int cnt=0;
if(m%4==3)cnt=2;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
sum+=1-b[(i+cnt)%4][j%4];
}
}
cout<<sum<<"\n";
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<1-b[(i+cnt)%4][j%4];
}
cout<<"\n";
}
}
else{
int cnt=0;
if(n%4==3)cnt=2;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
sum+=1-a[i%4][(j+cnt)%4];
}
}
cout<<sum<<"\n";
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<1-a[i%4][(j+cnt)%4];
}
cout<<"\n";
}
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1011 1101 18 11101110 10111011 11011101
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3624kb
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 1011 1110 8 10111 11101 9 101110 111011 11 1011101 1110111 12 10111011 11101110 14 101110111 111011101 15 1011101110 1110111011 17 10111011101 11101110111 18 101110111011 111011101110 20 1011101110111 1110111011101 21 10111011101110 11101110111011 23 101110111011101 1110111011101...
result:
wrong answer ans finds a larger answer (test case 25)