제출 #742352

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742352		kxd	Gardening (RMI21_gardening)	C++17	0 / 100	15 ms	852 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define ll unsigned long long
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second

using namespace std;
const int N = 1e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

bool f(int n, int m, int k) {
	if(k*4>n*m) return 0;
	if(n%2!=0||m%2!=0) return 0;
	if(n==2) {
		if(k!=m/2) return 0;
		//print
		cout << "YES" << endl;
		forn(i,2) {
			forn1(i,m/2) {
				cout << i << ' ' << i << ' '; 
			}
			cout << endl;
		}
		return 1;
	} else {
		if(k==m) {
			//print
			cout << "YES" << endl;
			forn(i,2) {
				forn1(i,m/2) {
					cout << i << ' ' << i << ' '; 
				}
				cout << endl;
			}
			forn(i,2) {
				forn1(i,m/2) {
					cout << i+m/2 << ' ' << i+m/2 << ' '; 
				}
				cout << endl;
			}
			return 1;
		} else if(k==((m-2)/2)+1) {
			//print
			cout << "YES" << endl;
			forn(i,m) cout << 1 << ' ';
			cout << endl;
			cout << 1 << ' ';
			forn(i,m/2-1) {
				cout << i+2 << ' ' << i+2 << ' '; 
			}
			cout << 1;
			cout << endl;
			cout << 1 << ' ';
			forn(i,m/2-1) {
				cout << i+2 << ' ' << i+2 << ' '; 
			}
			cout << 1;
			cout << endl;
			forn(i,m) cout << 1 << ' ';
			cout << endl;
			return 1;
		} else {
			return 0;
		}
	}
}

signed main() {
	INIT
	int T;
	cin >> T;
	while(T--) {
		int n, m, k;
		cin >> n >> m >> k;
		if(!f(n,m,k)) cout << "NO" << endl;
	}
}

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