QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#514238#9114. Black or White 2DinalWA 168ms3880kbC++201.2kb2024-08-10 23:31:052024-08-10 23:31:06

Judging History

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

  • [2024-08-10 23:31:06]
  • 评测
  • 测评结果:WA
  • 用时:168ms
  • 内存:3880kb
  • [2024-08-10 23:31:05]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
template<typename T>
void read(T &a){
    #define gc getchar()
    char c;a=0;int f=1;
    while(!isdigit(c=gc))if(c=='-')f=-1;
    do a=a*10+c-'0';
    while(isdigit(c=gc));
    a*=f;
}
template<typename T>
void write(T a){
    if(a<0)putchar('-'),a=-a;
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> PII;
typedef pair<ll,int> PLI;
mt19937 eg;
namespace REIMU{
int n,m,k;
int a[1510][1510];
void main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
            a[i][j]=0;
    int rev=0;
    if(k>n*m/2)k=n*m-k,rev=1;
    for(int i=1;i<=n;++i)
        for(int j=(i&1)?1:2;j<=m;++j){
            if(!k||i>1&&k<2)break;
            if(i==1)a[i][j]=1,--k;
            else a[i][j]=a[i-1][j]=1,k-=2;
        }
    if(k)a[n][m]=1;
    for(int i=1;i<=n;++i,puts(""))
        for(int j=1;j<=m;++j)printf("%d",a[i][j]^rev);
}
}
int main(){
    // freopen("5.in","r",stdin);
    eg.seed(chrono::system_clock::now().time_since_epoch().count());
    int T;cin>>T;
    while(T--)REIMU::main();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
2 2 2
2 3 0

output:

11
00
000
000

result:

ok Output is valid. OK.

Test #2:

score: -100
Wrong Answer
time: 168ms
memory: 3880kb

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
11
00
01
11
11
11
000
000
100
000
110
000
111
000
001
111
011
111
111
111
00
00
00
10
00
00
11
00
00
11
00
01
00
11
11
01
11
11
11
11
11
000
000
000
100
000
000
110
000
000
111
000
000
111
000
001
000
111
110
000
111
111
001
111
111
011
111
111
111
111
111
0000
0000
1000
0000
1100
0000
1...

result:

wrong answer Output doesn't minimize loss.