oj.uz

Submission #761450

# Submission time Handle Problem Language Result Execution time Memory
761450 2023-06-19T16:30:55 Z US3RN4M3 Gardening (RMI21_gardening) C++17
0 / 100
 74 ms 872 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int arr[200000];

ll w, h;
int col;

inline int & get(int x, int y) {
	return arr[x*h + y];
}

pair<ll, ll> possible_range(ll n, ll m) {
	return {max(n, m) / 2, (n * m) / 4};
}

bool fits(ll n, ll m, ll k) {
	pair<ll, ll> range = possible_range(n, m);
	return (range.first <= k && k <= range.second);
}

void create_rect(ll sx, ll sy, ll n, ll m, ll k) {
	if(n == 2 || m == 2) {
		assert(k == (m * n) / 4);
		for(int i = 0; i < n; i += 2) for(int j = 0; j < m; j += 2) {
			col++;
			get(sx + i, sy + j) = col;
			get(sx + i + 1, sy + j) = col;
			get(sx + i, sy + j + 1) = col;
			get(sx + i + 1, sy + j + 1) = col;
		}
		return;
	}
	if(n != 2 && m != 2 && fits(n - 2, m - 2, k - 1)) {
		col++;
		for(int i = 0; i < n; i++) {
			get(sx + i, sy) = col;
			get(sx + i, sy + m - 1) = col;
		}
		for(int i = 0; i < m; i++) {
			get(sx, sy + i) = col;
			get(sx + n - 1, sy + i) = col;
		}
		return create_rect(sx + 1, sy + 1, n - 2, m - 2, k - 1);
	}
	if(n != 2 && fits(n - 2, m, k - (m / 2))) {
		for(int i = 0; i < m; i += 2) {
			col++;
			get(sx, sy + i) = col;
			get(sx + 1, sy + i) = col;
			get(sx, sy + i + 1) = col;
			get(sx + 1, sy + i + 1) = col;
		}
		return create_rect(sx + 2, sy, n - 2, m, k - (m / 2));
	}
	if(m != 2 && fits(n, m - 2, k - (n / 2))) {
		for(int i = 0; i < n; i += 2) {
			col++;
			get(sx + i, sy) = col;
			get(sx + i, sy + 1) = col;
			get(sx + i + 1, sy) = col;
			get(sx + i + 1, sy + 1) = col;
		}
		return create_rect(sx, sy + 2, n, m - 2, k - (n / 2));
	}
}


void solve() {
	ll k;
	cin >> w >> h >> k;
	if(w & 1 || h & 1) {
		cout << "NO" << endl;
		return;
	}
	ll lower = max(w, h) / 2;
	ll upper = (w * h) / 4;
	if(k < lower || k > upper) {
		cout << "NO" << endl;
		return;
	}
	col = 0;
	create_rect(0, 0, w, h, k);
	cout << "YES" << endl;
	for(int i = 0; i < w; i++) for(int j = 0; j < h; j++) cout << get(i, j) << " \n"[j == h - 1];
}

main() {
	int t; cin >> t;
	while(t--)
		solve();
}

Compilation message

Main.cpp:89:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   89 | main() {
      | ^~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Failed 3 ms 340 KB Output does not contain all values between 1 and k
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

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