QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#259870 | #6309. Aqre | aries# | WA | 4ms | 26944kb | C++20 | 2.4kb | 2023-11-21 15:32:59 | 2023-11-21 15:33:00 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int N =1e6+10;
vector<int> a[N];
int n,m,cnt;
const int p[]={1,0,2,3};//4k+3用
const int q[]={1,0,2,0};//<4用
const int r[]={1,2,0,3};//4k+1
const int s[]={1,3,0,2};//4k+2
void output()
{
cout<<cnt<<endl;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[i][j];
}
cout<<endl;
}
}
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++){
a[i].push_back(2);//占位
for(int j=1;j<=m;j++){
a[i].push_back(1);
}
}
cnt = n*m;
if(n<4 && m<4){
;
}
else if(n<4 || m<4){
if(n<4){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(j%4==q[i%4]){
a[i][j]=0;
cnt--;
}
}
}
}
if(m<4){
for(int j=1;j<=m;j++){
for(int i=1;i<=n;i++){
if(i%4==q[j%4]){
a[i][j]=0;
cnt--;
}
}
}
}
}
else{
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(n%4==3 || n%4==0){
if(j%4==p[i%4]){
//cout<<i<<" "<<j<<endl;
a[i][j]=0;
cnt--;
}
}
else if(n%4==2){
if(j%4==s[i%4]){
//cout<<i<<" "<<j<<endl;
a[i][j]=0;
cnt--;
}
}
else{
if(j%4==r[i%4]){
//cout<<i<<" "<<j<<endl;
a[i][j]=0;
cnt--;
}
}
}
}
}
output();
for(int i=1;i<=n;i++){
a[i].clear();
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt=1;
cin>>tt;
while(tt--){
solve();
}
return 0;
}
/*
1
5 5
3
2 2
3 4
3 8
1
3 7
1
6 6
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 26944kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1011 1110 18 11101110 10111011 11101110
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 26780kb
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 1110 1011 8 11101 10111 9 111011 101110 11 1110111 1011101 12 11101110 10111011 14 111011101 101110111 15 1110111011 1011101110 17 11101110111 10111011101 18 111011101110 101110111011 20 1110111011101 1011101110111 21 11101110111011 10111011101110 23 111011101110111 1011101110111...
result:
wrong answer 1s are not connected. (test case 60)