oj.uz

Submission #856872

# Submission time Handle Problem Language Result Execution time Memory
856872 2023-10-04T18:15:01 Z alexdd Gardening (RMI21_gardening) C++17
5 / 100
 53 ms 5456 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> mat[200005];
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((n*m/4 + k)%2==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/4)*2,m,k/2) && verif(n-(n/4)*2,m,k-k/2))
    {
        solve(coltx, colty, (n/4)*2, m, k/2);
        solve(coltx+(n/4)*2, colty, n-(n/4)*2, m, k-k/2);
        return;
    }
    if(verif(n,(m/4)*2,k/2) && verif(n,m-(m/4)*2,k-k/2))
    {
        solve(coltx,colty,n,(m/4)*2,k/2);
        solve(coltx,colty+(m/4)*2,n,m-(m/4)*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;
            }
        }
    }
    assert(1==0);
    while(1)
        n=0;
    //cout<<-1<<" zzz\n";
    return;
}
void check(int n, int m, int k)
{
    if(color!=k)
    {
        cout<<"k is not good\n";
    }
}
signed main()
{
    //ios_base::sync_with_stdio(0);cin.tie(0);
    int t,n,m,k;
    cin>>t;
    while(t--)
    {
        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);
            //check(n,m,k);
            //continue;
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=m;j++)
                    cout<<mat[i][j]<<" ";
                cout<<"\n";
                mat[i].clear();
            }
        }
    }
    return 0;
}
/**

*/

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5456 KB Correct! Azusa and Laika like the garden :)
2 Failed 11 ms 5212 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5456 KB Correct! Azusa and Laika like the garden :)
2 Failed 11 ms 5212 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 39.0

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

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5456 KB Correct! Azusa and Laika like the garden :)
2 Failed 11 ms 5212 KB Incorrect output
3 Halted 0 ms 0 KB -