Submission #1532067

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;
using LL = long long;

int main() {
	int h, w;
	cin >> h >> w;
	int n;
	cin >> n;
	vector<int> map;
	int a;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		for (int j = 0; j < a; j++) {
			map.emplace_back(i);
		}
	}
	int count = 0;
	for (int i = 0; i < h; i++) {
		if (i % 2 == 0) {
			for (int i = 0; i < w; i++) {
				cout << map[count];
				if (i != w - 1) {
					cout << " ";
					count++;
				}
			}
			cout << endl;
		}
		else {
			for (int i = 0; i < w; i++) {
				cout << map[count];
				if (i != w - 1) {
					cout << " ";
					count--;
				}
			}
			cout << endl;
		}
		count += w;
	}
}

Submission Info

Judge Result