oj.uz

Submission #742413

# Submission time Handle Problem Language Result Execution time Memory
742413 2023-05-16T08:50:09 Z kxd Gardening (RMI21_gardening) C++17
5 / 100
 8 ms 720 KB 
#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
#define p(x) cout << x << endl;
 
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(m==2) {
			if(k==1) {
				p("YES");
				p("1 1 ");
				p("1 1 ");
				return 1;
			} else return 0;
		} else {
			if(k==2) {
				p("YES");
				p("1 1 2 2 ");
				p("1 1 2 2 ");
				return 1;
			} else return 0;
		}
	} else {
		if(m==2) {
			if(k==2) {
				p("YES");
				p("1 1");
				p("1 1");
				p("2 2");
				p("2 2");
				return 1;
			} else return 0;
		} else {
			if(k==2) {
				p("YES");
				p("1 1 1 1");
				p("1 2 2 1");
				p("1 2 2 1");
				p("1 1 1 1");
				return 1;
			} else if(k==4) {
				p("YES");
				p("1 1 3 3");
				p("1 1 3 3");
				p("2 2 4 4");
				p("2 2 4 4");
				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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 720 KB Correct! Azusa and Laika like the garden :)

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 720 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 340 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 720 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 340 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Failed 0 ms 212 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Failed 1 ms 212 KB Incorrect output
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 720 KB Correct! Azusa and Laika like the garden :)
2 Failed 1 ms 340 KB Incorrect output
3 Halted 0 ms 0 KB -