QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#534420	#9114. Black or White 2	Goldenglow1427	RE	0ms	1624kb	C++17	2.6kb	2024-08-27 09:37:52	2024-08-27 09:37:54

Judging History

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

[2024-08-27 09:37:54]
评测

测评结果：RE
用时：0ms
内存：1624kb

查看

[2024-08-27 09:37:52]
提交

answer

/*
ID: Victor Chen [mail_vi1]
PROG: QOJ 9114
LANG: C++
*/

#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cassert>

using namespace std;

const int Maxn = 1500;

int T;

int n, m, k;
bool rev;

int mp[Maxn+10][Maxn+10];

void solve()
{
    scanf("%d%d%d", &n, &m, &k);
    if(k*2 > n*m)
        k = n*m-k, rev = true;
    else
        rev = false;
    
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            mp[i][j] = 0;

    if(k == 1)
        mp[1][1] = 1;
    else if(k == 2)
        mp[1][1] = mp[n][m] = 1;
    else if(k >= 3)
    {
        int rep = k / 3, rem = k % 3;

        int curi = -1, curj = 10000;
        for(int i=1; i<=rep; i++)
        {
            curj += 2;
            if(curj >= m)
                curj = 1, curi += 2;
            
            mp[curi][curj] = mp[curi+1][curj] = mp[curi][curj+1] = 1;
        }

        if(rem == 1)
            mp[n][m] = 1;
        else if(rem == 2)
        {
            if(n == 2)
            {
                mp[curi+1][curj+1] = mp[curi][curj+2] = 1;
                // assert(mp[n][m]+mp[n-1][m]+mp[n][m-1]+mp[n-1][m-1] != 2);
                // assert(mp[n][1]+mp[n][2]+mp[n-1][1]+mp[n-1][2] != 2);
                // assert(mp[1][m]+mp[1][m-1]+mp[2][m]+mp[2][m-1] != 2);
            }
            else if(m == 2)
            {
                mp[curi+1][curj+1] = mp[curi+2][curj] = 1;
                // assert(mp[n][m]+mp[n-1][m]+mp[n][m-1]+mp[n-1][m-1] != 2);
                // assert(mp[n][1]+mp[n][2]+mp[n-1][1]+mp[n-1][2] != 2);
                // assert(mp[1][m]+mp[1][m-1]+mp[2][m]+mp[2][m-1] != 2);
            }
            else if(curi != 1)
            {
                mp[n][m] = mp[2][2] = 1;
                assert(mp[n][m]+mp[n-1][m]+mp[n][m-1]+mp[n-1][m-1] != 2);
                assert(mp[n][1]+mp[n][2]+mp[n-1][1]+mp[n-1][2] != 2);
                assert(mp[1][m]+mp[1][m-1]+mp[2][m]+mp[2][m-1] != 2);
            }
            else
            {
                mp[n][m] = 1;
                if(n == 3)
                    mp[1][m] = 1;
                else
                    mp[n][1] = 1;
            }
        }
    }

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
            if(rev == true)
                printf("%d", 1-mp[i][j]);
            else
                printf("%d", mp[i][j]);
            
        printf("\n");
    }
}

int main()
{
    scanf("%d", &T);
    while(T != 0)
    {
        T--;
        solve();
    }
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 1624kb

input:

2
2 2 2
2 3 0

output:

result:

ok Output is valid. OK.

Test #2:

score: -100

Runtime Error

input:

output: