QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#290289#6309. Aqrezzuqy#WA 0ms3716kbC++141.5kb2023-12-24 17:25:032023-12-24 17:25:04

Judging History

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

  • [2023-12-24 17:25:04]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3716kb
  • [2023-12-24 17:25:03]
  • 提交

answer

#include <bits/stdc++.h>
#define N 2009
using namespace std;
int a[N][N];
int n, m;

void solve() {
	cin >> n >> m;
	bool sw = 0;
	if (n > m)
		sw = 1, swap(n, m);
	if (n <= 3 && m <= 3) {
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				a[i][j] = 1;
	} else if (n == 2)
		for (int i = 1; i <= m; i++)
			a[1][i] = !(i % 4 == 2), a[2][i] = !(i % 4 == 0);
	else if (n % 4 == 2 && m % 4 == 2) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (i % 4 == 1 && j % 4 == 3 || i % 4 == 2 && j % 4 == 0 || i % 4 == 3 && j % 4 == 2 || i % 4 == 0 && j % 4 == 1)
					a[i][j] = 0;
				else
					a[i][j] = 1;
			}
		}
	} else if (n == 3)
		for (int i = 1; i <= m; i++)
			a[1][i] = a[3][i] = !(i % 4 == 0), a[2][i] = !(i % 4 == 2);
	else {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (i % 4 + j % 4 == 1 || i % 4 == j % 4 && (i % 4 == 2 || j % 4 == 3))
					a[i][j] = 0;
				else
					a[i][j] = 1;
			}
		}
	}
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++)
			sum += a[i][j];
	}
	cout << sum << endl;
	if (sw == 0)
		for (int i = 1; i <= n; i++, putchar('\n'))
			for (int j = 1; j <= m; j++)
				putchar(a[i][j] + '0');
	else
		for (int i = 1; i <= m; i++, putchar('\n'))
			for (int j = 1; j <= n; j++)
				putchar(a[j][i] + '0');
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			a[i][j] = 0;
}

int main() {
	int t;
	cin >> t;
	while (t--)
		solve();
}

详细

Test #1:

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

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

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 1s are not connected. (test case 61)