Submission #2243256

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
	int64_t n, a, b;
	cin >> n >> a >> b;
	if (n < a + b - 1 || a * b < n) {
		cout << -1 << endl;
		return 0;
	}
	vector<int64_t> v(a * b);
	for (int64_t i = 0; i < b; i++) {
		for (int64_t j = 0; j < a; j++) {
			v[a * i + j] = (b - i - 1) * a + j + 1;
		}
	}
	vector<int> e;
	for (int i = 0, j = int(v.size()) - n; j; i++) {
		if ((i + 1) % a == 0) {
			continue;
		}
		e.emplace_back(i);
		j--;
	}
	v.clear();
	for (int64_t i = 0; i < b; i++) {
		for (int64_t j = 0; j < a; j++) {
			if (*lower_bound(e.begin(), e.end(), a * i + j) == a * i + j) {
				continue;
			}
			v.emplace_back((b - i - 1) * a + j + 1);
		}
	}
	map<int, int> map;
	{
		auto tmp = v;
		sort(tmp.begin(), tmp.end());
		for (int i = 0, j = 1; i < tmp.size(); i++) {
			map[tmp[i]] = j++;
		}
	}
	for (auto &i : v) {
		cout << map[i] << ' ';
	}
	cout << endl;
	return 0;
}

Submission Info

Judge Result