QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#271729#6309. AqreLLLLLWA 1ms3788kbC++141.4kb2023-12-02 14:18:082023-12-02 14:18:08

Judging History

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

  • [2023-12-02 14:18:08]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3788kb
  • [2023-12-02 14:18:08]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int T,n,m,mp[N][N],rt;
void print()
{
	int cnt=0;
	if(rt)
	{
		
		for(int i=1;i<=m;i++)
			for(int j=1;j<=n;j++)
				cnt+=mp[j][i];
		printf("%d\n",cnt);
		for(int i=1;i<=m;i++,puts(""))
			for(int j=1;j<=n;j++)
				putchar(mp[j][i]+'0');
		return;
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cnt+=mp[i][j];
	printf("%d\n",cnt);
	for(int i=1;i<=n;i++,puts(""))
		for(int j=1;j<=m;j++)
			putchar(mp[i][j]+'0');
	return;
}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		rt=0;
		scanf("%d%d",&n,&m);
		if(n==2&&m==2)
		{
			printf("%d\n",4);
			puts("11");
			puts("11");
			continue;
		}
		if(n>m)swap(n,m),rt=1;
		if(n<=3)
		{
			for(int i=0;i<m;i++)mp[1][i+1]=(i%4<=2);
			for(int i=0;i<m;i++)mp[2][i+1]=(i%4==0)+(i%4==2)+(i%4==3);
			for(int i=0;i<m;i++)mp[3][i+1]=(i%4<=2);
			if(m<=3)
			{
				for(int i=1;i<=n;i++)
					for(int j=1;j<=m;j++)
						mp[i][j]=1;
			}
		}
		else
		{
			if(n%4>m%4)swap(n,m),rt^=1;
			for(int i=1;i<=n;i+=4)
				for(int j=1;j<=m;j+=4)
				{
					mp[i+0][j]=1,mp[i+0][j+1]=1,mp[i+0][j+2]=0,mp[i+0][j+3]=1;
					mp[i+1][j]=0,mp[i+1][j+1]=1,mp[i+1][j+2]=1,mp[i+1][j+3]=1;
					mp[i+2][j]=1,mp[i+2][j+1]=0,mp[i+2][j+2]=1,mp[i+2][j+3]=1;
					mp[i+3][j]=1,mp[i+3][j+1]=1,mp[i+3][j+2]=1,mp[i+3][j+3]=0;
				}
		}
		print();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3788kb

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: 1ms
memory: 3740kb

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 63)