Submission #646629

#	Time	Username	Problem	Language	Result	Execution time	Memory
646629		ovidiush11	Gardening (RMI21_gardening)	C++14	0 / 100	132 ms	720 KiB

Main

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

#define ll long long

void solve()
{
    ll n,m,k;
    cin>>n>>m>>k;
    if(k > floor(n/2) * floor(m/2))
    {
        cout<<"NO"<<endl;
        return ;
    }
    cout<<"YES"<<endl;
    ll x = 0,y = 0,s = 0;
    for(ll i = 0;i < n;i++)
    {
        for(ll j = 0;j < m-1;j+=2)
        {
            if(y != k)y++;
            cout<<y<<" "<<y<<" ";
        }
        if(m % 2 == 1)cout<<y;
        cout<<endl;
        if(s == 0)
        {
            s++;
            y = x;
        }
        else
        {
            s = 0;
            if(y == k)y = x;
            else x = y;
        }
    }
    return ;
}

int main()
{
    ll t;
    cin>>t;
    while(t--)solve();
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 18
• Subtask 5: 0 / 39
• Subtask 6: 0 / 22