QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#292228#6309. Aqrefstqwq#WA 0ms3800kbC++141.1kb2023-12-27 21:25:492023-12-27 21:25:50

Judging History

你现在查看的是最新测评结果

  • [2023-12-27 21:25:50]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3800kb
  • [2023-12-27 21:25:49]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+5;
char st[N];
int dt[][4]={{0,2,1,3},{0,1,3,2}};
int type;
int getcnt(int n,int m,int x){
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if((dt[x][(i-1)%4]+j)%4==0);
            else cnt++;
        }
    }
    return cnt;
}
int main(){
    int T;scanf("%d",&T);
    while(T--){
        int n,m;scanf("%d%d",&n,&m);
        st[m+1]='\0';
        if(n<=3 && m<=3){
            printf("%d\n",n*m);
            for(int i=1;i<=n;i++){
                for(int j=1;j<=m;j++)st[j]='1';
                printf("%s\n",st+1);
            }
            continue;
        }
        type=0;
        int cnt=getcnt(n,m,0);
        if(n>=4 && n%4!=1 && m>=4 && getcnt(n,m,1)>=cnt)type=1,cnt=getcnt(n,m,1);
        printf("%d\n",cnt);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if((dt[type][(i-1)%4]+j)%4==0)st[j]='0';
                else st[j]='1';
            }
            printf("%s\n",st+1);
        }
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3800kb

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: 0ms
memory: 3788kb

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 ans finds a larger answer (test case 25)