QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #745288 | #9114. Black or White 2 | DaiRuiChen007 | WA | 100ms | 3648kb | C++17 | 630b | 2024-11-14 08:57:40 | 2024-11-14 08:57:40 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1505;
bool a[MAXN][MAXN];
void solve() {
int n,m,k;
cin>>n>>m>>k;
bool sw=0,rv=0;
if(n<m) swap(n,m),sw=1;
if(k*2>n*m) k=n*m-k,rv=1;
for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) a[i][j]=0;
for(int j=1;j<=m&&k;j+=2) a[1][j]=1,--k;
if(k&1) a[n][m]=1,--k;
for(int i=2;i<=n&&k;++i) for(int j=2-(i&1);j<=n&&k;j+=2) a[i][j]=a[i-1][j]=1,k-=2;
if(sw) swap(n,m);
for(int i=1;i<=n;++i,cout<<"\n") for(int j=1;j<=m;++j) cout<<((sw?a[j][i]:a[i][j])^rv);
}
signed main() {
ios::sync_with_stdio(false);
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: 3648kb
input:
2 2 2 2 2 3 0
output:
10 01 000 000
result:
ok Output is valid. OK.
Test #2:
score: -100
Wrong Answer
time: 100ms
memory: 3592kb
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 100 110 011 110 011 111 111 111 00 00 00 10 00 00 10 00 01 11 01 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:
wrong answer The number of black cell is not K