oj.uz

Submission #859722

# Submission time Handle Problem Language Result Execution time Memory
859722 2023-10-10T14:24:28 Z alexia_726 Gardening (RMI21_gardening) C++14
11 / 100
 18 ms 7020 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long

vector<int> mat[200005];

int t,n,m,k;

int color;

bool verif(int n, int m, int k)
{
    if(n%2==1 || m%2==1)
        return 0;

    if(k > n*m/4)
        return 0;

    if(k < max(n,m)/2)
        return 0;

    if(k == n*m/4 - 1)
        return 0;

    return 1;
}
void solve(int coltx, int colty, int n, int m, int k)
{
    if(n==0 || m==0)
        return;

    if(n==2 && m==2)
    {
        color++;
        mat[coltx][colty]=color;
        mat[coltx][colty+1]=color;
        mat[coltx+1][colty]=color;
        mat[coltx+1][colty+1]=color;
        return;
    }

    if(n>2 && m>2 && verif(n-2,m-2,k-1))
    {
        color++;
        for(int i=0;i<m;i++)
        {
            mat[coltx][colty+i]=color;
            mat[coltx+n-1][colty+i]=color;
        }
        for(int i=0;i<n;i++)
        {
            mat[coltx+i][colty]=color;
            mat[coltx+i][colty+m-1]=color;
        }

        solve(coltx+1,colty+1,n-2,m-2,k-1);

        return;
    }

    if(verif(n/2,m,k/2) && verif(n-n/2,m,k-k/2))
    {
        solve(coltx, colty, n/2, m, k/2);
        solve(coltx+n/2, colty, n-n/2, m, k-k/2);
        return;
    }

    if(verif(n,m/2,k/2) && verif(n,m-m/2,k-k/2))
    {
        solve(coltx,colty,n,m/2,k/2);
        solve(coltx,colty+m/2,n,m-m/2,k-k/2);
        return;
    }

    for(int i=2;i<=n-2;i+=2)
    {
        for(int kst=1;kst<k;kst++)
        {
            if(verif(i,m,kst) && verif(n-i,m,k-kst))
            {
                solve(coltx,colty,i,m,kst);
                solve(coltx+i,colty,n-i,m,k-kst);
                return;
            }
        }
    }

    for(int i=2;i<=m-2;i+=2)
    {
        for(int kst=1;kst<k;kst++)
        {
            if(verif(n,i,kst) && verif(n,m-i,k-kst))
            {
                solve(coltx,colty,n,i,kst);
                solve(coltx,colty+i,n,m-i,k-kst);
                return;
            }
        }
    }

    return;
}

int done[200005];

bool viz[10][200005];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);


    cin>>t;

    for(int i=1;i<=t;++i)
    {
        cin>>n>>m>>k;

        if(!verif(n,m,k))
        {
            cout<<"NO\n";
        }

        else
        {
            cout<<"YES\n";

            for(int i=1;i<=n;i++)
                mat[i].resize(m+2);

            color=0;

            solve(1,1,n,m,k);

            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=m;j++)cout<<mat[i][j]<<" ";
                cout<<"\n";
            }
        }
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6748 KB Correct! Azusa and Laika like the garden :)

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6748 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 6744 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 7020 KB Correct! Azusa and Laika like the garden :)

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6748 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 6744 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 7020 KB Correct! Azusa and Laika like the garden :)
4 Failed 8 ms 6744 KB Incorrect output
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Failed 9 ms 6748 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Failed 4 ms 6488 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6748 KB Correct! Azusa and Laika like the garden :)
2 Correct 9 ms 6744 KB Correct! Azusa and Laika like the garden :)
3 Correct 10 ms 7020 KB Correct! Azusa and Laika like the garden :)
4 Failed 8 ms 6744 KB Incorrect output
5 Halted 0 ms 0 KB -