Submission #923902

#	Time	Username	Problem	Language	Result	Execution time	Memory
923902		GrindMachine	Gardening (RMI21_gardening)	C++17	0 / 100	11 ms	860 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m,k; cin >> n >> m >> k;
    assert(n == m);

    ll subn = 0;
    if(n&1) subn = 1;
    n -= subn;

    ll a[n+5][n+5];
    memset(a,0,sizeof a);
    ll ptr = 0;

    for(int i = 1; i < n; i += 2){
        for(int j = 1; j < n; j += 2){
            a[i][j] = a[i][j+1] = a[i+1][j] = a[i+1][j+1] = ++ptr;
        }
    }

    if(k > ptr){
        no;
        return;
    }

    for(int i = 1; i < n; i += 2){
        for(int j = 3; j < n; j += 2){
            if(ptr == k) conts;
            a[i][j] = a[i][j+1] = a[i+1][j] = a[i+1][j+1] = a[i][j-1];
            ptr--;
        }
    }

    vector<ll> b;
    rep1(i,n){
        rep1(j,n){
            b.pb(a[i][j]);
        }
    }
    sort(all(b));
    b.resize(unique(all(b))-b.begin());

    rep1(i,n){
        rep1(j,n){
            a[i][j] = lower_bound(all(b),a[i][j])-b.begin()+1;
        }
    }

    if(subn){
        rep1(i,n) a[i][n+1] = a[i][n];
        rep1(j,n) a[n+1][j] = a[n][j];
        a[n+1][n+1] = a[n][n];
        n++;
    }

    yes;

    rep1(i,n){
        rep1(j,n){
            cout << a[i][j] << " ";
        }
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    cin >> t;

    rep1(i, t) {
        solve(i);
    }

    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