Submission #1101095

#TimeUsernameProblemLanguageResultExecution timeMemory
1101095CiprianGardening (RMI21_gardening)C++17
5 / 100
119 ms968 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin>>t; for(int i=0; i<t; i++){ int n,m, k; cin>>n>>m>>k; if(max(m,n)<=4){ if(m%2==1 || n%2==1){ cout<<"NO"<<endl; }else if(n==2){ if(m/2==k){ int cnt=1; cout<<"YES"<<endl; for(int x=0;x<k; x++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cout<<endl; cnt=1; for(int x=0;x<k; x++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cout<<endl; }else{ cout<<"NO"<<endl; } }else{ if((m-2)/2==k-1 && k>1){ cout<<"YES"<<endl; for(int j=0; j<m; j++){ cout<<1<<" "; }cout<<endl; cout<<1<<" "; int cnt=2; for(int j=1;j<k; j++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cout<<1<<endl; cout<<1<<" "; cnt=2; for(int j=1;j<k; j++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cout<<1<<endl; for(int j=0; j<m; j++){ cout<<1<<" "; }cout<<endl; }else if(m==k){ cout<<"YES"<<endl; int cnt=1; for(int j=0; j<k/2; j++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cnt=1; cout<<endl; for(int j=0; j<k/2; j++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }int x=cnt; cout<<endl; for(int j=0; j<k/2; j++){ cout<<cnt<<" "<<cnt<<" "; cnt++; }cout<<endl; for(int j=0; j<k/2; j++){ cout<<x<<" "<<x<<" "; x++; }cout<<endl; }else{ cout<<"NO"<<endl; } } } } 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...