QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#537230 | #9114. Black or White 2 | Insert_Username_Here | AC ✓ | 112ms | 12384kb | C++20 | 1.1kb | 2024-08-29 23:57:14 | 2024-08-29 23:57:15 |
Judging History
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, bk = 0, flip = 0, cur = 0;
cin >> n >> m >> k;
if(n < m) swap(n, m), bk = 1;
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;
if(bk) swap(n, m);
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
if(bk) cout << (ans[j][i] ^ flip);
else 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: 3608kb
input:
2 2 2 2 2 3 0
output:
10 10 000 000
result:
ok Output is valid. OK.
Test #2:
score: 0
Accepted
time: 108ms
memory: 3668kb
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 100 110 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 1001 0000 1...
result:
ok Output is valid. OK.
Test #3:
score: 0
Accepted
time: 88ms
memory: 12008kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #4:
score: 0
Accepted
time: 91ms
memory: 12348kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #5:
score: 0
Accepted
time: 96ms
memory: 12276kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #6:
score: 0
Accepted
time: 96ms
memory: 12204kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #7:
score: 0
Accepted
time: 100ms
memory: 12264kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #8:
score: 0
Accepted
time: 92ms
memory: 11612kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #9:
score: 0
Accepted
time: 112ms
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #10:
score: 0
Accepted
time: 53ms
memory: 5756kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #11:
score: 0
Accepted
time: 54ms
memory: 3716kb
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 10 101 000 100 110 010 111 10 00 10 11 01 00 01 11 01 101 000 000 101 000 100 111 010 000 000 101 111 010 111 011 010 111 111 1001 0000 1000 1100 1001 1100 0111 0011 0110 1111 1000 0000 1000 1001 0000 1000 1000 1100 1000 1001 1100 1000 1110 1100 1000 0110 0011 0111 0111 0011 0111 0110 1111 0111 0...
result:
ok Output is valid. OK.
Test #12:
score: 0
Accepted
time: 88ms
memory: 12380kb
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: 89ms
memory: 12384kb
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