QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#302990#6309. AqreItisa#WA 2ms3832kbC++142.2kb2024-01-11 16:35:022024-01-11 16:35:02

Judging History

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

  • [2024-01-11 16:35:02]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3832kb
  • [2024-01-11 16:35:02]
  • 提交

answer

#include <iostream>

using namespace std;

int read() {
	int r=0,w=1;char ch=getchar();
	while(ch < '0' || ch > '9'){if (ch=='-') {w=-1;}ch=getchar();}
	while(ch >= '0' && ch <='9') {r = r*10+(ch-'0');ch=getchar();}
	return r*w;
}

void dn(int n,int m) {
	int ans = 0;
//	cout << "RR" << "\n";
	int y[][4] = {{1,1,1,0},{1,0,1,1},{1,1,1,0}};
	for(int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			ans += y[i][j%4];
		}
	}
	printf("%d\n",ans);
	for(int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			printf("%d",y[i][j%4]);
		}
		printf("\n");	
	}
	
}

void dm(int n,int m) {
	int ans = 0;
	int y[][4] = {{1,1,1,0},{1,0,1,1},{1,1,1,0}};
	for(int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			ans += y[j][i%4];
		}
	}
	printf("%d\n",ans);
	for(int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			printf("%d",y[j][i%4]);
		}
		printf("\n");	
	}
	
}


int main(){
	int T = read();
	int n,m;
	int a[] = {1,1,1,0};
	int b[] = {0,0,0,1};
	int x[][8] = {{1,0,1,1,1,0,1,1},{1,1,1,0,1,1,1,0},{1,1,0,1,1,1,0,1},{0,1,1,1,0,1,1,1}};
	while(T--) {
		n = read();
		m = read();
		if (n <= 3 && m <= 3) {
			printf("%d\n",n*m);
			for (int i = 0; i < n; ++i) {
				for (int j = 0; j < m; ++j) {
					printf("%d",1);
				}
				printf("\n");
			}
			continue;
		}
		int ans = 0;
		
		if (n <= 3) {
			dn(n,m);
			continue;
		}
		if (m <= 3) {
			dm(n,m);
			continue;
		}
		
		
		
		
		
		
		
		
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				if (m == 2) {
					ans += x[i%4][(j+3)%8];
//					printf("%d",x[i%4][(j+3)%8]);
				} else if (m > n){
					ans += x[i%4][(j+2)%8];
//					printf("%d",x[i%4][(j+2)%8]);
				} else {
					ans += x[i%4][j%8];
//					printf("%d",);
				}
			}
		}
		printf("%d\n",ans);
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				if (m == 2) {
					printf("%d",x[i%4][(j+3)%8]);
				} else if (m > n){
					printf("%d",x[i%4][(j+2)%8]);
				} else {
					printf("%d",x[i%4][j%8]);
				}
//				if (i % 4 <= 2) {
//					printf("%d",a[j%4]);
//				} else {
//					printf("%d",b[j%4]);
//				}
			}
			printf("\n");
		}
	}
	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 2ms
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 1s are not connected. (test case 60)