Submission #646619

#TimeUsernameProblemLanguageResultExecution timeMemory
646619ovidiush11Gardening (RMI21_gardening)C++17
0 / 100
121 ms892 KiB
#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 = 1,y = 1,s = 0; for(ll i = 0;i < n;i++) { for(ll j = 0;j < m;j+=2) { cout<<y<<" "<<y<<" "; if(y != k)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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...