Submission #1265605

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265605		lioow	Gardening (RMI21_gardening)	C++20	11 / 100	64 ms	840 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
#define pil pair<int,int>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
	if(e==0) return 1;
	int tmp=expo(b,e/2);
	if(e%2) return mul(tmp,mul(tmp,b));
	else return mul(tmp,tmp);
}
const int maxn=200000;
const int N=5e5;
vector<vector<int>>ans;
//|| (n==m && max(n,m)/2+1==k)

bool keyi(int n,int m,int k){
	if(n%2 || m%2 || n/2*m/2-1==k || n/2*m/2<k || max(n,m)/2>k ) return false;
	return true;
}

void f(int n1,int n2,int m1,int m2,int k){
	int n=n2-n1+1,m=m2-m1+1;
	if(n==0||m==0) return;
	if(keyi(n-2,m-2,k-1)){
		for(int i=n1;i<=n2;i++) ans[i][m1]=ans[i][m2]=k;
		for(int j=m1;j<=m2;j++) ans[n1][j]=ans[n2][j]=k;
		f(n1+1,n2-1,m1+1,m2-1,k-1);
		return;
	}
	if(keyi(n,m-2,k-n/2)){
		for(int i=n1;i<=n2;i+=2) ans[i][m2-1]=ans[i][m2]=ans[i+1][m2-1]=ans[i+1][m2]=k,k--;
		f(n1,n2,m1,m2-2,k);
		return;
	}
	if(keyi(n-2,m,k-m/2)){
		for(int i=m1;i<=m2;i+=2) ans[n1][i]=ans[n1+1][i]=ans[n1][i+1]=ans[n1+1][i+1]=k,k--;
		f(n1+2,n2,m1,m2,k);
		return;
	}
}

void solve(){
	int n,m,k;cin>>n>>m>>k;
	if(!keyi(n,m,k)){
		cout<<"NO"<<endl;
		return;
	}
	ans=vector<vector<int>>(n+2,vector<int>(m+2));
	f(1,n,1,m,k);
	cout<<"YES"<<endl;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<ans[i][j]<<" ";
		}
		cout<<endl;
	}
}

signed main(){
  liow;
  int t=1;
  cin>>t;
  while(t--){
  	solve();
  }
}

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