QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#586441	#9114. Black or White 2	pengpeng_fudan	AC ✓	139ms	4024kb	C++23	3.5kb	2024-09-24 12:23:22	2024-09-24 12:23:22

Judging History

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

[2024-09-24 12:23:22]
评测

测评结果：AC
用时：139ms
内存：4024kb

查看

[2024-09-24 12:23:22]
提交

answer

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

void solve(void) {
    int n,m,k;
    cin>>n>>m>>k;
    bool flag=(n>m);
    if(n>m) swap(n,m);
    if(n==4&&m==4&&k==7){
        cout<<"0111"<<'\n';
        cout<<"1110"<<'\n';
        cout<<"0100"<<'\n';
        cout<<"0000"<<'\n';
        return ;
        k=0;
    }
    vector<vector<bool>> ans(n+1,vector<bool>(m+1));
    if(n==2){
        if(k==1){ans[1][1]=1;k--;}
        else if(k==2)   {ans[1][1]=ans[n][m]=1;k-=2;}
        else{
            for(int i=2;i<=m&&k;i++){
                if(k==1){ans[1][1]=1;k--;break;}
                ans[1][i]=ans[2][i-1]=1;k-=2;
            }
            if(k)   {ans[n][m]=1;k--;}
            if(k)   {ans[1][1]=1;k--;}

        }       
    }
    else{
        if(k==0);
        else if(k==1){
            ans[1][1]=1;k--;
        }
        else if(k==2){
            ans[1][1]=ans[1][m]=1;k-=2;
        }
        else if(k==3){
            ans[1][1]=ans[1][m]=ans[n][1]=1;k-=3;
        }
        else if(k==4){
            ans[1][1]=ans[1][m]=ans[n][1]=ans[n][m]=1;k-=4;
        }
        else{
            ans[2][1]=ans[1][2]=ans[2][2]=ans[2][3]=ans[3][2]=1;
            k-=5;
            int x=3;
            while(x+1<=n&&k){
                if(k==1)    {ans[1][1]=1;k--;break;}
                if(k==2)    {ans[1][1]=ans[1][m]=1;k=0;break;}
                ans[x+1][x]=ans[x][x+1]=ans[x][x]=1;k-=3;
                x++;
            }
            if(k){
                if(k==1){ans[1][1]=1;k=0;}
                else if(n==m){k--;ans[n][m]=1;}
                else if(k>=2){ans[n][n]=ans[n][n+1]=1;k-=2;}
            }
            x=1;int y=3;int lo=3;
            while(k){
                if(y+1<=m){
                    if(k==1) {ans[1][1]=1;k--;break;}
                    else {ans[x][y]=ans[x][y+1]=1;k-=2;}
                }
                else if(y<=m){
                    ans[x][y]=1;k--;
                }
                if(x==1)    lo+=2;
                if(x==n)    {
                    x=1,y=lo;
                    if(lo>m)    break;
                }
                else x++,y++;
            }


            x=3,y=1;lo=3;
            while(k){
                if(x+1<=n){
                    if(k==1) {ans[1][1]=1;k--;break;}
                    else {ans[x][y]=ans[x+1][y]=1;k-=2;}
                }
                else if(x<=n){
                    ans[x][y]=1;k--;
                }
                if(y==1)    lo+=2;
                if(y==n)    {
                    y=1,x=lo;
                    if(lo>n)    break;
                }
                else x++,y++;
            }
        }
        if(k)   {ans[1][1]=1;k--;}
    }
    if(flag){
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++)   cout<<ans[j][i];
            cout<<'\n';
        }
    }
    else{
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)   cout<<ans[i][j];
            cout<<'\n';
        }
    }
    assert(k==0);

}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    int _ = 1;
    cin >> _;
    while (_--) solve();

    return 0;
}

/*
UTCUCUCUCUPC
 */

/*

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
*/

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3808kb

input:

2
2 2 2
2 3 0

output:

result:

ok Output is valid. OK.

Test #2:

score: 0

Accepted

time: 129ms

memory: 3572kb

input:

output:

result:

ok Output is valid. OK.

Test #3:

score: 0

Accepted

time: 105ms

memory: 3776kb

input:

output:

result:

ok Output is valid. OK.

Test #4:

score: 0

Accepted

time: 105ms

memory: 3752kb

input:

output:

result:

ok Output is valid. OK.

Test #5:

score: 0

Accepted

time: 105ms

memory: 3984kb

input:

output:

result:

ok Output is valid. OK.

Test #6:

score: 0

Accepted

time: 105ms

memory: 3672kb

input:

output:

result:

ok Output is valid. OK.

Test #7:

score: 0

Accepted

time: 109ms

memory: 3640kb

input:

output:

result:

ok Output is valid. OK.

Test #8:

score: 0

Accepted

time: 101ms

memory: 3632kb

input:

output:

result:

ok Output is valid. OK.

Test #9:

score: 0

Accepted

time: 139ms

memory: 3732kb

input:

output:

result:

ok Output is valid. OK.

Test #10:

score: 0

Accepted

time: 60ms

memory: 3628kb

input:

output:

result:

ok Output is valid. OK.

Test #11:

score: 0

Accepted

time: 56ms

memory: 3484kb

input:

output:

result:

ok Output is valid. OK.

Test #12:

score: 0

Accepted

time: 100ms

memory: 3804kb

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: 104ms

memory: 4024kb

input:

3
1500 1500 1125000
1322 1322 873842
1158 2 1158

output:

011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

result:

ok Output is valid. OK.

Extra Test:

score: 0

Extra Test Passed