QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#537227#9114. Black or White 2Insert_Username_HereWA 108ms3728kbC++201.0kb2024-08-29 23:53:402024-08-29 23:53:41

Judging History

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

  • [2024-08-29 23:53:41]
  • 评测
  • 测评结果:WA
  • 用时:108ms
  • 内存:3728kb
  • [2024-08-29 23:53:40]
  • 提交

answer

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
// const ll mod = 1e9 + 7;
// #include <brawlstars>
// FOR PAIN OR FOR GLORYYY ELLL PRIMOOOOOO

const int N = 1501;
int ans[N][N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t, tringle[1501];
	tringle[0] = 0;
	for(int i = 1; i < 1501; i++) tringle[i] = tringle[i - 1] + i;
	cin >> t;
	while(t--) {
		int n, m, k, flip = 0, cur = 0;
		cin >> n >> m >> k;
		if(k * 2 > n * m) k = n * m - k, flip = 1;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) ans[i][j] = 0;
		}
		for(int i = 0; i < m; i += 2) {
			if(cur == k) break;
			ans[0][i] = 1, cur++;
		}
		for(int i = 1; i < n; i++) {
			for(int j = i % 2; j < m; j += 2) {
				if(cur + 2 > k) break;
				ans[i - 1][j] = ans[i][j] = 1;
				cur += 2;
			}
		}
		if(k - cur) ans[n - 1][0] = 1;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				cout << (ans[i][j] ^ flip);
			}
			cout << "\n";
		}
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
2 2 2
2 3 0

output:

10
10
000
000

result:

ok Output is valid. OK.

Test #2:

score: -100
Wrong Answer
time: 108ms
memory: 3728kb

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
10
01
11
11
11
000
000
100
000
101
000
101
100
010
111
011
111
111
111
00
00
00
10
00
00
10
00
10
11
01
00
01
11
01
01
11
11
11
11
11
000
000
000
100
000
000
101
000
000
101
000
100
111
010
000
000
101
111
010
111
011
010
111
111
011
111
111
111
111
111
0000
0000
1000
0000
1010
0000
1...

result:

wrong answer Output doesn't minimize loss.