QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#563900#6309. AqrelonelywolfWA 2ms3900kbC++202.1kb2024-09-14 16:58:442024-09-14 16:58:45

Judging History

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

  • [2024-09-14 16:58:45]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3900kb
  • [2024-09-14 16:58:44]
  • 提交

answer

#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

constexpr int p[] = {4, 2, 3, 1};

void solve() {
	int n, m;
	cin >> n >> m;

	if (n < 4 && m < 4) {
		cout << n * m << "\n";
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << 1;
			}
			cout << "\n";
		}
		cout << "\n";
		return;
	}

	if (n < 4 || m < 4) {
		bool sw = false;
		if (n > m) {
			swap(n, m);
			sw = true;
		}
		if (n < 3) {
			vector a(n + 1, vector<int>(m + 1, 1));
			int sum = n * m;
			for (int i = 1; i <= n; i++) {
				for (int j = p[i - 1]; j <= m; j += 4) {
					a[i][j] = 0;
					sum--;
				}
			} 
			cout << sum << "\n";
			if (sw) {
				for (int j = 1; j <= m; j++) {
					for (int i = 1; i <= n; i++) {
						cout << a[i][j];
					}
					cout << "\n";
				}
			} else {
				for (int i = 1; i <= n; i++) {
					for (int j = 1; j <= m; j++) {
						cout << a[i][j];
					}
					cout << "\n";
				}
			}
			cout << "\n";
		} else {
			vector a(n + 1, vector<int>(m + 1, 1));
			int sum = n * m;
			for (int j = 4; j <= m; j += 4) {
				a[1][j] = 0;
				sum--;
			}
			for (int j = 4; j <= m; j += 4) {
				a[2][j] = 0;
				sum--;
			}
			for (int j = 2; j <= m; j += 4) {
				a[3][j] = 0;
				sum--;
			}
			cout << sum << "\n";
			if (sw) {
				for (int j = 1; j <= m; j++) {
					for (int i = 1; i <= n; i++) {
						cout << a[i][j];
					}
					cout << "\n";
				}
			} else {
				for (int i = 1; i <= n; i++) {
					for (int j = 1; j <= m; j++) {
						cout << a[i][j];
					}
					cout << "\n";
				}
			}
			cout << "\n";
		}
		
		return;
	}

	int sum = n * m;
	vector a(n + 1, vector<int>(m + 1, 1));
	for (int i = 1; i <= n; i++) {
		for (int j = p[(i - 1) % 4]; j <= m; j += 4) {
			a[i][j] = 0;
			sum--;
		}
	}

	cout << sum << "\n";
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << a[i][j];
		}
		cout << "\n";
	}
	cout << "\n";
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

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

    return 0;
}  
  

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
2 2
3 4
3 8

output:

4
11
11

9
1110
1110
1011

18
11101110
11101110
10111011


result:

ok ok (3 test cases)

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 3900kb

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
...

result:

wrong answer 1s are not connected. (test case 61)