QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#539378#9114. Black or White 2Max_FWLAC ✓231ms16844kbC++141.1kb2024-08-31 14:39:142024-08-31 14:39:15

Judging History

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

  • [2024-08-31 14:39:15]
  • 评测
  • 测评结果:AC
  • 用时:231ms
  • 内存:16844kb
  • [2024-08-31 14:39:14]
  • 提交

answer

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

const int N = 2010;
int T, n, m, k, fl1 = 0, fl2 = 0, a[N][N];
int row;

void Solve(){
	cin >> n >> m >> k;
	
	fl1 = fl2 = 0;
	if (n < m){
		swap(n, m);
		fl1 = 1;
	}
	if (k > ((n * m) >> 1)){
		k = n * m - k;
		fl2 = 1;
	}
	
	row = 1;
	for (int i = 1; i <= m; i += 2){
		if (!k)
			break;
		
		a[1][i] = 1;
		k--;
	}
	
	for (int i = 2; i <= n; i++){
		if (k < m)
			break;
		
		for (int j = 1; j <= m; j += 2)
			a[i][j] = 1;
		
		for (int j = 2; j <= m; j += 2)
			a[i - 1][j] = 1;
		
		k -= m;
		row = i;
	}
	
	for (int i = 2; i <= m; i += 2){
		if (k < 2)
			break;
		
		a[row][i] = 1;
		a[row + 1][i] = 1;
		
		k -= 2;
	}
	
	a[n][m] = k;
	
	for (int i = 1; i <= (fl1 ? m : n); i++){
		for (int j = 1; j <= (fl1 ? n : m); j++)
			cout << ((fl1 ? a[j][i] : a[i][j]) ^ fl2) ;
		cout << endl;
	}
	
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			a[i][j] = 0;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> T;
	
	while (T--)
		Solve();
	
	return 0;
}

詳細信息

Test #1:

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

input:

2
2 2 2
2 3 0

output:

10
01
000
000

result:

ok Output is valid. OK.

Test #2:

score: 0
Accepted
time: 181ms
memory: 3656kb

input:

27520
2 2 0
2 2 1
2 2 2
2 2 3
2 2 4
2 3 0
2 3 1
2 3 2
2 3 3
2 3 4
2 3 5
2 3 6
3 2 0
3 2 1
3 2 2
3 2 3
3 2 4
3 2 5
3 2 6
3 3 0
3 3 1
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
3 3 8
3 3 9
2 4 0
2 4 1
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
2 4 7
2 4 8
3 4 0
3 4 1
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10...

output:

00
00
10
00
10
01
01
11
11
11
000
000
100
000
100
001
110
100
011
110
011
111
111
111
00
00
00
10
00
00
10
00
01
11
10
00
01
11
10
01
11
11
11
11
11
000
000
000
100
000
000
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
011
111
111
111
111
111
0000
0000
1000
0000
1000
0001
1...

result:

ok Output is valid. OK.

Test #3:

score: 0
Accepted
time: 96ms
memory: 16148kb

input:

162
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9
...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #4:

score: 0
Accepted
time: 93ms
memory: 16192kb

input:

163
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9
...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #5:

score: 0
Accepted
time: 102ms
memory: 16056kb

input:

165
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9
...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #6:

score: 0
Accepted
time: 147ms
memory: 14924kb

input:

1020
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #7:

score: 0
Accepted
time: 223ms
memory: 12996kb

input:

1012
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #8:

score: 0
Accepted
time: 188ms
memory: 15628kb

input:

1033
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4 9...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #9:

score: 0
Accepted
time: 231ms
memory: 3680kb

input:

100000
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #10:

score: 0
Accepted
time: 159ms
memory: 3604kb

input:

100000
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #11:

score: 0
Accepted
time: 167ms
memory: 3748kb

input:

100000
2 2 2
2 3 2
2 3 3
2 3 4
3 2 2
3 2 3
3 2 4
3 3 2
3 3 3
3 3 4
3 3 5
3 3 6
3 3 7
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
3 4 2
3 4 3
3 4 4
3 4 5
3 4 6
3 4 7
3 4 8
3 4 9
3 4 10
4 2 2
4 2 3
4 2 4
4 2 5
4 2 6
4 3 2
4 3 3
4 3 4
4 3 5
4 3 6
4 3 7
4 3 8
4 3 9
4 3 10
4 4 2
4 4 3
4 4 4
4 4 5
4 4 6
4 4 7
4 4 8
4 4...

output:

10
01
100
001
110
100
011
110
10
00
01
11
10
00
01
11
10
101
000
000
101
000
001
111
010
000
000
101
111
010
111
110
010
111
111
1000
0001
1100
1000
1100
1001
0011
0111
0111
1110
1000
0000
1000
1000
0000
1001
1000
1100
1000
1100
1000
1100
1100
1000
1101
0011
0111
0011
0111
0011
0111
0111
1111
0110
0...

result:

ok Output is valid. OK.

Test #12:

score: 0
Accepted
time: 99ms
memory: 16844kb

input:

3
1500 1500 2250000
1322 1322 1747684
1158 2 2316

output:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok Output is valid. OK.

Test #13:

score: 0
Accepted
time: 90ms
memory: 16616kb

input:

3
1500 1500 1125000
1322 1322 873842
1158 2 1158

output:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok Output is valid. OK.

Extra Test:

score: 0
Extra Test Passed