QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#288064#6309. AqreJacka1#WA 0ms3832kbC++201015b2023-12-21 18:12:252023-12-21 18:12:26

Judging History

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

  • [2023-12-21 18:12:26]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3832kb
  • [2023-12-21 18:12:25]
  • 提交

answer

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 1e6+5, M = 1e6+5;
const int MOD = 998244353, INF = 0x3f3f3f3f;
int n, m;
void solve() {
	cin >> n >> m;
	vector<vector<int>> g(n * 2 + 1, vector<int>(m * 2 + 1, 1));
	if(n <= 3 && m <= 3) {
		cout << n * m << endl;
		for(int i = 1; i <= n; i ++) {
			for(int j = 1; j <= m; j ++)
				cout << 1;
			cout << endl;
		}
		return ;
	}
	for(int i = 1; i <= n; i += 4)
		for(int j = 1; j <= m; j += 4) {
			g[i][j] = 0, g[i + 1][j + 2] = 0;
			g[i + 2][j + 3] = 0, g[i + 3][j + 1] = 0;
		}
	ll ans = 0;
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
			ans += g[i][j];
	cout << ans << endl;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++)
			cout << g[i][j];
		cout << endl;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int t = 1;
	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: 3832kb

input:

3
2 2
3 4
3 8

output:

4
11
11
9
0111
1101
1110
18
01110111
11011101
11101110

result:

ok ok (3 test cases)

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3808kb

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
0111
1101
7
01110
11011
9
011101
110111
10
0111011
1101110
12
01110111
11011101
13
011101110
110111011
15
0111011101
1101110111
16
01110111011
11011101110
18
011101110111
110111011101
19
0111011101110
1101110111011
21
01110111011101
11011101110111
22
011101110111011
1101110111011...

result:

wrong answer ans finds a larger answer (test case 4)